Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Cyclops: in situ image sensing and interpretation in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Cover Set Problem in Directional Sensor Networks
FGCN '07 Proceedings of the Future Generation Communication and Networking - Volume 01
An Adjustable Target Coverage Method in Directional Sensor Networks
APSCC '08 Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference
Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks
IEEE Transactions on Computers
On coverage problems of directional sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
IEEE Communications Magazine
| Hi-index | 0.00 |
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.