Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Mesh-based sensor relocation for coverage maintenance in mobile sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Localized sensor self-deployment for guaranteed coverage radius maximization
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Simple movement control algorithm for bi-connectivity in robotic sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Optimizing movement and connectivity in mobile networks with partial cooperativeness
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Optimal sensor networks for area monitoring using rotating and beam sensors
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We pinpoint a new sensor self-deployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius. We propose two purely localized solution protocols Greedy Advance (GA) and Greedy-Rotation-Greedy (GRG), both of which are resilient to node failures and work regardless of network partition. The two algorithms drive sensors to move along a locally-computed triangle tessellation (TT) to surround the POI. In GA, nodes greedily proceed as close to the POI as they can; in GRG, when their greedy advance is blocked, nodes rotate around the POI to a TT vertex where greedy advance can resume. They both yield a connected network of TT layout with hole-free coverage. Further, GRG ensures a hexagon coverage shape centered at the POI.