Success of Wireless Sensor Networks largely depends whether the deployed network can provide desired coverage with acceptable network lifetime. This paper proposes a distributed protocol for ensuring area coverage using a combination of mobile and static sensor nodes. Most of the assumptions made in our approach are realistic (sensing model, movement thresholds based on real radio characteristics etc.) and implementable in real-life applications. We demonstrate that, for different type of initial deployments, our proposed movement algorithms consume only 30-40% of the energy consumed by the basic virtual force algorithm. We formulated our problem as Integer Linear Program to arrive at idealistic optimal solutions that form basis of our performance comparison. We validated our results through extensive discrete event simulations. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ahmed, N., Kanhere, S. S., & Jha, S. (2007). Ensuring area coverage in hybrid wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4864 LNCS, pp. 548–560). Springer Verlag. https://doi.org/10.1007/978-3-540-77024-4_50
Mendeley helps you to discover research relevant for your work.