Stability and instability of individual nodes in multi-hop wireless CSMA/CA networks

Vsevolod Shneer, Peter van de Ven

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

CSMA/CA is a popular random-access algorithm for wireless networks, but its stability properties are poorly understood. We consider a linear multi-hop network of three nodes where the neighbouring nodes interfere with each other and medium access is governed by the CSMA/CA algorithm. We assume that the source node is saturated and packets are forwarded through the network, each node transmitting towards its neighbour on the right. We demonstrate that the queue of the second node is saturated (unstable) and the queue of the third node is stable; this confirms heuristic arguments and simulation results found in the research literature. Providing a rigorous proof for the (in)stability of these nodes is complicated by the fact that neither queue is Markovian when considered in isolation, and the two queues are dependent. We then compute the limiting behavior of node 3, and use this to determine the end-to-end throughput of the network. Finally, we vary the access probabilities of the nodes, and evaluate how this affects the stability and throughput of the system.
Original languageEnglish
Pages (from-to)19-21
Number of pages3
JournalPerformance Evaluation Review
Volume43
Issue number2
DOIs
Publication statusPublished - Sep 2015
EventIFIP WG 7.3 Performance 2015 - Sydney, Australia
Duration: 19 Oct 201521 Oct 2015

Fingerprint Dive into the research topics of 'Stability and instability of individual nodes in multi-hop wireless CSMA/CA networks'. Together they form a unique fingerprint.

  • Cite this