Home > Research > Publications & Outputs > An optimal algorithm for coverage hole healing ...

Links

Text available via DOI:

View graph of relations

An optimal algorithm for coverage hole healing in hybrid sensor networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date2011
Host publication7th International Wireless Communications and Mobile Computing Conference, IWCMC 2011
PublisherIEEE
Pages494-499
Number of pages6
ISBN (electronic)9781424495382
ISBN (print)9781424495399
<mark>Original language</mark>English

Abstract

Network coverage is one of the most decisive factors for determining the efficiency of a wireless sensor network. However, in dangerous or hostile environments such as battle fields or active volcano areas, we can neither deterministically or purposely deploy sensors as desired, thus the emergence of coverage holes (the unmonitored areas) is unavoidable. In addition, the introduction of new coverage holes during network operation due to sensor failures due to energy depletion shall significantly reduce coverage efficacy. Therefore, we need to either remotely control or set up a protocol to heal them as soon as possible in an automated fashion. In this paper, we focus on how to schedule mobile sensors in order to cope with coverage hole issues in a hybrid sensor network containing both static and mobile sensors. To this end, we introduce a new metric, namely to maximize the minimum remaining energy of all moved sensor 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. Simulation results confirm the efficiency and utilization of our proposed method. © 2011 IEEE.