A New Lower Bound on Guard Placement for Wireless Localization
| dc.creator | Damian, Mirela | |
| dc.creator | Flatland, Robin | |
| dc.creator | O'Rourke, Joseph | |
| dc.creator | Ramaswami, Suneeta | |
| dc.date | 2007-09-22 | |
| dc.date.accessioned | 2026-07-07T08:31:40Z | |
| dc.date.available | 2026-07-07T08:31:40Z | |
| dc.description | The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the plane can determine whether it is inside or outside a given polygonal region. The primary goal is to minimize the number of stations. In this paper we establish a lower bound of 2n/3 - 1 stations for polygons in general position, for the case in which the placement of stations is restricted to polygon vertices, improving upon the existing n/2 lower bound. | |
| dc.description | 4 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/0709.3554 | |
| dc.identifier | http://arxiv.org/abs/0709.3554 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138566 | |
| dc.subject | Computational Geometry | |
| dc.subject | Computational Complexity | |
| dc.subject | F.2.2 | |
| dc.title | A New Lower Bound on Guard Placement for Wireless Localization | |
| dc.type | text |