Throughput region of random-access networks of general topology

Piyush Gupta, Alexander L. Stolyar

Research output: Contribution to journalArticle

Abstract

A random-access model is introduced and studied, which is a generalization of the classical slotted Aloha model. Unlike in the slotted Aloha, where two or more simultaneous transmissions on any subset of links collide and erase each other, a quite general interference structure is considered, where transmission on link i erases a simultaneous transmission on link j with some fixed probability \phi ij. In particular, it is allowed that φ ij≠phi ji, which captures possible asymmetric interference in realmost notably wirelesscommunication networks. Results characterizing the maximum achievable link throughput region and its Pareto boundary are derived. In some cases, the Pareto boundary characterization is almost as simple and explicit as that derived in prior work for the classical slotted Aloha system.

Original languageEnglish (US)
Article number6142092
Pages (from-to)3016-3022
Number of pages7
JournalIEEE Transactions on Information Theory
Volume58
Issue number5
DOIs
StatePublished - May 1 2012
Externally publishedYes

Fingerprint

interference
Throughput
Topology

Keywords

  • Collision channel
  • communication networks
  • interference
  • random access
  • slotted Aloha
  • throughput region
  • weighted proportional fairness
  • wireless

ASJC Scopus subject areas

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

Cite this

Throughput region of random-access networks of general topology. / Gupta, Piyush; Stolyar, Alexander L.

In: IEEE Transactions on Information Theory, Vol. 58, No. 5, 6142092, 01.05.2012, p. 3016-3022.

Research output: Contribution to journalArticle

@article{795141c8c04d43d8ba1d6e458315e9d0,
title = "Throughput region of random-access networks of general topology",
abstract = "A random-access model is introduced and studied, which is a generalization of the classical slotted Aloha model. Unlike in the slotted Aloha, where two or more simultaneous transmissions on any subset of links collide and erase each other, a quite general interference structure is considered, where transmission on link i erases a simultaneous transmission on link j with some fixed probability \phi ij. In particular, it is allowed that φ ij≠phi ji, which captures possible asymmetric interference in realmost notably wirelesscommunication networks. Results characterizing the maximum achievable link throughput region and its Pareto boundary are derived. In some cases, the Pareto boundary characterization is almost as simple and explicit as that derived in prior work for the classical slotted Aloha system.",
keywords = "Collision channel, communication networks, interference, random access, slotted Aloha, throughput region, weighted proportional fairness, wireless",
author = "Piyush Gupta and Stolyar, {Alexander L.}",
year = "2012",
month = "5",
day = "1",
doi = "10.1109/TIT.2012.2184634",
language = "English (US)",
volume = "58",
pages = "3016--3022",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Throughput region of random-access networks of general topology

AU - Gupta, Piyush

AU - Stolyar, Alexander L.

PY - 2012/5/1

Y1 - 2012/5/1

N2 - A random-access model is introduced and studied, which is a generalization of the classical slotted Aloha model. Unlike in the slotted Aloha, where two or more simultaneous transmissions on any subset of links collide and erase each other, a quite general interference structure is considered, where transmission on link i erases a simultaneous transmission on link j with some fixed probability \phi ij. In particular, it is allowed that φ ij≠phi ji, which captures possible asymmetric interference in realmost notably wirelesscommunication networks. Results characterizing the maximum achievable link throughput region and its Pareto boundary are derived. In some cases, the Pareto boundary characterization is almost as simple and explicit as that derived in prior work for the classical slotted Aloha system.

AB - A random-access model is introduced and studied, which is a generalization of the classical slotted Aloha model. Unlike in the slotted Aloha, where two or more simultaneous transmissions on any subset of links collide and erase each other, a quite general interference structure is considered, where transmission on link i erases a simultaneous transmission on link j with some fixed probability \phi ij. In particular, it is allowed that φ ij≠phi ji, which captures possible asymmetric interference in realmost notably wirelesscommunication networks. Results characterizing the maximum achievable link throughput region and its Pareto boundary are derived. In some cases, the Pareto boundary characterization is almost as simple and explicit as that derived in prior work for the classical slotted Aloha system.

KW - Collision channel

KW - communication networks

KW - interference

KW - random access

KW - slotted Aloha

KW - throughput region

KW - weighted proportional fairness

KW - wireless

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

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

U2 - 10.1109/TIT.2012.2184634

DO - 10.1109/TIT.2012.2184634

M3 - Article

AN - SCOPUS:84860255733

VL - 58

SP - 3016

EP - 3022

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

M1 - 6142092

ER -