Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Open Access
- 14 September 2009
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 2 (3) , 1137-1154
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
This publication has 13 references indexed in Scilit:
- 2-Covered paths by a set of antennas with minimum power transmission rangeInformation Processing Letters, 2009
- Covering a line segment with variable radius discsComputers & Operations Research, 2009
- Variable radii connected sensor cover in sensor networksACM Transactions on Sensor Networks, 2009
- Covering a compact polygonal set by identical circlesComputational Optimization and Applications, 2008
- Localized algorithms for coverage boundary detection in wireless sensor networksWireless Networks, 2007
- Sensor coverage in wireless ad hoc sensor networksInternational Journal of Sensor Networks, 2007
- Efficient algorithm for placing a given number of base stations to cover a convex regionJournal of Parallel and Distributed Computing, 2006
- Circle Covering With a MarginPeriodica Mathematica Hungarica, 1997
- Decomposing a Polygon into Simpler ComponentsSIAM Journal on Computing, 1985
- Backtrack ProgrammingJournal of the ACM, 1965