Cooperative localization in wireless ad hoc and sensor networks using hybrid distance and bearing (angle of arrival) measurements
Yükleniyor...
Tarih
2011
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
This article provides the graphical properties which can ensure unique localizability in cooperative networks with hybrid distance and bearing (angle of arrival) measurements. Furthermore, within the networks satisfying these graphical properties, this article identifies further sets of conditions so that the associated computational complexity becomes linear in the number of sensor nodes. We show how, by forming a spanning tree used once for distances and a second time for bearings where the underlying graph is connected, the localization problem can be made solvable in linear time with significantly less number of sensing links and smaller sensing radii of nodes compared with the cooperative networks with distance-only or bearing-only measurements. These easily localizable networks can be localized in polynomial time when measurements are noisy.
Açıklama
Anahtar Kelimeler
localization, cooperative localization, wireless sensor networks, wireless ad hoc networks, distributed systems, angle of arrival, bearing, graph theory, topology control, topology reconstruction, rigidity, global rigidity
Kaynak
Eurasip Journal On Wireless Communications And Networking
WoS Q Değeri
Q3
Scopus Q Değeri
Q2
Cilt
Sayı
Künye
Eren, T. (2011).Cooperative localization in wireless ad hoc and sensor networks using hybrid distance and bearing (angle of arrival) measurements. J Wireless Com Network 72,1-18.
