Throughput scaling in wireless networks with restricted mobility

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

Research output: Contribution to journalArticle

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

Fingerprint

Wireless Networks
Wireless networks
Throughput
Scaling
Routing algorithms
Routing Algorithm
Vertex of a graph
Overlapping
Alternatives
Model

ASJC Scopus subject areas

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

Cite this

Throughput scaling in wireless networks with restricted mobility. / Lozano, Aurélie C.; Kulkarni, Sanjeev R.; Viswanath, Pramod.

In: IEEE International Symposium on Information Theory - Proceedings, 2004, p. 437.

Research output: Contribution to journalArticle

@article{8411d22975e94cc89f48941b27e4f888,
title = "Throughput scaling in wireless networks with restricted mobility",
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.",
author = "Lozano, {Aur{\'e}lie C.} and Kulkarni, {Sanjeev R.} and Pramod Viswanath",
year = "2004",
language = "English (US)",
pages = "437",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Throughput scaling in wireless networks with restricted mobility

AU - Lozano, Aurélie C.

AU - Kulkarni, Sanjeev R.

AU - Viswanath, Pramod

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=5044244893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044244893&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:5044244893

SP - 437

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -