Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ICPPW.2007.51 | ICPP Workshops |
Keywords | Field | DocType |
np complete problem,sensor network,computational complexity | NP-complete,Computer science,Scheduling (computing),Real-time computing,Wireless sensor network,Distributed computing,Area coverage,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
0190-3918 | 0-7695-2934-8 | 35 |
PageRank | References | Authors |
1.23 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| weifang cheng | 1 | 141 | 5.79 |
| Shanshan Li | 2 | 295 | 53.11 |
| Xiangke Liao | 3 | 622 | 74.79 |
| Changxiang Shen | 4 | 127 | 14.57 |
| Haitao Chen | 5 | 35 | 1.23 |