Redundant Movement-assisted Sensor Deployment Based on Virtual Rhomb Grid in Wireless Sensor Networks

In wireless sensor networks (WSN), for energy conservation, 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. In some situations, different applications can require different redundancy. By analysing both the deployments and considering different redundancy requirement for different applications, the epsi-redundant movement-assisted sensor deployment based on virtual rhomb grid (epsiMSDVRG) is proposed. The epsiMSDVRG algorithm has such characteristics as follows: (1) proposing a measurement standard of node redundancy in WSN; (2) forming a MCDS; (3) no "holes" in the sensor field, which ensures full and seamless coverage of sensing and communication; (4) k (the degree of coverage or connectivity) varies for different applications; and (5) epsi (the redundant degree of sensor nodes) varies for different applications

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

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

[3]  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.

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

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

[6]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

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

[8]  Yunghsiang Sam Han,et al.  Scheduling Sleeping Nodes in High Density Cluster-based Sensor Networks , 2005, Mob. Networks Appl..

[9]  Parameswaran Ramanathan,et al.  Fault tolerance in collaborative sensor networks for target detection , 2004, IEEE Transactions on Computers.

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

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

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

[13]  Peng-Jun Wan,et al.  Distributed heuristics for connected dominating sets in wireless ad hoc networks , 2002, Journal of Communications and Networks.

[14]  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.

[15]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[16]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

[17]  Jing Deng,et al.  Elective participation in ad hoc networks based on energy consumption , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

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

[20]  Wendi Heinzelman,et al.  Balanced-energy sleep scheduling scheme for high density cluster-based sensor networks , 2004 .

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

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

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

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

[25]  Di Tian,et al.  A node scheduling scheme for energy conservation in large wireless sensor networks , 2003, Wirel. Commun. Mob. Comput..

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