Connectivity maintenance and coverage preservation in wireless sensor networks

  • Authors:

  • Di Tian;Nicolas D. Georganas

  • Affiliations:

  • Distributed and Collaborative Virtual Environments Research Laboratory (DISCOVER), School of Information Technology and Engineering, University of Ottawa, 800 King Edward Avenue, 550 Cumberland, O ...;Distributed and Collaborative Virtual Environments Research Laboratory (DISCOVER), School of Information Technology and Engineering, University of Ottawa, 800 King Edward Avenue, 550 Cumberland, O ...

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain long system lifetime. Low cost of sensors enables us to randomly deploy a large number of sensor nodes. Thus, a potential approach to solve lifetime problem arises. That is to let sensors work alternatively by identifying redundant nodes in high-density networks and assigning them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In a single wireless sensor network, sensors are performing two operations: sensing and communication. Therefore, there might exist two kinds of redundancy in the network. Most of the previous work addressed only one kind of redundancy: sensing or communication alone. Wang et al. [Intergrated Coverage and Connectivity Configuration in Wireless Sensor Networks, in: Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, November 2003] and Zhang and Hou [Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Technical report UIUCDCS-R-2003-2351, June 2003] first discussed how to combine consideration of coverage and connectivity maintenance in a single activity scheduling. They provided a sufficient condition for safe scheduling integration in those fully covered networks. However, random node deployment often makes initial sensing holes inside the deployed area inevitable even in an extremely high-density network. Therefore, in this paper, we enhance their work to support general wireless sensor networks by proving another conclusion: ''the communication range is twice of the sensing range'' is the sufficient condition and the tight lower bound to ensure that complete coverage preservation implies connectivity among active nodes if the original network topology (consisting of all the deployed nodes) is connected. Also, we extend the result to k-degree network connectivity and k-degree coverage preservation.