Guard Placement For Wireless Localization

TL;DR

This paper addresses the problem of optimally placing fixed localizers in wireless networks to ensure secure localization within polygonal regions, introducing new art gallery type problems and bounds.

Contribution

It formulates a novel art gallery inspired problem for secure wireless localization and provides theoretical bounds for localizer placement.

Findings

Established upper and lower bounds for localizer placement

Connected the problem to art gallery type problems

Proposed a new model for secure wireless localization

Abstract

Motivated 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.