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...
Main Author: | Tolga Eren |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2017-12-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1177/1550147717748898 |
Similar Items
-
Sequentially localizable functionals.
by: Booth, Raymond Sydney
Published: (2011) -
Consistency of Higgsplosion in localizable QFT
by: Valentin V. Khoze, et al.
Published: (2019-03-01) -
Comprehensive Performance Analysis of Localizability in Heterogeneous Cellular Networks
by: Bhandari, Tapan
Published: (2017) -
Achieving Network Localizability in Nonlocalizable WSN with Moving Passive Event
by: Xiaolei Zhou, et al.
Published: (2013-10-01) -
SECRECY TRANSFER FOR SENSOR NETWORKS:FROM RANDOM GRAPHS TO SECURE RANDOM GEOMETRIC GRAPHS
by: Zhihong Liu, et al.
Published: (2013-02-01)