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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'A deterministic approach to throughput scaling in wireless networks'. Together they form a unique fingerprint.

  • Cite this