• Abstract
• Full-Text PDF [1896 KB]

• Article Statistics
• Google Scholar
• Order Reprints

• Cite this article
• Export to BibTeX
• Export to EndNote

• [+] on DOAJ
• Abellanas, M
• Bajuelos, AL.
• Matos, I
• [+] on Google Scholar
• Abellanas, M
• Bajuelos, AL.
• Matos, I
• [+] on PubMed
• Abellanas, M
• Bajuelos, AL.
• Matos, I

•  CiteULike
•  Facebook
•  Mendeley
•  Twitter

This article is

• freely available
• re-usable

Algorithms 2009, 2(3), 1137-1154; doi:10.3390/a2031137

Article

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

Manuel Abellanas ^1,* , Antonio L. Bajuelos ²  and Inês Matos ²

¹ 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

(This article belongs to the Special Issue Computational Geometry)

Download PDF Full-Text [1896 KB, uploaded 14 September 2009 08:05 CEST]

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

Article Statistics

Cite This Article