Guard Placement For Wireless Localization

Simple item page
dc.creatorEppstein, David
dc.creatorGoodrich, Michael T.
dc.creatorSitchinava, Nodari
dc.date2006-03-14
dc.date.accessioned2026-07-07T07:05:51Z
dc.date.available2026-07-07T07:05:51Z
dc.descriptionMotivated by secure wireless networking, we consider the problem of placing fixed localizers that enable mobile communication devices to prove they belong to a secure region that is defined by the interior of a polygon. Each localizer views an infinite wedge of the plane, and a device can prove membership in the secure region if it is inside the wedges for a set of localizers whose common intersection contains no points outside the polygon. This model leads to a broad class of new art gallery type problems, for which we provide upper and lower bounds.
dc.identifierhttps://arxiv.org/abs/cs/0603057
dc.identifierhttp://arxiv.org/abs/cs/0603057
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109811
dc.subjectComputational Geometry
dc.subjectI.3.5
dc.titleGuard Placement For Wireless Localization
dc.typetext

Files

Collections

arXiv