loading...
Maximal Coverage Scheduling in Randomly Deployed Directional Sensor Networks
2007 International Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Weifang Cheng, National University of Defense Technology, China
Shanshan Li, National University of Defense Technology, China
Xiangke Liao, National University of Defense Technology, China
Shen Changxiang, National University of Defense Technology, China
Haitao Chen, National University of Defense Technology, China
Unlike traditional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may be able to switch to several directions and each direction has a limited angle of sensing range. Area coverage is still an essential issue in a directional sensor network which consists of a number of directional sensors. In this paper, we study a novel "area coverage by directional sensors" problem. We propose the Maximum Directional Area Coverage (MDAC) problem to maximize covered area by scheduling the working directions of the sensors in the network. We prove the MDAC to be NP-complete and propose one distributed scheduling algorithm for the MDAC. Simulation results are also presented to demonstrate the performance of the proposed algorithm.
Citation:
Weifang Cheng, Shanshan Li, Xiangke Liao, Shen Changxiang, Haitao Chen, "Maximal Coverage Scheduling in Randomly Deployed Directional Sensor Networks," icppw,pp.68, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Click here to go to beta feedback form