Optimal 2-coverage of a polygonal region in a sensor network (Q1662495): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3390/a2031137 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033507316 / rank | |||
Normal rank | |||
Revision as of 21:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal 2-coverage of a polygonal region in a sensor network |
scientific article |
Statements
Optimal 2-coverage of a polygonal region in a sensor network (English)
0 references
20 August 2018
0 references
Summary: 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.
0 references
computational geometry
0 references
geometric optimisation
0 references
ad-hoc sensor networks
0 references
wireless sensor networks
0 references
safe routes
0 references
minimum range
0 references
Voronoi diagrams
0 references
