A deterministic approach to throughput scaling in wireless networks

Sanjeev R. Kulkarni, Pramod Viswanath

Research output: Contribution to journalConference article

Abstract

The throughput scaling problem for wireless communication networks was considered and solved using a deterministic approach. The achievability results used the transmitter-receiver distances, nonempty squarelets and the crowding factor as the parameters and conditions on the node locations. The throughput for a network with a particular squarelet size and a specified crowding factor was determined and proved.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Sep 12 2002
Externally publishedYes
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: Jun 30 2002Jul 5 2002

Fingerprint

Wireless Networks
Wireless networks
Throughput
Scaling
Transceivers
Wireless Communication
Communication Networks
Transmitter
Telecommunication networks
Receiver
Vertex of a graph

ASJC Scopus subject areas

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

Cite this

A deterministic approach to throughput scaling in wireless networks. / Kulkarni, Sanjeev R.; Viswanath, Pramod.

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

Research output: Contribution to journalConference article

@article{46339cd06f754c3988d8e6d311867cac,
title = "A deterministic approach to throughput scaling in wireless networks",
abstract = "The throughput scaling problem for wireless communication networks was considered and solved using a deterministic approach. The achievability results used the transmitter-receiver distances, nonempty squarelets and the crowding factor as the parameters and conditions on the node locations. The throughput for a network with a particular squarelet size and a specified crowding factor was determined and proved.",
author = "Kulkarni, {Sanjeev R.} and Pramod Viswanath",
year = "2002",
month = "9",
day = "12",
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 - A deterministic approach to throughput scaling in wireless networks

AU - Kulkarni, Sanjeev R.

AU - Viswanath, Pramod

PY - 2002/9/12

Y1 - 2002/9/12

N2 - The throughput scaling problem for wireless communication networks was considered and solved using a deterministic approach. The achievability results used the transmitter-receiver distances, nonempty squarelets and the crowding factor as the parameters and conditions on the node locations. The throughput for a network with a particular squarelet size and a specified crowding factor was determined and proved.

AB - The throughput scaling problem for wireless communication networks was considered and solved using a deterministic approach. The achievability results used the transmitter-receiver distances, nonempty squarelets and the crowding factor as the parameters and conditions on the node locations. The throughput for a network with a particular squarelet size and a specified crowding factor was determined and proved.

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

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

M3 - Conference article

AN - SCOPUS:0036354237

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -