An efficient algorithm for the vertex-disjoint paths problem in random graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Radio Propagation for Modern Wireless Systems
Radio Propagation for Modern Wireless Systems
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
Transmission capacity of wireless ad hoc networks with outage constraints
IEEE Transactions on Information Theory
On the throughput scaling of wireless relay networks
IEEE Transactions on Information Theory
Communication over a wireless network with random connections
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Virtual cooperation for throughput maximization in distributed large-scale wireless networks
EURASIP Journal on Advances in Signal Processing - Special issue on cooperative MIMO multicell networks
| Hi-index | 0.00 |
We propose a new model of wireless networks which we refer to as "two-scale networks." At a local scale, characterised by nodes being within a distance r, channel strengths are drawn independently and identically from a distance-independent distribution. At a global scale, characterised by nodes being further apart from each other than a distance r, channel connections are governed by a Rayleigh distribution, with the power satisfying a distance-based decay law. Thus, at a local scale, channel strengths are determined primarily by random effects such as obstacles and scatterers whereas at the global scale channel strengths depend on distance. For such networks, we propose a hybrid communications scheme, combining elements of distance-dependent networks and random networks. For particular classes of two-scale networks with N nodes, we show that an aggregate throughput that is slightly sublinear in N, for instance, of the form N/log4 N is achievable. This offers a significant improvement over a throughput scaling behaviour of O(√N) that is obtained in other work.