Elements of information theory
Elements of information theory
Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Coordinated Multiuser Communications
Coordinated Multiuser Communications
Introduction to Space-Time Wireless Communications
Introduction to Space-Time Wireless Communications
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
A novel random wireless packet multiple access method using CDMA
IEEE Transactions on Wireless Communications
Capacity scaling laws in MIMO relay networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks
IEEE Transactions on Information Theory
On the capacity of large Gaussian relay networks
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
Routing in ad hoc networks: a case for long hops
IEEE Communications Magazine
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.00 |
The effect of traffic distribution on communication rates and receiver complexity in ad-hoc networks is addressed, considering a network with constant density of users and a certain traffic model. Information theoretic upper bounds on communication rates are derived under an assumption that transmitting nodes as well as receiving nodes cooperate. It is shown that for the case of large signal attenuation the bounds hold even when the cooperation among users is limited to a certain region of the network domain. Furthermore, achievability bounds on communication rates are derived. The bounds rely on two proposed local cooperation strategies. A comparison shows that the upper bounds are tight and closely follow the achievability results. Finally, the impact of traffic localization on the receiver complexity is addressed.