Optimal and distributed algorithms for coverage hole healing in hybrid sensor networks Online publication date: Fri, 01-Jun-2012
by Dung T. Nguyen; Nam P. Nguyen; My T. Thai; Abdelsalam Helal
International Journal of Sensor Networks (IJSNET), Vol. 11, No. 4, 2012
Abstract: Network coverage is one of the most decisive factors for determining the efficiency of a WSN. In this paper, we focus on how to schedule mobile sensors in order to cope with coverage hole issues in a hybrid WSN containing both static and mobile sensors. To this end, we introduce a new metric, namely to maximise the minimum remaining energy of all moved sensors since the more energy remains, the longer the network can operate. Based on this metric, we propose an efficient coverage healing algorithm that always determines an optimal location for each mobile sensor in order to heal all coverage holes, after all mobile sensors locations and coverage holes are located. When the target area is too big, we present a scalable area-based algorithm which returns a near optimal solution. Furthermore, we also present a lightweight-distributed scheduling strategy for mobile sensors in case of small sensor failures.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook