4.5 Article

Age of transmission-optimal scheduling for state update of multi-antenna cellular Internet of Things

期刊

CHINA COMMUNICATIONS
卷 19, 期 4, 页码 302-314

出版社

CHINA INST COMMUNICATIONS
DOI: 10.23919/JCC.2022.04.022

关键词

Optimal scheduling; Interference; Indexes; Internet of Things; Job shop scheduling; Sensors; Transmitting antennas; age of transmission; information freshness; cellular IoT; restless multi-armed bandit; Whittle index

资金

  1. Fundamental Research Funds for the Central Universities [2020ZDPYMS26]
  2. National Natural Science Foundation of China [62071472, 51734009]
  3. Natural Science Foundation o Jiangsu Province [BK20210489, BK20200650]
  4. China Postdoctoral Science Foundation [2019M660133]
  5. Future Network Scientific Research Fund Project [FNSRFP-2021-YB-12]
  6. Program for Industrial IoT and Emergency Collaboration Innovative Research Team in CUMT [2020ZY002]

向作者/读者索取更多资源

This paper investigates the state update problem in a multi-antenna cellular IoT and introduces the concept of age of transmission. The problem is formulated as a restless multi-armed bandit problem, and a scheduling strategy based on the Whittle index and complete subgraph detection is proposed to avoid interference between nodes.
Timely information updates are critical for real-time monitoring and control applications in the Internet of Things (IoT). In this paper, we consider a multi-antenna cellular IoT for state update where a base station (BS) collects information from randomly distributed IoT nodes through time-varying channel. Specifically, multiple IoT nodes are allowed to transmit their state update simultaneously in a spatial multiplex manner. Inspired by age of information (AoI), we introduce a novel concept of age of transmission (AoT) for the sceneries in which BS cannot obtain the generation time of the packets waiting to be transmitted. The deadline-constrained AoT-optimal scheduling problem is formulated as a restless multi-armed bandit (RMAB) problem. Firstly, we prove the indexability of the scheduling problem and derive the closed-form of the Whittle index. Then, the interference graph and complementary graph are constructed to illustrate the interference between two nodes. The complete subgraphs are detected in the complementary graph to avoid inter-node interference. Next, an AoT-optimal scheduling strategy based on the Whittle index and complete subgraph detection is proposed. Finally, numerous simulations are conducted to verify the performance of the proposed strategy.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据