Paper Info
Title
Cooperative localization in wireless ad hoc and sensor networks using hybrid distance and bearing (angle of arrival) measurements.
Abstract
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.
Year
DOI
Venue
2011
10.1186/1687-1499-2011-72
EURASIP J. Wireless Comm. and Networking
Keywords
Field
DocType
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
Graph theory,Key distribution in wireless sensor networks,Topology control,Computer science,Computer network,Angle of arrival,Spanning tree,Wireless ad hoc network,Time complexity,Wireless sensor network
Journal
Volume
Issue
ISSN
2011
1
1687-1499
Citations 
PageRank 
References 
29
0.64
40
Authors
1
Name
Order
Citations
PageRank
Tolga Eren139624.12