Localization in ad hoc and sensor wireless networks with bounded errors

Authors:
Mark Terwilliger;Collette Coullard;Ajay Gupta
Affiliations:
Computer Science Department, Western Michigan University, Kalamazoo, MI and Computer Science Department, Lake Superior State University, Sault Ste. Marie, MI;Computer Science Department, Lake Superior State University, Sault Ste. Marie, MI;Computer Science Department, Western Michigan University, Kalamazoo, MI
Venue:
HiPC'08 Proceedings of the 15th international conference on High performance computing
Year:
2008

Citing 5
Cited 0

Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Location Systems for Ubiquitous Computing

Computer
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Habitat monitoring with sensor networks

Communications of the ACM - Wireless sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the proliferation of wireless networks and mobile computingdevices, providing location-aware technology and services to new applicationshas become important for developers. Our main contribution is an efficientlocation discovery algorithm that bounds the localization error. Providing anefficient localization technique is critical in resource-constrained environmentsthat include mobile devices and wireless networked sensors. Applicable incentralized and distributed environments, our algorithm, based on finding thesmallest circle enclosing the intersection of n disks, runs in O(n2) time. Wethen extend our work to the problem of finding the smallest disk that includesthe set of points common to n disks and excluded from the interiors of mother disks. Finally, we show performance results from the implementation ofour algorithms in which, under some conditions, localization estimates for 500nodes in a 500×500 ft region can be found with a mean error of one foot and atwo-foot error bound.