By Topic

Local maximum lifetime algorithms for strong k-barrier coverage with cooridnated sensors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yingying Cao ; Sch. of Inf. Sci. & Technol., Yancheng Teachers Univ., Yancheng, China ; Liusheng Huang ; Kai Xing ; Hao Yang

Barrier coverage is known to be an appropriate model of coverage for movement detection and boundary guard, which is achieved by barriers of sensors. This paper focuses on local algorithms for strong k-barrier coverage based on detection coverage model. We first formalize a coordinated detection coverage model, where the data fusion rule is described by a general function. Then, we analyze the influencing factors of barrier coverage lifetime, and transfer it to a multiobjective optimization problem. Moreover, we propose a new Divide-and-Conquer scheme. Based on it, we design a new local maximal lifetime algorithm and following protocol for strong k-barrier with coordinated sensors. Simulations that the new algorithm provides effective enhancement in network lifetime, it outperforms RIS by up to 4.34 times and surpasses LBCP by 5 time units.

Published in:

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Date of Conference:

27-29 May 2011