- Research Article
- Open access
- Published:
Curvature of Indoor Sensor Network: Clustering Coefficient
EURASIP Journal on Wireless Communications and Networking volume 2008, Article number: 213185 (2009)
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.
Publisher note
To access the full article, please see PDF
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Ariaei, F., Lou, M., Jonckheere, E. et al. Curvature of Indoor Sensor Network: Clustering Coefficient. J Wireless Com Network 2008, 213185 (2009). https://doi.org/10.1155/2008/213185
Received:
Accepted:
Published:
DOI: https://doi.org/10.1155/2008/213185