A Virtual Rhomb Grid-Based Movement-Assisted Sensor Deployment Algorithm in Wireless Sensor Networks

Sensor deployment, to a large extent, affects the performance and effectiveness of wireless sensor networks (WSN). For the conservation of energy, selecting only a subset of nodes is active and others are sleep. The problem is represented by the connected dominating set (CDS) of the graph, and the minimum connected dominating set (MCDS) is NP-hard for arbitrary graphs. The deployment is either deterministic or self-organizing. By analyzing of the relationship between both of the deployment, a virtual rhomb grid-based movement-assisted sensor deployment algorithm (VRGMSD) is proposed, which integrates both deterministic and self-organizing deployment in a unified framework. The VRGMSD algorithm (1) can form a MCDS; (2) ensures that there is no "holes" in the sensor field; (3) can select different k (the degree of coverage or connectivity) according to the demand on different applications. This flexibility allows the network to self-configure for a wide range of applications

[1]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[2]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[3]  David Y. Fong,et al.  Wireless Sensor Networks , 2003 .

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

[5]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[6]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[7]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[8]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[10]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[11]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[12]  Marco Locatelli,et al.  Packing equal circles in a square: a deterministic global optimization approach , 2002, Discret. Appl. Math..

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

[14]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[15]  B. Hofmann-Wellenhof,et al.  Global Positioning System , 1992 .

[16]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[17]  David E. Culler,et al.  Calibration as parameter estimation in sensor networks , 2002, WSNA '02.

[18]  Yogen K. Dalal,et al.  The clearinghouse: a decentralized agent for locating named objects in a distributed environment , 1983, TOIS.

[19]  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).

[20]  Mohamed F. Younis,et al.  Energy-aware routing in cluster-based sensor networks , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[21]  Lixia Zhang,et al.  Recursive position estimation in sensor networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

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