The effects of random geometric graph structure and clustering on localizability of sensor networks
Graph rigidity provides the conditions of unique localizability for cooperative localization of wireless ad hoc and sensor networks. Specifically, redundant rigidity and 3-connectivity are necessary and sufficient conditions for unique localizability of generic configurations. In this article, we in...
Saved in:
| Main Author: | Tolga Eren |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-12-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717748898 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Avoidance of non-localizable obstacles in echolocating bats: A robotic model.
by: Carl Bou Mansour, et al.
Published: (2019-12-01) -
Sensor Network Self-Organization Using Random Graphs
by: Richard R. Brooks
Published: (2009-01-01) -
The Performance of Multimessage Algebraic Gossip in a Random Geometric Graph
by: Gang Wang, et al.
Published: (2013-12-01) -
Two-Level Clustering Algorithm for Cluster Head Selection in Randomly Deployed Wireless Sensor Networks
by: Sagun Subedi, et al.
Published: (2024-06-01) -
Roof Geometrical Component Extraction Using Bimodal Data and Graph Neural Network
by: F. Soleimani Vostikolaei, et al.
Published: (2025-07-01)