Maintaining Coverage by Progressive Crystal-Lattice Permutation in Mobile Wireless Sensor Networks

A new distributed algorithm, called Crystal-Lattice Permutation (CLP) algorithm, is devised to approach the coverage problem in wireless sensor networks. All nodes are assumed as mobile and run the same CLP algorithm in . An initial seed triggers six neighboring nodes to move to hexagon permutation positions, which is like the Crystal-Lattice formation process in nature. These chosen nodes then become new seeds to trigger other neighboring nodes. By such a progressive process, with initial and boundary conditions, the coverage is achieved. Comparing to the Virtual Force algorithm (VFA), the CLP algorithm needs fewer nodes and takes shorter average moving distance to achieve 100% coverage in random deployment. In simulation, the CLP algorithm deployed at least 60 nodes to achieve the 100% coverage, while the VFA algorithm required more than 100 nodes, under the same assumptions. The average moving distance for each CLP node was less than a half of the VFA node. In addition, as there are n mobile nodes, the number of CLP messages is proportional to n, while VFA is proportional to n2. The CLP algorithm is robust in fault tolerance when some nodes are error in distribution.

[1]  Thomas F. La Porta,et al.  A bidding protocol for deploying mobile sensors , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[2]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[3]  Thomas F. La Porta,et al.  Bidding Protocols for Deploying Mobile Sensors , 2007, IEEE Transactions on Mobile Computing.

[4]  Jie Wu,et al.  Coverage issue in sensor networks with adjustable ranges , 2004 .

[5]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[6]  Pramod K. Varshney,et al.  A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Dragos Niculescu,et al.  Positioning in ad hoc sensor networks , 2004, IEEE Network.

[8]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[9]  Tatsuhiro Tsuchiya,et al.  A self-organizing technique for sensor placement in wireless micro-sensor networks , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[10]  Thomas F. La Porta,et al.  Proxy-based sensor deployment for mobile sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

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

[12]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

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