### 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.

Original language | English (US) |
---|---|

Pages (from-to) | 33-35 |

Number of pages | 3 |

Journal | Performance Evaluation Review |

Volume | 46 |

Issue number | 2 |

DOIs | |

State | Published - Jan 17 2019 |

Event | 2018 Workshop on MAthematical Performance Modeling and Analysis, MAMA 2018 and Workshop on Critical Infrastructure Network Security, CINS 2018 - Irvine, United States Duration: Jun 1 2018 → … |

### Fingerprint

### Keywords

- Carrier-Sense Multiple Access
- Discrete parking process
- Medium access protocols
- Non-monotone process
- Queueing networks
- Stochastic stability
- Wireless systems

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

*Performance Evaluation Review*,

*46*(2), 33-35. https://doi.org/10.1145/3305218.3305231

**Stability of a standard decentralised medium access.** / Shneer, Seva; Stolyar, Aleksandr.

Research output: Contribution to journal › Conference article

*Performance Evaluation Review*, vol. 46, no. 2, pp. 33-35. https://doi.org/10.1145/3305218.3305231

}

TY - JOUR

T1 - Stability of a standard decentralised medium access

AU - Shneer, Seva

AU - Stolyar, Aleksandr

PY - 2019/1/17

Y1 - 2019/1/17

N2 - 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.

AB - 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.

KW - Carrier-Sense Multiple Access

KW - Discrete parking process

KW - Medium access protocols

KW - Non-monotone process

KW - Queueing networks

KW - Stochastic stability

KW - Wireless systems

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

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

U2 - 10.1145/3305218.3305231

DO - 10.1145/3305218.3305231

M3 - Conference article

AN - SCOPUS:85061099554

VL - 46

SP - 33

EP - 35

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 2

ER -