Randomized algorithms
Fundamentals of wireless communication
Fundamentals of wireless communication
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Capacity of wireless networks with heterogeneous traffic
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic Patterns
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
On the scaling laws of dense wireless sensor networks: the data gathering channel
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Efficient link-heterogeneous multicast for wireless mesh networks
Wireless Networks
Hi-index | 0.00 |
We study the scaling laws for wireless ad hoc networks in which the distribution of n nodes in the network is homogeneous but the traffic they carry is heterogeneous. More specifically, we consider the case in which a given node is the data-gathering sink for k sources sending different information to it, while the rest of the s = n-k nodes participate in unicast sessions with random destinations chosen uniformly. We present a separation theorem for heterogeneous traffic showing that the optimum order throughput capacity can be attained in a wireless network in which traffic classes are distributed uniformly by endowing each node with multiple radios, each operating in a separate orthogonal channel, and by allocating a radio per node to each traffic class. Based on this theorem, we show how this order capacity can be attained for the unicast and data-gathering traffic classes by extending cooperative communication schemes that have been proposed previously.