A New Lower Bound on Guard Placement for Wireless Localization

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
4 pages, 3 figures

Keywords

Computational Geometry, Computational Complexity, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/138566

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0709.3554
 http://arxiv.org/abs/0709.3554

Collections

arXiv