By Topic

A Distributed Algorithm for Finding Maximum Barrier Coverage in Wireless Sensor Networks

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
$33 $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

2 Author(s)
Jun He ; Dept. of Comput. Sci., Texas State Univ. - San Marcos, San Marcos, TX, USA ; Hongchi Shi

Constructing sensor barriers to detect intruders crossing restricted regions, such as country borders, is one of the major application categories for wireless sensor networks. In this paper, we present a distributed algorithm to find the maximum number of disjoint sensor barriers in wireless sensor networks. Our solution works for any sensor deployment, for any size and shape of a covered region, and even for heterogeneous sensor nodes. In particular, our algorithm is distributed and works perfectly in an asynchronous communication environment. It utilizes the property of wireless channel and has lower complexity compared with other algorithms. For a deployment of n sensors, our algorithm spends O(n2) messages and O(n2) time.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010