Computer Science – Computational Geometry
Scientific paper
2006-03-14
Computer Science
Computational Geometry
Scientific paper
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.
Eppstein David
Goodrich Michael T.
Sitchinava Nodari
No associations
LandOfFree
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 Guard Placement For Wireless Localization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guard Placement For Wireless Localization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-728859