Distributed Learning for Localization Applications in Wireless Sensor Networks

阮成專(Chuyen,Nguyen Thanh)

指導教授 ： 洪樂文

國立清華大學/電機資訊學院/通訊工程研究所/碩士(2008年)

https://doi.org/10.6843/NTHU.2008.00107

摘要

Distributed learning-based localization schemes for wireless sensor networks are studied in
this thesis. Here, we first review the theory on distributed learning with abstention and
then apply the theory to distributed localization applications that utilize only the hop-count
information between nodes to perform the localization task. Specifically, we partition the
network into a number of partitions based on the sensors' locations and determine which
class each sensor falls into. We consider a network with a number of beacon nodes that
have perfect knowledge of its own coordinates and utilize their knowledge as training data to
perform the above classification. In this work, we propose three approaches for distributed
learning based on the different features that is used to determine the class of each node,
namely, the hop-count (HC) method, the density-aware hop-count length (DHL) method,
and the distance vector (DV) method. These methods are compared under different system
parameters and also compared with the triangulation method that is often employed in the
literature. The importance of beacon placement as well as the effect of transmission errors
is also discussed.

關鍵字

分散式學習 ； 定位 ； 無線感測網路 ； 多跳躍路由

並列摘要

無資料

並列關鍵字

Distributed Learning ； Localization ； Wireless Sensor Networks ； Multi-hop Routing

參考文獻

[1] P. K. Varshney, Distributed Detection and Data Fusion", Springer-Verlag, 1997.

[2] R. Viswanathan and P. K. Varshney, Distributed detection with multiple sensor: Part

[3] A. Ribeiro and G. B. Giannakis, Bandwidth-constrained distributed estimation for wire-

[4] L. Doherty, L. E. Ghaoui, and K. S. J. Pister, Convex position estimation in wireless

[6] T. S. Han and S. Amari, Statistical inference under multiterminal data compression",