• DocumentCode
    2960053
  • Title

    Ad hoc network capacity

  • Author

    Toumpis, S. ; Goldsmith, A.

  • Author_Institution
    Wireless Syst. Lab., Stanford Univ., CA, USA
  • Volume
    2
  • fYear
    2000
  • fDate
    Oct. 29 2000-Nov. 1 2000
  • Firstpage
    1265
  • Abstract
    We study the performance of wireless ad hoc networks in the limit of a large number of nodes. We first define ad hoc networks and their capacity. We then calculate a lower bound on the capacity by constructing a communications scheme that achieves it. We also determine an upper bound on the capacity by investigating the properties of any transmission schedule. Bounds indicate that for a large number of nodes n, the total network capacity increases with a rate between k/sub 1/n/sup 1/3/ and k/sub 2/n/sup 1/2/, while the per-node rate goes to zero.
  • Keywords
    cellular radio; scheduling; ad hoc network capacity; communications scheme; lower bound; per-node rate; performance; transmission schedule; upper bound; wireless ad hoc networks; Ad hoc networks; Base stations; Interference; Media Access Protocol; Mobile ad hoc networks; Routing; Scheduling; Signal to noise ratio; Upper bound; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2000. Conference Record of the Thirty-Fourth Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA, USA
  • ISSN
    1058-6393
  • Print_ISBN
    0-7803-6514-3
  • Type

    conf

  • DOI
    10.1109/ACSSC.2000.910766
  • Filename
    910766