Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
On the optimal placement of multiple visual sensors
Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks
Maximal Coverage Scheduling in Randomly Deployed Directional Sensor Networks
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
Approximation Algorithms for Sensor Deployment
IEEE Transactions on Computers
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning
Journal of Intelligent and Robotic Systems
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Exploiting the sensing relevancies of source nodes for optimizations in visual sensor networks
Multimedia Tools and Applications
Hi-index | 0.00 |
This paper introduces a new wireless sensor network planning problem referred to as the Optimal Sensor Configuration (OSC) problem. In this problem, the goal is to find an optimal subset of locations where directional sensors and base stations are installed in order to minimize the total network cost while satisfying the requirements of coverage and connectivity. This goal is achieved by appropriately choosing the base station type and configuring each sensor to be installed in the sensor field. The optimal configuration of each sensor is determined by three parameters which are sensing range, field of view and orientation. The paper also gives an integer linear programming formulation of the OSC problem. The viability and effectiveness of the proposed formulation are illustrated through numerical results.