Self-Deployment Algorithms for Coverage Problem in a Network of Mobile Sensors with Unidentical Sensing Ranges

Abstract

In this paper, efficient sensor deployment algorithms are proposed to improve the coverage area in the target field. The proposed algorithms calculate the position of the sensors iteratively, based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to discover the coverage holes corresponding to different sensors with different sensing ranges. Under the proposed procedures, the sensors move in such a way that the coverage holes in the target field are reduced. Simulation results are provided to demonstrate the effectiveness of the deployment schemes proposed in this paper.

A Source Coding Perspective on Node Deployment in Two-Tier Networks

“…The sensing coverage problem in heterogeneous WSNs where sensors have different sensing ranges is discussed in [41]- [43]. Mahboubi et al [41] extend the three movement-assisted protocols in [6] to avoid coverage holes in heterogeneous WSNs. Wu et al [42] utilize a scoring method to improve the sensor coverage rate.…”

“…A similar node deployment problem over a non-convex environment, where the nodes can be placed everywhere other than some obstacles, are considered in [39], [40]. The sensing coverage problem in heterogeneous WSNs where sensors have different sensing ranges is discussed in [41]- [43]. Mahboubi et al [41] extend the three movement-assisted protocols in [6] to avoid coverage holes in heterogeneous WSNs.…”

“…Going back to the original variables, we have the optimal AP locations p n = q+λcn 1+λ , n ∈ I A . Substituting the optimal AP locations to (41), the constraint in (42) . Specially, when λ = 0, we have p n = q, ∀n ∈ I A .…”

Coverage Enhancement Algorithms for Distributed Mobile Sensors Deployment in Wireless Sensor Networks

“…For each Edge in polygon (10) Find midpoint of Edge (11) Append midpoint to new polygon (12) End For each Edge (13) Until vertices are very close to each other (14) Record the statistical average of new candidate location into newpositions (15) End For each polygon (16) Checkforbettercoverage (VD, positions, newpositions) // Function for if NCL > CL (17) Newcov = calculatecoverage (VD, newpositions) (18) Newcovpercent = (newcov/MFL 2 ) * 100 (19) IF coverage enhanced then (20) IF Round ≤ MR (21) calcEnergy (positions, newposition, permeterEnergy) (22) position = newpositions (23) totalcov = newtotalcov (24) totalcovpercent = newtotalcovpercent (25) else (26) exit Loop (27) End IF Round (28) Else (29) Exit Loop (30) End IF coverage (31) Next Round (32) calculatecoverage average for all rounds (33) calculateEnergy consumption average for all rounds (34) calculateconvergence average for all rounds Algorithm 3: Edge Based Centroid (EBC) of th Voronoi polygon ( ).…”

“…In addition, each sensor node has limited sensing and communication abilities which make the sensor nodes unable to obtain the entire network information [15,16]. Therefore, sensors are deployed randomly and allowed to move and communicate with their neighbours by exchanging information related to each of them.…”