skip to main content
research-article

Stability of a standard decentralised medium access

Published: 17 January 2019 Publication History

Abstract

We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is unsaturated " each node receives an exogenous flow of packets at the rate ! packets per time slot. Each packet takes one slot to transmit, but neighbouring nodes cannot transmit simultaneously. The algorithm we study is standard in that: a node with empty queue does not compete for medium access; the access procedure by a node does not depend on its queue length, as long as it is non-zero. Two system topologies are considered, with nodes arranged in a circle and in a line. We prove that, for either topology, the system is stochastically stable under condition ! < 2/5. This result is intuitive for the circle topology as the throughput each node receives in a saturated system (with infinite queues) is equal to the so-called parking constant, which is larger than 2/5. (This fact, however, does not help to prove our result.) The result is not intuitive at all for the line topology as in a saturated system some nodes receive a throughput lower than 2/5.

References

[1]
J.G. Dai (1995). On the Positive Harris Recurrence for Open Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models. Annals of Applied Probability, 5, 49--77.
[2]
M. Durvy, O. Dousse, P. Thiran (2009). Self-organization properties of CSMA/CA systems and their consequences on fairness. IEEE Transactions on Information Theory, 55 (3), 931-943.
[3]
L. Jiang, J. Walrand (2010). A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Transactions on Networking (TON), 18(3), 960--972.
[4]
A.N. Rybko and A.L. Stolyar (1992). Ergodicity of Stochastic Processes Describing the Operation of Open Queueing Networks. Problems of Information Transmission, 28, 199--220.
[5]
D. Shah, J. Shin (2012). Randomized scheduling algorithm for queueing networks. Annals of Applied Probability, 22(1), 128--171.
[6]
S. Shnner, P. van de Ven (2017). Per-site occupancy in the discrete parking problem. Statistics and Probability Letters, 120, 141--146.
[7]
S. Shneer, A. L. Stolyar. Stability conditions for a discrete-time decentralised medium access algorithm. Submitted. https://arxiv.org/abs/1707.01548
[8]
A.L. Stolyar (1995). On the Stability of Multiclass Queueing Networks: A Relaxed Sufficient Condition via Limiting Fluid Processes. Markov Processes and Related Fields, 1(4), 491--512.
[9]
L. Tassiulas, A. Ephremides (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12), 1936--1948.
[10]
P.M. van de Ven, S.C. Borst, J.S.H. van Leeuwaarden, A. Prouti'ere (2010). Insensitivity and stability of random-access networks. Performance Evaluation, 67 (11), 1230--1242.
  1. Stability of a standard decentralised medium access

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 46, Issue 2
    September 2018
    95 pages
    ISSN:0163-5999
    DOI:10.1145/3305218
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 January 2019
    Published in SIGMETRICS Volume 46, Issue 2

    Check for updates

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 28
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 25 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media