ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Reduced-state, optimal scheduling for decentralized medium access control of a class of wireless networks

Mohan, A and Gopalan, A and Kumar, A (2020) Reduced-state, optimal scheduling for decentralized medium access control of a class of wireless networks. In: IEEE/ACM Transactions on Networking, 28 (3). pp. 1017-1032.

[img] PDF
IEEE_ACM_TRA_NET_28_3_1017-1032_2020.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: https://dx.doi.org/10.1109/TNET.2020.2976923


Motivated by medium access control for resource-challenged wireless Internet of Things (IoT) networks, we consider the problem of queue scheduling with reduced queue state information. In particular, we consider a time-slotted scheduling model with N wireless links, such that links i and i+1 , 1 � i � N-1 cannot transmit together. Our aim in this paper is to study throughput-optimal, and even delay optimal, scheduling policies that require only the empty-nonempty state of the packet queues associated with these links (Queue Nonemptiness Based, or QNB, policies). We focus on Maximum Size Matching (MSM) policies, and provide an analysis of all the QNB-MSM policies for N=3 , thereby comparing their performance, and revisiting a delay optimal scheduling result. Our study shows that, while scheduling a maximum size matching would seem intuitive, there are important performance differences between different QNB-MSM policies. Further, it is not necessary for a QNB policy to be MSM for it to be throughput optimal. We develop a new Policy Splicing technique to combine scheduling policies for small networks to construct throughput-optimal policies for larger networks, some of which also aim for low delay. For N=3 there exists a QNB-MSM policy that is sum-queue optimal over the entire stability region. We show, however, that for N �q4, there is no QNB scheduling policy that is sum-queue length optimal over all arrival rate vectors in the capacity region. Our throughput-optimality results rely on two new arguments: a Lyapunov drift lemma specially adapted to policies that are queue length-agnostic, and a priority queueing analysis for showing strong stability. We then extend our results to a more general class of interference constraints that we call cluster-of-cliques (CoC) conflict graphs. We consider two types of CoC networks, namely, Linear Arrays of Cliques (LAoC) and Star-of-Cliques (SoC) networks. We develop QNB policies for these classes of networks, study their stability and delay properties, and propose and analyze techniques to reduce the amount of state information to be disseminated across the network for scheduling. © 1993-2012 IEEE.

Item Type: Journal Article
Publication: IEEE/ACM Transactions on Networking
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: copy right for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords: Internet of things; Queueing theory; Scheduling; System-on-chip; Wireless networks, Interference constraints; Optimal scheduling; Scheduling policies; Stability and delays; Stability regions; Throughput optimal policies; Throughput Optimality; Throughput-optimal, Medium access control
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 27 Nov 2020 11:02
Last Modified: 27 Nov 2020 11:02
URI: http://eprints.iisc.ac.in/id/eprint/65978

Actions (login required)

View Item View Item