• DocumentCode
    2429820
  • Title

    Capacity of wireless networks with heterogeneous traffic under physical model

  • Author

    Ji, Mingyue ; Wang, Zheng ; Sadjadpour, Hamid R. ; Garcia-Luna-Aceves, J.J.

  • Author_Institution
    Dept. of Electr. Eng., Univ. of California, Santa Cruz, CA, USA
  • fYear
    2010
  • fDate
    12-14 April 2010
  • Firstpage
    1
  • Lastpage
    5
  • 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/logn)) for k = O (¿(n log n)) and equal to ¿ (n/k) for k = ¿ (¿(n log n)).
  • Keywords
    ad hoc networks; computational complexity; radio networks; telecommunication traffic; data gathering communications; heterogeneous traffic; physical model; unicast communications; wireless ad hoc networks; Computational modeling; Computer networks; Computer simulation; Mobile ad hoc networks; Telecommunication traffic; Throughput; Traffic control; Unicast; Upper bound; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sarnoff Symposium, 2010 IEEE
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4244-5592-8
  • Type

    conf

  • DOI
    10.1109/SARNOF.2010.5469786
  • Filename
    5469786