An Optimal Coverage Scheme for Wireless Sensor Network

The coverage problem is one of the most fundamental issues in a wireless sensor network, which directly affects the capability and efficiency of the sensor network. In this paper, we formulate this problem as a construction problem to find a topology that covers the required sensing area with high reliability. Deploying a good topology is also beneficial to management and energy saving. We propose an optimal coverage scheme for wireless sensor networks that can maintain sufficient sensing area as well as provide high reliability and long system lifetime, which is the main design challenge in sensor networks. With the same number of sensors, our scheme compares favorably with the existing schemes.

[1]  Mani B. Srivastava,et al.  Topology management for sensor networks: exploiting latency and density , 2002, MobiHoc '02.

[2]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[3]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[4]  Mani Srivastava,et al.  Energy efficient routing in wireless sensor networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[5]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[6]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[7]  Deborah Estrin,et al.  ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[9]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.