A simple algorithm for computing the smallest enclosing circle
Information Processing Letters
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
A Bidding Protocol for Deploying Mobile Sensors
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Supporting spatial aggregation in sensor network databases
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Estimating Coverage Holes and Enhancing Coverage in Mixed Sensor Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
A Delaunay Triangulation based method for wireless sensor network deployment
Computer Communications
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
MANNA: a management architecture for wireless sensor networks
IEEE Communications Magazine
| Hi-index | 0.00 |
Recent advances in sensor technology have resulted in the design and development of more efficient and low cast sensor networks for environmental monitoring, object surveillance, tracking and controlling of moving objects, etc. The deployment of a sensor network in a real environment presents several challenging issues that are often oversimplified in the existing solutions. Different approaches have been proposed in the literatures to solve this problem. Many of these approaches use Voronoi diagram and Delaunay triangulation to identify sensing holes in the network and create an optimal arrangement of the sensors to eliminate the holes. However, most of these methods do not consider the reality of the environment in which the sensor network is deployed. This paper presents a survey of the existing solutions for geosensor network optimization that use Voronoi diagram and Delaunay triangulation and identifies their limitations in a real world application. Next, it proposes a more realistic approach by integrating spatial information in the optimization process based on Voronoi diagram. Finally the results of two cases studies based on the proposed approach in natural area and urban environment are presented and discussed.