Location of Repository

A Localized Coverage Preserving Protocol for Wireless Sensor Networks

By Yuheng Liu, Juhua Pu, Shuo Zhang, Yunlu Liu and Zhang Xiong

Abstract

In a randomly deployed and large scale wireless sensor network, coverage-redundant nodes consume much unnecessary energy. As a result, turning off these redundant nodes can prolong the network lifetime, while maintaining the degree of sensing coverage with a limited number of on-duty nodes. None of the off-duty eligibility rules in the literature, however, are sufficient and necessary conditions for eligible nodes. Hence redundancy or blind points might be incurred. In this paper we propose a complete Eligibility Rule based on Perimeter Coverage (ERPC) for a node to determine its eligibility for sleeping. ERPC has a computational complexity of O(N2log(N)), lower than the eligibility rule in the Coverage Control Protocol (CCP), O(N3), where N is the number of neighboring nodes. We then present a Coverage Preserving Protocol (CPP) to schedule the work state of eligible nodes. The main advantage of CPP over the Ottawa protocol lies in its ability to configure the network to any specific coverage degree, while the Ottawa protocol does not support different coverage configuration. Moreover, as a localized protocol, CPP has better adaptability to dynamic topologies than centralized protocols. Simulation results indicate that CPP can preserve network coverage with fewer active nodes than the Ottawa protocol. In addition, CPP is capable of identifying all the eligible nodes exactly while the CCP protocol might result in blind points due to error decisions. Quantitative analysis and experiments demonstrate that CPP can extend the network lifetime significantly while maintaining a given coverage degree

Topics: Article
Publisher: Molecular Diversity Preservation International (MDPI)
OAI identifier: oai:pubmedcentral.nih.gov:3280745
Provided by: PubMed Central
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.pubmedcentral.nih.g... (external link)
  • Suggested articles

    Preview

    Citations

    1. (2002). A coverage-preserving node scheduling scheme for large wireless sensor networks.
    2. (2002). A survey on sensor networks.
    3. (2007). An optimal coverage-preserving scheme for wireless sensor networks based on local information exchange.
    4. (2007). Analysis for multi-coverage problem in wireless sensor networks.
    5. (2008). and Simulink for Technical Computing. http://www.mathworks.com/.
    6. (2005). Barrier coverage with wireless sensors.
    7. (2001). Coverage problems in wireless ad-hoc sensor networks.
    8. (2007). Designing localized algorithms for barrier coverage.
    9. (2003). Distributed localization in wireless sensor networks: A quantitative comparison.
    10. (2003). DV Based Positioning
    11. (2006). Energy-efficient coverage problems in wireless ad-hoc sensor networks.
    12. (2005). Energy-efficient target coverage in wireless sensor networks.
    13. (2001). Exposure in wireless ad-hoc sensor networks.
    14. (2001). Geography-informed energy conservation for ad hoc routing.
    15. (2005). Improving wireless sensor network lifetime through power aware organization.
    16. (2003). Integrated coverage and connectivity configuration in wireless sensor networks.
    17. (2005). Maintaining sensing coverage and connectivity in large sensor networks. AdHoc Sensor Wirel.
    18. (2004). On k-coverage in a mostly sleeping sensor network.
    19. (2003). PEAS: A robust energy conserving protocol for long-lived sensor networks.
    20. (2004). Power conservation and quality of surveillance in target tracking sensor networks.
    21. (2007). Reliable density estimates for coverage and connectivity in thin strips of finite length.
    22. (2003). The Coverage Problem in a Wireless Sensor Network.
    23. (2008). Wireless Sensor Networks: Micaz 2.4GHz. http://www.xbow.com.

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.