The capacity of ad hoc networks with heterogeneous traffic using cooperation

  • 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 Palo Alto Research Center, Palo Alto, CA

  • Venue:
  • INFOCOM'10 Proceedings of the 29th conference on Information communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.