Wireless Sensor Localization With Distance Measurement Information

Aladin Research Commons

Wireless Sensor Localization With Distance Measurement Information

Show simple item record

dc.contributor.advisor Regalia, Phillip A. en_US
dc.contributor.author Wang, Jing en_US
dc.contributor.other Namazi, Nader M. en_US
dc.contributor.other Kilic, Ozlem en_US
dc.date.accessioned 2011-03-01T11:47:16Z
dc.date.available 2011-03-01T11:47:16Z
dc.date.created 2011 en_US
dc.date.issued 2011-03-01T11:47:16Z
dc.identifier.other Wang_cua_0043A_10167 en_US
dc.identifier.uri http://hdl.handle.net/1961/9320
dc.description Degree awarded: Ph.D. Electrical Engineering and Computer Science. The Catholic University of America en_US
dc.description.abstract The dissertation would focus on two problems: localization in wireless sensor network and distance reconstruction. Sensors are often randomly deployed and in such case, determining each sensor's position is critical, which explains the recent attention given to the sensor localization problem. Previous methods of projection onto convex sets (POCS) overcome the multimodality problem that plagues earlier least-squares formulations. Previous efforts in this direction require that the sensor be located in certain position in the plane. Here we propose a new algorithm which projects onto the boundary of convex sets, and features a computationally simple update procedure. The new algorithm has a unique solution no matter where the sensor is located at. Simulation results will be shown and conclusions would be given. Sensor localization typically exploits distance measurements to infer sensor positions with respect to known anchor nodes. Missing or unreliable measurements for special nodes can impede such procedures, raising the problem of distance measurement reconstruction using distance information from other nodes. The problem has traditionally been approached through multidimensional scaling, and more recently through semidenite programming and low-rank matrix completion. Here we develop new iterative reconstruction algorithms which instead exploit inertia of key matrices, thereby encompassing stronger constraints than rank alone. This serves to overcome limitations observed in earlier competitive approaches which do not exploit the problem structure as well. Simulation examples illustrate the performance of the new algorithms. en_US
dc.format.extent 120 p. en_US
dc.format.mimetype application/pdf en_US
dc.publisher The Catholic University of America en_US
dc.subject Electrical Engineering en_US
dc.subject.other Convex sets en_US
dc.subject.other Distance measurements reconstruction en_US
dc.subject.other Inertial approximation en_US
dc.subject.other Wireless sensor localization en_US
dc.title Wireless Sensor Localization With Distance Measurement Information en_US
dc.type Text en_US
dc.type Dissertation en_US


Files in this item

Files Size Format View
Wang_cua_0043A_10167display.pdf 1.412Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics