In this paper, we propose a efficient grid-based sense schedule scheme for event detection in Wireless Sensor Networks. The target environment is partitioned into grids and the sensors within each grid elect one representative to carry out the sense task in turn, with low communication overhead, balanced energy consumption and good scalability. It is demonstrated by analysis and simulation that the grid-based sense schedule can achieve energy saving proportional to the node density and guaranty better detection quality than random schedule. The scheme also provides means to balance network lifetime and detection quality by adjusting size of grid and duty time of node. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Hu, X., & Yang, X. (2007). Grid-based sense schedule for event detection in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4611 LNCS, pp. 557–566). Springer Verlag. https://doi.org/10.1007/978-3-540-73549-6_55
Mendeley helps you to discover research relevant for your work.