Next Article in Journal
Algorithm for the Analysis of Tryptophan Fluorescence Spectra and Their Correlation with Protein Structural Parameters
Next Article in Special Issue
Delaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates
Previous Article in Journal
Approximate String Matching with Compressed Indexes
Previous Article in Special Issue
How Many Lions Are Needed to Clear a Grid?
Article Menu

Article Versions

Export Article

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

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

1
Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo, 28660 Boadilla del Monte, Madrid, Spain
2
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 [1896 KB, uploaded 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 computational geometry; geometric optimisation; ad-hoc sensor networks; sensor networks; safe routes; minimum range; voronoi diagrams
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & 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.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top