Open AccessThis article is
- freely available
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo, 28660 Boadilla del Monte, Madrid, Spain
Departamento de Matemática & CEOC, Universidade de Aveiro, Campus Universitário de Santiago, 3810-193 Aveiro, Portugal
* Author to whom correspondence should be addressed.
Received: 19 July 2009; Accepted: 25 August 2009 / Published: 14 September 2009
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
Citations to this Article
Cite This Article
MDPI and ACS Style
Abellanas, M.; Bajuelos, A.L.; Matos, I. Optimal 2-Coverage of a Polygonal Region in a Sensor Network. Algorithms 2009, 2, 1137-1154.
Abellanas M, Bajuelos AL, Matos I. Optimal 2-Coverage of a Polygonal Region in a Sensor Network. Algorithms. 2009; 2(3):1137-1154.
Abellanas, Manuel; Bajuelos, Antonio L.; Matos, Inês. 2009. "Optimal 2-Coverage of a Polygonal Region in a Sensor Network." Algorithms 2, no. 3: 1137-1154.