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 Sensors (MCRS) problem in which coverage in terms of the number of targets to be covered is maximized whereas the angle's degrees to be rotated are minimized. We present two centralized greedy algorithm solutions for the MCRS 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-23641-9_36 | UIC |
Keywords | Field | DocType |
coverage problem,directional sensor network,rotatable sensor,maximum coverage,directional sensor node,rotatable sensors,limited angle,conventional omni-directional sensor,angle adjustment algorithm,centralized greedy algorithm solution,mcrs problem,directional sensor,coverage | Mathematical optimization,Computer science,Greedy algorithm,Real-time computing,Wireless sensor network,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yin-Chung Hsu | 1 | 2 | 0.72 |
| Yen-ting Chen | 2 | 162 | 18.83 |
| Chiu-Kuo Liang | 3 | 55 | 9.61 |