A Random Access Scheme for Aggregate Traffic Based on Deep Fusion of Supermartingale and Improved SSA

IF 0.5 4区 工程技术 Q4 ENGINEERING, ELECTRICAL & ELECTRONIC Radioengineering Pub Date : 2023-12-01 DOI:10.13164/re.2023.0625
H. L. Sun, Z. H. Liao, W. D. Shen
{"title":"A Random Access Scheme for Aggregate Traffic Based on Deep Fusion of Supermartingale and Improved SSA","authors":"H. L. Sun, Z. H. Liao, W. D. Shen","doi":"10.13164/re.2023.0625","DOIUrl":null,"url":null,"abstract":". The network services present diversity as the continuous evolution of communication scenarios, which brings a great challenge to the efficient utilization of resources. The ALOHA access mechanism is considered as an effective solution to deal with multi services for its feature of shared bandwidth. However, the collision problem of ALOHA degrades the quality of service ( QoS ) seriously. The multi packet reception ( MPR ) technology could mitigate collision and improve network performance. Considering ALOHA mechanism with MPR capability, we pro-pose a novel random access scheme for aggregate traffic based on deep fusion of supermartingale and improved sparrow search algorithm ( SSA ) to provide delay QoS guarantee. Firstly, we construct a complicated queuing model with heterogeneous arrivals and ALOHA-type service. Secondly, we derive the tighter delay-violation probability bound relying on supermartingale theory, and the optimization problem is constructed with the goal of minimizing the service rate and the constraint of supermartin-gale bound. Finally, we improve the SSA by combining Circle chaotic map, nonlinear inertia weight and Lévy flight strategy, then the scheme is designed by applying the improved SSA and supermartingale constraint. Simulation results show that the proposed algorithm has faster convergence speed and the scheme is more bandwidth-saving.","PeriodicalId":54514,"journal":{"name":"Radioengineering","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Radioengineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.13164/re.2023.0625","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

. The network services present diversity as the continuous evolution of communication scenarios, which brings a great challenge to the efficient utilization of resources. The ALOHA access mechanism is considered as an effective solution to deal with multi services for its feature of shared bandwidth. However, the collision problem of ALOHA degrades the quality of service ( QoS ) seriously. The multi packet reception ( MPR ) technology could mitigate collision and improve network performance. Considering ALOHA mechanism with MPR capability, we pro-pose a novel random access scheme for aggregate traffic based on deep fusion of supermartingale and improved sparrow search algorithm ( SSA ) to provide delay QoS guarantee. Firstly, we construct a complicated queuing model with heterogeneous arrivals and ALOHA-type service. Secondly, we derive the tighter delay-violation probability bound relying on supermartingale theory, and the optimization problem is constructed with the goal of minimizing the service rate and the constraint of supermartin-gale bound. Finally, we improve the SSA by combining Circle chaotic map, nonlinear inertia weight and Lévy flight strategy, then the scheme is designed by applying the improved SSA and supermartingale constraint. Simulation results show that the proposed algorithm has faster convergence speed and the scheme is more bandwidth-saving.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于超级鞅和改进 SSA 深度融合的聚合流量随机访问方案
. 随着通信场景的不断演变,网络业务呈现出多样性,这对资源的高效利用提出了很大的挑战。ALOHA访问机制以其带宽共享的特点被认为是处理多业务的有效解决方案。但是,ALOHA的碰撞问题严重降低了服务质量(QoS)。多包接收(MPR)技术可以减少网络冲突,提高网络性能。考虑到具有MPR能力的ALOHA机制,提出了一种基于上鞅深度融合和改进的麻雀搜索算法(SSA)的聚合流量随机接入方案,以提供时延QoS保证。首先,构造了具有异构到达和aloha类型服务的复杂排队模型。其次,利用超鞅理论推导出更严格的延误违例概率界,并以服务率最小和超鞅界约束为目标构造优化问题;最后,结合圆混沌映射、非线性惯性权值和lsamvy飞行策略对SSA进行改进,并将改进后的SSA与上鞅约束相结合进行方案设计。仿真结果表明,该算法具有更快的收敛速度和更大的带宽节省。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Radioengineering
Radioengineering 工程技术-工程:电子与电气
CiteScore
2.00
自引率
9.10%
发文量
0
审稿时长
5.7 months
期刊介绍: Since 1992, the Radioengineering Journal has been publishing original scientific and engineering papers from the area of wireless communication and application of wireless technologies. The submitted papers are expected to deal with electromagnetics (antennas, propagation, microwaves), signals, circuits, optics and related fields. Each issue of the Radioengineering Journal is started by a feature article. Feature articles are organized by members of the Editorial Board to present the latest development in the selected areas of radio engineering. The Radioengineering Journal makes a maximum effort to publish submitted papers as quickly as possible. The first round of reviews should be completed within two months. Then, authors are expected to improve their manuscript within one month. If substantial changes are recommended and further reviews are requested by the reviewers, the publication time is prolonged.
期刊最新文献
Test Evaluation Method for Second-order Intermodulation False Alarm Interference Performance of the User in the TDD NOMA Cellular Networks Enabling FFR An Intelligent Denoising Method for Jamming Pattern Recognition under Noisy Conditions Reconstruction of Mixed Boundary Objects and Classification Using Deep Learning and Linear Sampling Method Coverless Steganography Based on Low Similarity Feature Selection in DCT Domain
×
引用
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