Recently, the concept of barrier-coverage of wireless sensor network has been introduced for various civilian and military defense applications. This paper studies the problem of how to organize hybrid sensor network, which consists of a number of energy-scarce ground sensors with homogenous initial battery level and energy-plentiful mobile sensors, to maximum the lifetime of barrier-coverage. Two key observations are (a) as the lifetime of each mobile sensor is much longer than that of the static ground sensors, each mobile sensor is capable of contributing multiple sensor barrier formations, and (b) no mobile sensor node can join two hybrid barriers which will be successively used to continuously protect the area of interest due to the moving delay. Based on these, we introduce a new maximum lifetime barrier-coverage problem in hybrid sensor network. We first propose a simple heuristic algorithm by combining existing ideas along with our own. Then, we design another efficient algorithm for the problem and prove that the lifetime of hybrid barrier constructed by this algorithm is at least three times greater than the existing one on average. Our simulation result shows that the second algorithm outperforms the first algorithm at least 33 percent and up to 100 percent.
Bibliographical noteFunding Information:
This work was supported in part by US National Science Foundation CREST No. HRD-1345219. This research was jointly supported by the National Natural Science Foundation of China under grants 11471005. This work was also supported by National Research Foundation grant (MSIP No. 2013R1A2A2A01014000) and Basic Science Research Program (MEST 2011-0012216) funded by the Korea government. Wei Wang is the corresponding author.
© 2002-2012 IEEE.
- Sensor networks
- graph theory
- hybrid sensor networks
- maximum lifetime
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering