Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
On the throughput scaling of wireless relay networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The capacity of wireless networks
IEEE Transactions on Information Theory
Rethinking information theory for mobile ad hoc networks
IEEE Communications Magazine
Brief announcement: an obstacle to scalability in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Network topology models for multihop wireless networks
ISRN Communications and Networking
Hi-index | 0.00 |
In many geometrically generated random network topologies it is a common phenomenon that the expected degree of an average node tends to infinity with the network size, whenever asymptotic connectivity is required. This is clearly an obstacle to scalability, as a real node cannot handle an unbounded number of links within bounded processing time. We call it the lack of degree scalability. To investigate this phenomenon, we set up a general modeling framework that contains many different random graph models as special cases. In this framework we identify two conditions and prove that whenever they are present, they make the lack of degree scalability unavoidable. As our general conditions are directly checkable in most specific cases, even in complicated ones, they can serve as powerful tools to show that a possibly complex random network topology model lacks degree scalability. Often this would otherwise be rather hard to prove via direct analysis of the stochastic geometry of the model.