Throughput scaling in wireless networks with restricted mobility

Aurélie C. Lozano, Sanjeev R. Kulkarni, Pramod Viswanath

Research output: Contribution to journalConference articlepeer-review

Abstract

An alternative model of restricted mobility was proposed for the analysis of scaling of wireless networks. In this model nodes were considered confined to overlapping neighborhoods. The succession of neighborhoods that a packet crosses from sender to destination was predetermined by a routing algorithm. The results show that the achievable orders of thoroughput per source-destination pair can be obtained as a function of properties of the node locations and neighborhood dimensions.

Original languageEnglish (US)
Pages (from-to)437
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Throughput scaling in wireless networks with restricted mobility'. Together they form a unique fingerprint.

Cite this