Cart (Loading....) | Create Account
Close category search window
 

Localized Algorithm for 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
$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)
Hongli Xu ; University of Science and Technology of China ; Liusheng Huang ; YingYu Wan ; KeZhong Lu

Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage path for sensor networks. In this paper, we design a localized algorithm to solve the worst coverage problem first introduced by Meguerdichian et al. All nodes cooperate to construct the worst coverage path with their one-hop neighbors’ information. Also, the correctness of the algorithm is proved under the diminishing model formally.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on

Date of Conference:

05-08 Dec. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.