具有服务抢占的双向中继网络中信息的平均年龄

Masoumeh Moradian, Aresh Dadlani
{"title":"具有服务抢占的双向中继网络中信息的平均年龄","authors":"Masoumeh Moradian, Aresh Dadlani","doi":"10.1109/GLOBECOM46510.2021.9685463","DOIUrl":null,"url":null,"abstract":"In this paper, we aim to derive the average age of information (AAoI) associated with the static link scheduling policies in a buffer-aided two-way relay network, where two sources exchange their updates through an intermediate relay equipped with data buffers. With regard to buffer-aided relaying, we consider the two-mode relaying scheme, where each time slot is dedicated to either broadcast or multiple access mode. Moreover, the link scheduling policy is considered to be static, which randomizes between broadcast and multiple access modes when the relay is backlogged and chooses the multiple access mode, otherwise. We establish AAoI corresponding to the sources in terms of steady-state probabilities of buffers at the relay for different instants of the network. Through numerical results, we show that the joint status of the queues at the relay has a significant effect on determining the optimal static link scheduling policy and further validate our analytical approach via simulations.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Average Age of Information in Two-Way Relay Networks with Service Preemptions\",\"authors\":\"Masoumeh Moradian, Aresh Dadlani\",\"doi\":\"10.1109/GLOBECOM46510.2021.9685463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we aim to derive the average age of information (AAoI) associated with the static link scheduling policies in a buffer-aided two-way relay network, where two sources exchange their updates through an intermediate relay equipped with data buffers. With regard to buffer-aided relaying, we consider the two-mode relaying scheme, where each time slot is dedicated to either broadcast or multiple access mode. Moreover, the link scheduling policy is considered to be static, which randomizes between broadcast and multiple access modes when the relay is backlogged and chooses the multiple access mode, otherwise. We establish AAoI corresponding to the sources in terms of steady-state probabilities of buffers at the relay for different instants of the network. Through numerical results, we show that the joint status of the queues at the relay has a significant effect on determining the optimal static link scheduling policy and further validate our analytical approach via simulations.\",\"PeriodicalId\":200641,\"journal\":{\"name\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOBECOM46510.2021.9685463\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM46510.2021.9685463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在本文中,我们的目标是推导与缓冲辅助双向中继网络中静态链路调度策略相关的平均信息年龄(AAoI),其中两个源通过配备数据缓冲区的中间中继交换其更新。对于缓冲辅助中继,我们考虑了双模中继方案,其中每个时隙专用于广播或多址模式。链路调度策略被认为是静态的,当中继积压时,链路调度策略在广播模式和多址模式之间随机选择,反之则选择多址模式。我们根据网络不同时刻中继处缓冲区的稳态概率建立了与源对应的AAoI。通过数值结果表明,中继上队列的联合状态对确定最优静态链路调度策略有重要影响,并通过仿真进一步验证了本文的分析方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Average Age of Information in Two-Way Relay Networks with Service Preemptions
In this paper, we aim to derive the average age of information (AAoI) associated with the static link scheduling policies in a buffer-aided two-way relay network, where two sources exchange their updates through an intermediate relay equipped with data buffers. With regard to buffer-aided relaying, we consider the two-mode relaying scheme, where each time slot is dedicated to either broadcast or multiple access mode. Moreover, the link scheduling policy is considered to be static, which randomizes between broadcast and multiple access modes when the relay is backlogged and chooses the multiple access mode, otherwise. We establish AAoI corresponding to the sources in terms of steady-state probabilities of buffers at the relay for different instants of the network. Through numerical results, we show that the joint status of the queues at the relay has a significant effect on determining the optimal static link scheduling policy and further validate our analytical approach via simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Blockchain-based Energy Trading Scheme for Dynamic Charging of Electric Vehicles Algebraic Design of a Class of Rate 1/3 Quasi-Cyclic LDPC Codes A Fast and Scalable Resource Allocation Scheme for End-to-End Network Slices Modelling of Multi-Tier Handover in LiFi Networks Enabling Efficient Scheduling Policy in Intelligent Reflecting Surface Aided Federated Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1