Directional sensor network is composed of many directional sensor nodes. Unlike conventional sensors that always have an omni-angle 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 a directional sensor node is randomly deployed and scattered in the environment, some interested targets cannot be covered even if these targets are located in the sensing range of the sensor. 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 rotated angles of sensors are minimized. We present two distributed greedy algorithm solutions for the MCRS problem. Simulation results shows that to apply angle adjustment algorithm can enhance the coverage rate of the directional sensor network. © 2012 Springer-Verlag.
CITATION STYLE
Hsu, Y. C., Chen, Y. T., & Liang, C. K. (2012). Distributed coverage-enhancing algorithms in directional sensor networks with rotatable sensors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7129 LNCS, pp. 201–213). https://doi.org/10.1007/978-3-642-25959-3_15
Mendeley helps you to discover research relevant for your work.