Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.