Curvature of indoor sensor network: clustering coefficient

Authors:
F. Ariaei;M. Lou;E. Jonckheere;B. Krishnamachari;M. Zuniga
Affiliations:
Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2008

Citing 7
Cited 0

Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
Understanding packet delivery performance in dense wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Statistical model of lossy links in wireless sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Scaled Gromov hyperbolic graphs

Journal of Graph Theory
On the cover time of random geometric graphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the geometric properties of the communication graph in realistic low-power wireless networks. In particular, we explore the concept of the curvature of a wireless network via the clustering coefficient. Clustering coefficient analysis is a computationally simplified, semilocal approach, which nevertheless captures such a large-scale feature as congestion in the underlying network. The clustering coefficient concept is applied to three cases of indoor sensor networks, under varying thresholds on the link packet reception rate (PRR). A transition from positive curvature ("meshed" network) to negative curvature ("core concentric" network) is observed by increasing the threshold. Even though this paper deals with network curvature per se, we nevertheless expand on the underlying congestion motivation, propose several new concepts (network inertia and centroid), and finally we argue that greedy routing on a virtual positively curved network achieves load balancing on the physical network.