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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Wireless and Mobile Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
