• DocumentCode
    1203633
  • Title

    Even One-Dimensional Mobility Increases the Capacity of Wireless Networks

  • Author

    Diggavi, Suhas N. ; Grossglauser, Matthias ; Tse, David N. C.

  • Author_Institution
    Sch. of Comput. & Commun. Sci. (I&C), EPFL, Lausanne, Switzerland
  • Volume
    51
  • Issue
    11
  • fYear
    2005
  • Firstpage
    3947
  • Lastpage
    3954
  • Abstract
    We study the capacity of ad hoc wireless networks with mobile nodes. The mobility model examined is one where the nodes are restricted to move along one-dimensional paths. We examine the scaling laws for the per user throughput achievable over long time-scales, making this suitable for applications with loose delay constraints. We show that under this regime of restricted mobility, we attain a constant throughput (i.e., Θ (1)) per user, which is significantly higher than the throughput of fixed networks, which decays as O(1/√n) with the number of nodes n, as shown by Gupta and Kumar.
  • Keywords
    diversity reception; mobile ad hoc networks; multi-access systems; ad hoc wireless network; constant throughput; delay constraint; mobile node; mobility model; multiuser diversity; network capacity; network throughput; one-dimensional mobility; scaling law; Communication networks; Delay; Information theory; Mobile ad hoc networks; Mobile communication; Optimal scheduling; Random processes; Relays; Throughput; Wireless networks; Ad hoc wireless networks; capacity scaling laws; mobility; multiuser diversity;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2005.856966
  • Filename
    1522652