Open AccessRandom access networks with separable schemes
Author(s) -
Ganesan Ghurumuruhan
Publication year - 2019
Publication title -
iet networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.466
H-Index - 21
eISSN - 2047-4962
pISSN - 2047-4954
DOI - 10.1049/iet-net.2018.5086
Subject(s) - random access , computer science , separable space , network packet , queue , random graph , channel (broadcasting) , stochastic geometry models of wireless networks , scheme (mathematics) , stability (learning theory) , computer network , distributed computing , theoretical computer science , mathematics , graph , mathematical analysis , routing protocol , machine learning , optimized link state routing protocol
Consider a time slotted multiuser random access network where M users have access to a single channel and each user attempts to send packets in a particular time slot with a certain probability, according to a predetermined access scheme. This forms an interacting system of queues and in this study, the authors consider generic access schemes that satisfy a separability condition and obtain bounds for the stability region, directly using a Lyapunov‐type analysis. They apply their results to the case of random access networks with partial conflicts where any particular user has collision conflicts with only a subset of the other users. Using conflict graphs to quantify the degree of such conflicts, they obtain bounds for the stability region for both deterministic and random conflict graphs that model, respectively, static and mobile networks.