Name
Abstract | ||
|---|---|---|
Directional sensor network is composed of many directional sensor nodes. Unlike conventional omni-directional sensors that always have an omniangle of sensing range, directional sensors may have a limited angle of sensing range due to technical constraints or cost considerations. Therefore, it is possible that when directional sensor nodes are randomly scattered in the environment, some interested targets cannot be covered due to the limited angle of sensing direction even if the targets are located in the sensing range of sensors. We propose a Maximum Coverage with Rotatable Angles (MCRA) problem in which coverage in terms of the number of targets to be covered is maximized whereas the degree of angles to be rotated is minimized. We present two centralized greedy algorithm solutions for the MCRA problem. Simulation results are presented to apply angle adjustment algorithm to enhance the coverage of the directional sensor network. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20754-9_27 | GPC |
Keywords | Field | DocType |
rotatable angles,target coverage problem,rotatable angle,directional sensor network,maximum coverage,mcra problem,directional sensor node,limited angle,angle adjustment algorithm,conventional omni-directional sensor,centralized greedy algorithm solution,directional sensor,greedy algorithm,sensor network | Telecommunications,Computer science,Real-time computing,Greedy algorithm,Wireless sensor network,Distributed computing | Conference |
Volume | ISSN | Citations |
6646 | 0302-9743 | 2 |
PageRank | References | Authors |
0.38 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chiu-Kuo Liang | 1 | 55 | 9.61 |
| Yen-ting Chen | 2 | 162 | 18.83 |