A New Lower Bound on Guard Placement for Wireless Localization
Computational Geometry
2007-09-25 v1 Computational Complexity
Abstract
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.
Keywords
Cite
@article{arxiv.0709.3554,
title = {A New Lower Bound on Guard Placement for Wireless Localization},
author = {Mirela Damian and Robin Flatland and Joseph O'Rourke and Suneeta Ramaswami},
journal= {arXiv preprint arXiv:0709.3554},
year = {2007}
}
Comments
4 pages, 3 figures