Throughput region of random-access networks of general topology

Piyush Gupta, Alexander L. Stolyar

Research output: Contribution to journalArticlepeer-review

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

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

Fingerprint Dive into the research topics of 'Throughput region of random-access networks of general topology'. Together they form a unique fingerprint.

Cite this