A New Lower Bound on Guard Placement for Wireless Localization

Details A New Lower Bound on Guard Placement for Wireless Localization A New Lower Bound on Guard Placement for Wireless Localization

2007-09-22

arxiv.org/abs/0709.3554v1

Computer Science

Computational Geometry

4 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A New Lower Bound on Guard Placement for Wireless Localization 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 A New Lower Bound on Guard Placement for Wireless Localization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Lower Bound on Guard Placement for Wireless Localization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-543930