Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks
classification
💻 cs.IT
math.ITmath.PR
keywords
conditionsfinitenetworksstabilityalgorithmconsiderdecentralisedmulti-hop
pith:NSDIGQZA Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{NSDIGQZA}
Prints a linked pith:NSDIGQZA badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the natural conditions. For infinite and finite single-hop networks, we obtain broad rate-stability conditions. We also consider symmetric finite multi-hop networks and show that the natural condition is sufficient for stochastic stability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.