Brief announcement: an obstacle to scalability in wireless networks

Authors:
András Faragó
Affiliations:
University of Texas at Dallas, Richardson, TX, USA
Venue:
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Year:
2012

Citing 3
Cited 0

Scalability of node degrees in random wireless network topologies

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Asymptotically optimal trade-off between local and global connectivity in wireless networks

Performance Evaluation
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize the well known random geometric graph based network topology model to a higher level of abstraction, to allow the inclusion of many different models. We explore the asymptotic relationship between node degrees and connectivity in this general model.