A deterministic approach to throughput scaling in wireless networks

Sanjeev R. Kulkarni, Pramod Viswanath

Research output: Contribution to journalArticle

Abstract

We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider n identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain Ω (√n) throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the √n/ √log n throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.

Original languageEnglish (US)
Pages (from-to)1041-1049
Number of pages9
JournalIEEE Transactions on Information Theory
Volume50
Issue number6
DOIs
StatePublished - Jun 1 2004

Fingerprint

scaling
Wireless networks
Throughput
Transmitters
interference
recipient

Keywords

  • Ad hoc networks
  • Capacity
  • Deterministic
  • Individual sequence
  • Multihop
  • Random
  • Scaling
  • Throughput
  • Wireless networks

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

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

In: IEEE Transactions on Information Theory, Vol. 50, No. 6, 01.06.2004, p. 1041-1049.

Research output: Contribution to journalArticle

@article{f4bbf898353d45fbb0a0ee97045b32c0,
title = "A deterministic approach to throughput scaling in wireless networks",
abstract = "We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider n identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain Ω (√n) throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the √n/ √log n throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.",
keywords = "Ad hoc networks, Capacity, Deterministic, Individual sequence, Multihop, Random, Scaling, Throughput, Wireless networks",
author = "Kulkarni, {Sanjeev R.} and Pramod Viswanath",
year = "2004",
month = "6",
day = "1",
doi = "10.1109/TIT.2004.828055",
language = "English (US)",
volume = "50",
pages = "1041--1049",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - A deterministic approach to throughput scaling in wireless networks

AU - Kulkarni, Sanjeev R.

AU - Viswanath, Pramod

PY - 2004/6/1

Y1 - 2004/6/1

N2 - We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider n identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain Ω (√n) throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the √n/ √log n throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.

AB - We address the problem of how throughput in a wireless network scales as the number of users grows. Following the model of Gupta and Kumar, we consider n identical nodes placed in a fixed area. Pairs of transmitters and receivers wish to communicate but are subject to interference from other nodes. Throughput is measured in bit-meters per second. We provide a very elementary deterministic approach that gives achievability results in terms of three key properties of the node locations. As a special case, we obtain Ω (√n) throughput for a general class of network configurations in a fixed area. Results for random node locations in a fixed area can also be derived as special cases of the general result by verifying the growth rate of three parameters. For example, as a simple corollary of our result we obtain a stronger (almost sure) version of the √n/ √log n throughput for random node locations in a fixed area obtained by Gupta and Kumar. Results for some other interesting non-independent and identically distributed (i.i.d.) node distributions are also provided.

KW - Ad hoc networks

KW - Capacity

KW - Deterministic

KW - Individual sequence

KW - Multihop

KW - Random

KW - Scaling

KW - Throughput

KW - Wireless networks

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

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

U2 - 10.1109/TIT.2004.828055

DO - 10.1109/TIT.2004.828055

M3 - Article

AN - SCOPUS:2942637958

VL - 50

SP - 1041

EP - 1049

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -