Authors: Kukunuru Nikitha; Davuluri RajyaLakshmi; Avula Damodaram
Addresses: Computer Science & Engineering Department, GITAM University, Hyderabad 502329, Andhra Pradesh, India ' Computer Science & Engineering Department, Jawaharlal Nehru Technological University, Vizainagaram 535002, Andhra Pradesh, India ' Academic Audit Cell, Jawaharlal Nehru Technological University Hyderabad, Kukatpally, Hyderabad 500085, Andhra Pradesh, India
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.
Keywords: heterogeneous sensor networks; wireless sensor networks; WSNs; coverage gap repair; VorLag algorithm; sensor repair; energy depletion; simulation.
International Journal of Wireless and Mobile Computing, 2014 Vol.7 No.5, pp.475 - 484
Received: 20 Jun 2013
Accepted: 25 Jan 2014
Published online: 15 Sep 2014 *