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
The capacity of wireless networks: information-theoretic and physical limits
IEEE Transactions on Information Theory
Hierarchical cooperation in ad hoc networks: optimal clustering and achievable throughput
IEEE Transactions on Information Theory
On capacity scaling in arbitrary wireless networks
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Information-theoretic operating regimes of large wireless networks
IEEE Transactions on Information Theory
The balanced unicast and multicast capacity regions of large wireless networks
IEEE Transactions on Information Theory
On the impact of mobility on multicast capacity of wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput, delay, and mobility in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multicast scaling laws with hierarchical cooperation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Throughput scaling of wireless networks with random connections
IEEE Transactions on Information Theory
On the broadcast capacity of wireless networks with cooperative relays
IEEE Transactions on Information Theory
JMB: scaling wireless capacity with user demands
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Multicast performance with hierarchical cooperation
IEEE/ACM Transactions on Networking (TON)
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
JMB: scaling wireless capacity with user demands
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
A new distributed cooperative MIMO scheme for mobile ad hoc networks
Information Sciences: an International Journal
| Hi-index | 755.26 |
This paper deals with throughput scaling laws for random ad hoc wireless networks in a rich scattering environment. We develop schemes to optimize the ratio lambda(n) of achievable network sum capacity to the sum of the point-to-point capacities of source-destinations (S-D) pairs operating in isolation. Our focus in this paper is on fixed signal-to-noise ratio (SNR) networks, i.e., networks where the worst case SNR over the S-D pairs is fixed independent of n. For such fixed SNR networks, which include fixed area networks as a special case, we show that collaborative strategies yield a scaling law of lambda(n)=Omega(1/n1/3) in contrast to multihop strategies which yield a scaling law of lambda(n)=Theta(1/radicn). While networks where worst case SNR goes to zero do not preclude the possibility of collaboration, multihop strategies achieve optimal throughput. The plausible reason is that the gains due to collaboration cannot offset the effect of vanishing receive SNR. This suggests that for fixed SNR networks, a network designer should look for network protocols that exploit collaboration