Localization in ad hoc and sensor wireless networks with bounded errors

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.