Art gallery theorems and algorithms
Art gallery theorems and algorithms
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to Algorithms
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
On the optimal placement of multiple visual sensors
Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks
Finding a Guard that Sees Most and a Shop that Sells Most
Discrete & Computational Geometry
On coverage problems of directional sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
ε-Net Approach to Sensor k-Coverage
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Ɛ-net approach to sensor k-coverage
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Brief announcement: pan and scan
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: configuration of actuated camera networks for multi-target coverage
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
Coverage estimation for crowded targets in visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Coverage management for mobile targets in visual sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Visual sensor network lifetime maximization by prioritized scheduling of nodes
Journal of Network and Computer Applications
Coverage algorithms for visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
A hybrid optimisation algorithm for coverage enhancement in 3D directional sensor networks
International Journal of Sensor Networks
simDSN: A Simulation Platform for the Sensing Coverage Problem in Directional Sensor Networks
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
Hi-index | 0.00 |
Sensor nodes may be equipped with a "directional" sensing device (such as a camera) which senses a physical phenomenon in a certain direction depending on the chosen orientation. In this article, we address the problem of selection and orientation of such directional sensors with the objective of maximizing coverage area. Prior works on sensor coverage have largely focused on coverage with sensors that are associated with a unique sensing region. In contrast, directional sensors have multiple sensing regions associated with them, and the orientation of the sensor determines the actual sensing region. Thus, the coverage problems in the context of directional sensors entails selection as well as orientation of sensors needed to activate in order to maximize/ensure coverage. In this article, we address the problem of selecting a minimum number of sensors and assigning orientations such that the given area (or set of target points) is k-covered (i.e., each point is covered k times). The above problem is NP-complete, and even NP-hard to approximate. Thus, we design a simple greedy algorithm that delivers a solution that k-covers at least half of the target points using at most M log(k|C|) sensors, where |C| is the maximum number of target points covered by a sensor and M is the minimum number of sensor required to k-cover all the given points. The above result holds for almost arbitrary sensing regions. We design a distributed implementation of the above algorithm, and study its performance through simulations. In addition to the above problem, we also look at other related coverage problems in the context of directional sensors, and design similar approximation algorithms for them.