The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Efficient Deployment Algorithms for Ensuring Coverage and Connectivity ofWireless Sensor Networks
WICON '05 Proceedings of the First International Conference on Wireless Internet
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
UbiREAL: realistic smartspace simulator for systematic testing
UbiComp'06 Proceedings of the 8th international conference on Ubiquitous Computing
| Hi-index | 0.00 |
When deploying an indoor 3D WSN, it is important to be able to determine positions of the sensor nodes that achieve the full-coverage of the target space and the connectivity between the sensor nodes with the minimum deployment cost. The sensor node deployment problem for 3D coverage and connectivity is NP-hard even without obstacles in the target field. Furthermore, no study has systematically examined the optimal 3D WSN deployment considering both obstacles and deployment cost. We have developed a heuristic algorithm for computing a near optimal solution that minimizes the cost for achieving the full coverage and node connectivity in a 3D target space with obstacles. We have implemented the algorithm in the smartspace simulator UbiREAL so that the designers can interactively determine the near-optimal sensor node positions thorough visualization of the achievable coverage and the sensor positions on a 3D virtual space. In this demonstration, we show, for different configurations of the target space and WSN parameters, how the tool computes the sensor positions and visualizes the results such as achievable covered area, sensor positions, and the total cost.