Scalable sensor localization algorithms for wireless sensor networks.
Published: 2005
Language: eng
Number of pages: 95
Description: An adaptive rule-based algorithm, SpaseLoc, is described to solve localization problems for ad hoc wireless sensor networks. A large problem is solved as a sequence of very small subproblems, each of which is solved by semidefinite programming relaxation of geometric optimization model. The subproblems are generated according to a set of sensor/anchor selection rules and a priority list. Computational results compared with existing approaches show that the SpaseLoc algorithm scales well and provides excellent, positioning accuracy.A dynamic version of the SpaseLoc method is developed for estimating proving sensors locations in a real-time environment. The method uses dynamic distance measurement updates among sensors, and utilizes SpaseLoc for static sensor localization. Further computational results are presented, along with an application to bus transit systems.*Joint research conducted in the Dept of Management Science and Engineering, Stanford University.Ways to deploy sensor localization algorithms in clustered distributed environments are also studied, permitting application to arbitrarily large networks. In addition, we extend the algorithm to solving sensor localizations in 3D space. A preprocessor is developed to enable SpaseLoc: for localization of networks without absolute position information.*
Notes: Source: Dissertation Abstracts International, Volume: 66-10, Section: B, page: 5613.

Thesis (Ph.D.)--University of Toronto, 2005.

Electronic version licensed for access by U. of T. users.