A Location-free Algorithm of Energy-Efficient Connected Coverage for High Density Wireless Sensor Networks

Authors:
Hongxing Bai;Xi Chen;Bin Li;Dianfei Han
Affiliations:
Center For Intelligent and Networked Systems (CFINS), Department of Automation, Tsinghua University, Beijing, China 100084;Center For Intelligent and Networked Systems (CFINS), Department of Automation, Tsinghua University, Beijing, China 100084;Center For Intelligent and Networked Systems (CFINS), Department of Automation, Tsinghua University, Beijing, China 100084;Center For Intelligent and Networked Systems (CFINS), Department of Automation, Tsinghua University, Beijing, China 100084
Venue:
Discrete Event Dynamic Systems
Year:
2007

Citing 0
Cited 3

Potential game model to detect holes in sensor networks

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most serious concerns for wireless sensor networks (WSN) is energy. To obtain long lifetime, one potential method is deploying redundant sensors in the WSN and let each sensor switch its state between ACTIVE and OFF. At the same time, the WSN should meet various requirements of quality of service (QoS). This paper focuses on two important measurements of OoS: sensing coverage and network connectivity. Existing researches have provided many algorithms to schedule the nodes' states for coverage preserving, including location-free ones. Our work differs from existing location-free algorithms in several key ways: (1). We propose a novel principle on coverage preserving that is suitable for location-free schemes; (2). Following the principle, a distributed, localized and location-free node scheduling algorithm, Stand Guard Algorithm (StanGA), is proposed for treating coverage and connectivity in a unified scheme. Under certain conditions, StanGA can guarantee network connectivity and any degree of sensing coverage. Simulation results show that StanGA is scalable and robust, and also show that StanGA outperforms existing location-free algorithms even when only coverage issue is considered.