Coverage-preserving routing protocols for randomly distributed wireless sensor networks

Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routing protocol is generally independent of the sensing coverage issue. Since some nodes may become invalid after they have used up their own energy resource, the achievable sensing coverage will gradually degrade as time passes. Different routing protocols may motivate different distributions of energy dissipation among nodes, and thus induce different changes in the network topology after some nodes have died out. This implies that different routing protocols will lead to different sensing coverage when some nodes are no longer available. Considering the impact on the sensing coverage of a network, we have proposed coverage-preserving routing protocols which are modified from the LEACH and virtual grid routing protocols. These proposed protocols can substantially improve the performance of sensing coverage. According to the simulation results, the sensing coverage degradation of the coverage-preserving protocols is slower than that of the other baseline protocols. For the time duration maintaining the network coverage over 50%, a gain of 20% in overall sensing coverage can be obtained by using the coverage-preserving protocols.

[1]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[2]  Dirk Timmermann,et al.  Low energy adaptive clustering hierarchy with deterministic cluster-head selection , 2002, 4th International Workshop on Mobile and Wireless Communications Network.

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

[4]  Wendi B. Heinzelman,et al.  DAPR: a protocol for wireless sensor networks utilizing an application-based routing cost , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[5]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[6]  Leonidas J. Guibas,et al.  Lightweight sensing and communication protocols for target enumeration and aggregation , 2003, MobiHoc '03.

[7]  Gordon L. Stuber,et al.  Principles of mobile communication (2nd ed.) , 2001 .

[8]  Deborah Estrin,et al.  Next Century Challenges: Mobile Networking for Smart Dust , 1999, MobiCom 1999.

[9]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[10]  A. Ghosh,et al.  Estimating coverage holes and enhancing coverage in mixed sensor networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[11]  S. Sitharama Iyengar,et al.  Sensor placement for grid coverage under imprecise detections , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[12]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[13]  Mani B. Srivastava,et al.  Critical density thresholds for coverage in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[14]  Jerry D. Cavin.  Advances in distributed sensor technology , 1996, IEEE Parallel & Distributed Technology: Systems & Applications.