Motivated by medium access control for resource-challenged wireless Internet of Things (IoT), we consider the problem of queue scheduling with reduced queue state information. In particular, we consider a time-slotted scheduling model with $N$ sensor nodes, with pair-wise dependence, such that Nodes $i$ and $i + 1,~0 < i < N$ cannot transmit together. We develop new throughput-optimal scheduling policies requiring only the empty-nonempty state of each queue that we term Queue Nonemptiness-Based (QNB) policies. We propose a Policy Splicing technique to combine scheduling policies for small networks in order to construct throughput-optimal policies for larger networks, some of which also aim for low delay. For $N = 3,$ there exists a sum-queue length optimal QNB scheduling policy. We show, however, that for $N > 4,$ there is no QNB policy that is sum-queue length optimal over all arrival rate vectors in the capacity region. 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. In the SoC setting, we propose a throughput-optimal policy that only uses information that nodes in the network can glean by sensing activity (or lack thereof) on the channel. 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.

中文翻译：

---

一类排队系统的具有单位状态反馈的吞吐量最优分散调度

受资源挑战无线物联网 (IoT) 的媒体访问控制的启发，我们考虑了队列状态信息减少的队列调度问题。特别地，我们考虑了一个具有 $N$ 传感器节点的时隙调度模型，具有成对依赖性，使得节点 $i$ 和 $i + 1,~0 < i < N$ 不能一起传输。我们开发了新的吞吐量优化调度策略，只需要每个队列的空非空状态，我们称之为基于队列非空 (QNB) 的策略。我们提出了一种策略拼接技术来组合小型网络的调度策略，以便为较大的网络构建吞吐量最优的策略，其中一些还旨在实现低延迟。对于 $N = 3，$ 存在一个和队列长度最优 QNB 调度策略。然而，我们表明，对于 $N > 4，$ 没有 QNB 策略是容量区域中所有到达率向量的总和队列长度最佳。然后，我们将结果扩展到更一般的干扰约束类别，我们称之为集群集群 (CoC) 冲突图。我们考虑两种类型的 CoC 网络，即集团线性阵列 (LAoC) 和集团之星 (SoC) 网络。我们为这些类别的网络开发 QNB 策略，研究它们的稳定性和延迟特性，并提出和分析技术以减少在网络上传播以进行调度的状态信息量。在 SoC 设置中，我们提出了一种吞吐量优化策略，该策略仅使用网络中的节点可以通过感知通道上的活动（或缺乏活动）来收集的信息。我们的吞吐量优化结果依赖于两个新参数：