Optimal 2-Coverage of a Polygonal Region in a Sensor Network

Abstract

Wireless sensor networks are a relatively new area where technology is developing fast and are used to solve a great diversity of problems that range from museums’ security to wildlife protection. The geometric optimisation problem solved in this paper is aimed at minimising the sensors’ range so that every point on a polygonal region R is within the range of at least two sensors. Moreover, it is also shown how to minimise the sensors’ range to assure the existence of a path within R that stays as close to two sensors as possible.

Keywords

• computational geometry
• geometric optimisation
• ad-hoc sensor networks
• sensor networks
• safe routes
• minimum range
• voronoi diagrams