Capacity of wireless networks with heterogeneous traffic

Authors:
Mingyue Ji;Zheng Wang;Hamid R. Sadjadpour;J. J. Garcia-Luna-Aceves
Affiliations:
Department of Electrical Engineering, University of California, Santa Cruz, Santa Cruz, CA;Department of Electrical Engineering, University of California, Santa Cruz, Santa Cruz, CA;Department of Electrical Engineering, University of California, Santa Cruz, Santa Cruz, CA;Department of Computer Engineering, University of California, Santa Cruz, Santa Cruz, CA and PARC, Palo Alto, CA
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 9
Cited 2

Randomized algorithms

Randomized algorithms
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks

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
On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks

IEEE Transactions on Signal Processing
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
Capacity of ad hoc wireless networks with infrastructure support

IEEE Journal on Selected Areas in Communications

The capacity of ad hoc networks with heterogeneous traffic using cooperation

INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity of wireless networks with heterogeneous traffic under physical model

Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the scaling laws for wireless ad hoc network in which the distribution of nodes in the network is homogeneous but the traffic is heterogeneous. More specifically, we consider the case in which a node is the sink to k sources sending different information, while the rest of the nodes are part of unicast communications with a uniform assignment of source-destination pairs. We prove that the capacity of these heterogeneous networks is Θ(n/Tmax), where Tmax and n denote the maximum traffic for a cell and the number of nodes in the network, respectively. Equivalently, our derivations reveal that, when n - k ≠ constant, the network capacity is equal to Θ(√n/log n) for k = O(√n log n) and equal to Θ(n/k) for k = Ω(√n log n). Furthermore, the network capacity is Θ(1) when n - k = constant. These results demonstrate that the capacity of a heterogeneous network is dominated by the maximum congestion in any area of the network.