Abstract-In this paper, we consider using angle of arrival information (bearing) for sensor network localization. The essential property we require in this paper is that a node can infer heading information from its neighbors. We address the uniqueness of network localization solutions by the theory of globally rigid graphs. We show that while the parallel rigidity problem for formations with bearings is isomorphic to the distance case, the global rigidity of the formation is simpler (in fact identical to the simpler rigidity case) for a network with bearings, compared to formations with distances.
Parallel rigidity was used in localization in sensor networks with bidirectional links in REF .
Using Angle of Arrival (Bearing) Information in Network Localization
Proceedings of the 45th IEEE Conference on Decision and Control
Proceedings of the 45th IEEE Conference on Decision and Control
Computer Science