We consider a time slotted communication network consisting of a base station (BS), an adversary, $N$ users and $N_s$ communication channels. Both the BS and the adversary have average power constraints and the probability of successful transmission of an update packet depends on the transmission power of the BS and the blocking power of the adversary. We provide a universal lower bound for the average age for this communication network. We prove that the uniform scheduling algorithm with any feasible transmission power choosing policy is $4$ optimal; and the max-age user choosing policy is $2$ optimal. In the second part of the paper, we consider the setting where the BS chooses a transmission policy and the adversary chooses a blocking policy from the set of randomized stationary policies. We show that the Nash equilibrium point may or may not exist for this communication network. We find special cases where the Nash equilibrium always exists.
Optimal Sampling and Scheduling for Timely Status Updates in Multi-source Networks
我们考虑了一个联合采样和调度问题，优化多源系统中的数据新鲜度。数据新鲜度由非递减惩罚函数\emph{age of information}测量，其中所有源具有相同的年龄惩罚函数。源节点轮流产生更新数据包，并通过共享信道以随机延迟将更新数据包逐个转发到目的节点。有一个调度器，它选择源的更新顺序，和一个采样器，它确定源何时应该生成一个新的数据包。我们的目标是找到最佳的采样器-采样器对，使总平均年龄惩罚在交付时间（Ta-APD）和总平均年龄惩罚（Ta-AP）最小化。我们证明了最大年龄优先（MAF）调度器和零等待采样器是联合最优的最小化的TA-APD。同时，MAF调度器和具有降低复杂度的相对值迭代（RVI-RC）采样器对于最小化Ta-AP是联合最优的。RVI-RC采样器是基于相对值迭代算法，其复杂性通过利用最佳采样器中的阈值特性来降低。最后，通过对贝尔曼方程的近似分析，设计了一种低复杂度的阈值型采样器。这种阈值型采样器减少到一个简单的注水采样器的线性年龄惩罚函数。
Agentic DDQN-Based Scheduling for Licensed and Unlicensed Band Allocation in Sidelink Networks
Department of Electronics and Electrical Engineering（电子与电气工程系）；Institute of Communications Engineering（通讯工程研究所）；National Yang Ming Chiao Tung University（阳明交通大学）；Research Center for Information Technology Innovation（信息技术创新研究中心）；Academia Sinica（台湾“中央研究院”）；Bradley Department of Electrical and Computer Engineering（电气与计算机工程系）
