loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
Localized Algorithm for Coverage in Wireless Sensor Networks
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
ASCII Text
x 
 
Hongli Xu, Liusheng Huang, Yingyu Wan, Kezhong Lu, "Localized Algorithm for Coverage in Wireless Sensor Networks," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 750-754, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.163,
author = {Hongli Xu and Liusheng Huang and Yingyu Wan and Kezhong Lu},
title = {Localized Algorithm for Coverage in Wireless Sensor Networks},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {750-754},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.163},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - Localized Algorithm for Coverage in Wireless Sensor Networks
SN - 0-7695-2405-2
SP750
EP754
A1 - Hongli Xu,
A1 - Liusheng Huang,
A1 - Yingyu Wan,
A1 - Kezhong Lu,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Hongli Xu, University of Science and Technology of China
Liusheng Huang, University of Science and Technology of China
Yingyu Wan, University of Science and Technology of China
Kezhong Lu, University of Science and Technology of China
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.
Citation:
Hongli Xu, Liusheng Huang, Yingyu Wan, Kezhong Lu, "Localized Algorithm for Coverage in Wireless Sensor Networks," pdcat, pp.750-754, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.