Throughput scaling for heterogeneous networks

Sanjeev R. Kulkarni, Pramod Viswanath

Research output: Contribution to journalConference article

Abstract

A study was conducted on how the transport capacity scales as a funciton of the number of nodes and access points. The assumption was that the nodes were not moving, at least relative to the time scale of communication. Thus, the scaling laws will depend on the traffic patter, how the access point were distributed, and the physical locations of the nodes.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Fingerprint

Scaling laws
Heterogeneous networks
Heterogeneous Networks
Throughput
Scaling
Communication
Vertex of a graph
Scaling Laws
Time Scales
Traffic

ASJC Scopus subject areas

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

Cite this

Throughput scaling for heterogeneous networks. / Kulkarni, Sanjeev R.; Viswanath, Pramod.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2003.

Research output: Contribution to journalConference article

@article{6ec922bb36c74eaabc5769612c8dc888,
title = "Throughput scaling for heterogeneous networks",
abstract = "A study was conducted on how the transport capacity scales as a funciton of the number of nodes and access points. The assumption was that the nodes were not moving, at least relative to the time scale of communication. Thus, the scaling laws will depend on the traffic patter, how the access point were distributed, and the physical locations of the nodes.",
author = "Kulkarni, {Sanjeev R.} and Pramod Viswanath",
year = "2003",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Throughput scaling for heterogeneous networks

AU - Kulkarni, Sanjeev R.

AU - Viswanath, Pramod

PY - 2003/10/20

Y1 - 2003/10/20

N2 - A study was conducted on how the transport capacity scales as a funciton of the number of nodes and access points. The assumption was that the nodes were not moving, at least relative to the time scale of communication. Thus, the scaling laws will depend on the traffic patter, how the access point were distributed, and the physical locations of the nodes.

AB - A study was conducted on how the transport capacity scales as a funciton of the number of nodes and access points. The assumption was that the nodes were not moving, at least relative to the time scale of communication. Thus, the scaling laws will depend on the traffic patter, how the access point were distributed, and the physical locations of the nodes.

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

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

M3 - Conference article

AN - SCOPUS:0141938586

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -