Capacity of wireless networks with heterogeneous traffic under physical model

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;Computer Engineering, Palo Alto Research Center, Palo Alto, CA
Venue:
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Year:
2010

Citing 9
Cited 0

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
Capacity of wireless networks with heterogeneous traffic

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The throughput capacity of wireless ad hoc networks is derived when the traffic is heterogeneous but the node distribution is homogeneous. For the heterogeneous traffic we consider two types of traffic in the network, namely, unicast and data gathering communications. There are k sources that send different data to a single node and the rest of n - k nodes in the network participate in unicast communications with a uniform assignment of source-destination pairs. Under the physical model, it is proved 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. The result demonstrates that the capacity is dominated by the maximum congestion in any area of the network. More specifically, 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).