Sensor networks consist of autonomous nodes with battery powered. Nodes can be sleep to extend the lifetime of network without compromising area coverage and network connectivity. Most existing approaches to connected coverage require knowledge of accurate location information. However, the energy cost and system complexity involved in obtaining the accurate location information may compromise the effectiveness of proposed solution as a whole. This paper addresses the problem of maximizing network lifetime while providing coverage and connectivity without accurate location information of sensor nodes. Our solution is based on the theoretical analysis of the sensing area coverage property of minimal dominating set. We establish the relationship between point coverage and area coverage in random geometric graphs. Based on the analytical results and Rule K algorithms constructing the connected dominating set, a Location-Unaware Connected Coverage Protocol (LUCCP) is proposed. Simulation studies show that the proposed LUCCP can effectively maintain both high quality sensing coverage and connectivity for a long time. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Mao, Y., Chen, L., & Chen, D. (2007). A location-unaware connected coverage protocol 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. 524–534). Springer Verlag. https://doi.org/10.1007/978-3-540-73549-6_52
Mendeley helps you to discover research relevant for your work.