Age-Efficient Random Access With Load Adaptation

IF 7.7 2区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Mobile Computing Pub Date : 2024-09-02 DOI:10.1109/TMC.2024.3453042

Jiwen Wang;Rongrong Zhang;Jihong Yu;Ju Ren;Yun Li

{"title":"Age-Efficient Random Access With Load Adaptation","authors":"Jiwen Wang;Rongrong Zhang;Jihong Yu;Ju Ren;Yun Li","doi":"10.1109/TMC.2024.3453042","DOIUrl":null,"url":null,"abstract":"The lightweight and energy-efficient Frame Slotted Aloha (FSA) protocol has become a promising MAC protocol in large-scale IoT systems. Existing work on minimizing the age of information (AoI) of FSA protocol cannot significantly benefit from frequent packet generations when the packet generation rate \n<inline-formula><tex-math>$\\lambda$</tex-math></inline-formula>\n exceeds its throughput \n<inline-formula><tex-math>$e^{-1}$</tex-math></inline-formula>\n. To fill this gap, this paper proposes two age threshold-based algorithms to reduce the AoI of FSA systems for \n<inline-formula><tex-math>$\\lambda > e^{-1}$</tex-math></inline-formula>\n, namely TF and TF+. Their core ideas are to only allow the nodes with age gain over the configured thresholds to send their packets so that the FSA systems are slimmed to a stable one with \n<inline-formula><tex-math>$\\lambda < e^{-1}$</tex-math></inline-formula>\n and a polling system, respectively. Technically, we design the threshold configuration rules for the two algorithms and characterize the normalized average AoI. We also conduct simulation and the results show that TF and TF+ achieve lower AoI than the prior works.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"23 12","pages":"15210-15223"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10663280/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

The lightweight and energy-efficient Frame Slotted Aloha (FSA) protocol has become a promising MAC protocol in large-scale IoT systems. Existing work on minimizing the age of information (AoI) of FSA protocol cannot significantly benefit from frequent packet generations when the packet generation rate

$\lambda$

exceeds its throughput

$e^{-1}$

. To fill this gap, this paper proposes two age threshold-based algorithms to reduce the AoI of FSA systems for

$\lambda > e^{-1}$

, namely TF and TF+. Their core ideas are to only allow the nodes with age gain over the configured thresholds to send their packets so that the FSA systems are slimmed to a stable one with

$\lambda < e^{-1}$

and a polling system, respectively. Technically, we design the threshold configuration rules for the two algorithms and characterize the normalized average AoI. We also conduct simulation and the results show that TF and TF+ achieve lower AoI than the prior works.

查看原文本刊更多论文

具有负载适应性的高时效随机存取

轻量级、高能效的帧空隙阿罗哈（FSA）协议已成为大规模物联网系统中一种前景广阔的 MAC 协议。当数据包生成率 $\lambda$ 超过其吞吐量 $e^{-1}$时，现有关于最小化 FSA 协议信息年龄（AoI）的工作无法从频繁的数据包生成中显著获益。为了填补这一空白，本文提出了两种基于年龄阈值的算法来降低 FSA 系统在 $\lambda > e^{-1}$ 时的 AoI，即 TF 和 TF+。它们的核心思想是只允许年龄增益超过配置阈值的节点发送数据包，从而使 FSA 系统分别瘦身为一个稳定的 $\lambda < e^{-1}$ 系统和一个轮询系统。在技术上，我们设计了两种算法的阈值配置规则，并描述了归一化平均 AoI 的特征。我们还进行了仿真，结果表明 TF 和 TF+ 算法的 AoI 比之前的算法更低。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Mobile Computing 工程技术-电信学

CiteScore

12.90

自引率

2.50%

发文量

403

审稿时长

6.6 months

期刊介绍： IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.