Lower bounds for Arrangement-based Range-Free Localization in Sensor Networks
Open Access Publications from the University of California

## Lower bounds for Arrangement-based Range-Free Localization in Sensor Networks

• Author(s): Gupta, S
• Ravishankar, C
• et al.
Abstract

Colander are location aware entities that collaborate to determine approximate location of mobile or static objects when beacons from an object are received by all colanders that are within its distance $R$. This model, referred to as arrangement-based localization, does not require distance estimation between entities, which has been shown to be highly erroneous in practice. Colander are applicable in localization in sensor networks and tracking of mobile objects. A set $S \subset {\mathbb R}^2$ is an $(R,\epsilon)$-colander if by placing receivers at the points of $S$, a wireless device with transmission radius $R$ can be localized to within a circle of radius $\epsilon$. We present tight upper and lower bounds on the size of $(R,\epsilon)$-colanders. We measure the expected size of colanders that will form $(R, \epsilon)$-colanders if they distributed uniformly over the plane.

Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.