Random access networks with separable schemes. Issue 4 (1st July 2019)

• Record Type: Journal Article
• Authors: Ganesan, Ghurumuruhan
• Is Part Of: IET networks. Volume 8:Issue 4(2019)
• Page Start: 233
• Page End: 238
• Publication Date: 2019-07-01
• Subjects: Lyapunov methods -- access protocols -- multiuser channels -- scheduling -- channel capacity -- radio links -- stability -- wireless channels -- probability; particular time slot -- predetermined access scheme -- generic access schemes -- separability condition -- stability region -- random access networks -- particular user -- deterministic conflict graphs -- random conflict graphs -- static networks -- mobile networks -- separable schemes -- multiuser random access network -- m users; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2018.5086
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : 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.