Effective coverage gap repairing in wireless sensor network Online publication date: Fri, 31-Oct-2014
by Kukunuru Nikitha; Davuluri RajyaLakshmi; Avula Damodaram
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 7, No. 5, 2014
Abstract: In the heterogeneous sensor network, energy depleted sensors result in coverage gap. The replacement of this energy depleted sensor is a difficult task and has a larger impact on network coverage. To maximise coverage, this paper presents a proactive approach called Coverage Gap Repairing (CGR) algorithm. CGR is an extension of the VorLag algorithm in which CGR considers the mobility of sensors of null polygon and non-null polygon. The sensors of the null polygon move towards the energy depleting sensors to repair the coverage gap before it gets energy depleted completely, thus improves coverage. In the unavailability of sensors of null polygon, CGR employs an alternate technique that exploits Alternate Repairing Sensor Selection (ARSS) process for choosing more suitable repairing sensor with low cost. The NS2-based simulation results prove that the proposed work yields extensive coverage with high coverage profit and less traverse distance.
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 Wireless and Mobile Computing (IJWMC):
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