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

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

2012-03-05

arxiv.org/abs/1203.1042v1

Computer Science

Computational Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Lower bounds for Arrangement-based Range-Free Localization in Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower bounds for Arrangement-based Range-Free Localization in Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for Arrangement-based Range-Free Localization in Sensor Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536195