Coverage holes reduction in movable sensor networks using Minimum Movement Technique

In wireless sensor networks, the efficiency mainly depends on the network connectivity among the nodes as well as coverage of the monitoring area. To handle the connectivity problem, the possible network partitions are detected earlier by detecting the cut-vertices which are the critical nodes in the network whose failure leads to network partition. These points are identified through Cut-vertex determination algorithm. The failure handler set, which is used to restore the connectivity failure due to failure of any cut-vertex, is determined by Connected Dominating Set (CDS) algorithm. The connectivity problem in the network is resolved by utilizing the controlled mobility feature of the sensor nodes. The coverage holes are introduced in the network due to the total movement of such failure handler set. To minimize the number of coverage holes, the failure handler is placed nearer to the position of failed node without affecting the connectivity. This technique is named as Minimum Movement Technique (MMT). To restore the connectivity, the nodes in the failure handling set move towards the feasible points. These points are calculated by MMT. The Simulation results prove that the proposed MMT minimizes the total mobility distance required to reach these points and the coverage holes in the network.

[1]  Prasant Mohapatra,et al.  A Scalable Hybrid Approach to Switching in Metro Ethernet Networks , 2007 .

[2]  Prasan Kumar Sahoo,et al.  Vector method based coverage hole recovery in Wireless Sensor Networks , 2010, 2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010).

[3]  Thomas F. La Porta,et al.  Sensor relocation in mobile sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Mani B. Srivastava,et al.  Mobile Element Scheduling with Dynamic Deadlines , 2007, IEEE Transactions on Mobile Computing.

[5]  C. Siva Ram Murthy,et al.  Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[6]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[7]  Ameer Ahmed Abbasi,et al.  A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[8]  Mohamed F. Younis,et al.  Coverage and latency aware actor placement mechanisms in WSANs , 2008, Int. J. Sens. Networks.

[9]  Dharma P. Agrawal,et al.  Coverage and Lifetime Optimization of Wireless Sensor Networks with Gaussian Distribution , 2008, IEEE Transactions on Mobile Computing.

[10]  Kemal Akkaya,et al.  Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility , 2010, IEEE Transactions on Computers.

[11]  J.-S. Li,et al.  Distributed K-coverage self-location estimation scheme based on Voronoi diagram , 2010, IET Commun..

[12]  Mohamed F. Younis,et al.  C2AP: Coverage-aware and Connectivity-constrained Actor Positioning in Wireless Sensor and Actor Networks , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.