Multi-priority Queueing Mechanism for Channel Threshold based Multiple Access in FANETs

B. Zheng, K. Zhuo, Huaxin Wu, Tiecheng Xie
{"title":"Multi-priority Queueing Mechanism for Channel Threshold based Multiple Access in FANETs","authors":"B. Zheng, K. Zhuo, Huaxin Wu, Tiecheng Xie","doi":"10.1109/icicn52636.2021.9673909","DOIUrl":null,"url":null,"abstract":"In order to achieve the parallel transmission of multiple service types in flying ad hoc networks (FANET) with the limited wireless channel resource, and meet the requirement of high-reliability and ultra-low-delay for the highest priority service, a novel multi-priority queueing mechanism is proposed for channel threshold based multiple access (CTMA) protocol. Firstly, according to the principle of CTMA protocol, we model the mechanism as a multi-priority M/G/1 queueing system with server’s probabilistic vacations in terms of queueing theory. Then we propose two priority queueing schemes for different priority types in detail, and derive some performance metrics, such as packet’s average sojourn time, etc., for both schemes theoretically. Results are compared and verified through simulations finally. Results show that the preemptive-resume mechanism for the highest priority service in Scheme 2 gains a large improvement in the performance of the highest priority service at the expense of a little performance of other priority services.","PeriodicalId":231379,"journal":{"name":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 9th International Conference on Information, Communication and Networks (ICICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icicn52636.2021.9673909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In order to achieve the parallel transmission of multiple service types in flying ad hoc networks (FANET) with the limited wireless channel resource, and meet the requirement of high-reliability and ultra-low-delay for the highest priority service, a novel multi-priority queueing mechanism is proposed for channel threshold based multiple access (CTMA) protocol. Firstly, according to the principle of CTMA protocol, we model the mechanism as a multi-priority M/G/1 queueing system with server’s probabilistic vacations in terms of queueing theory. Then we propose two priority queueing schemes for different priority types in detail, and derive some performance metrics, such as packet’s average sojourn time, etc., for both schemes theoretically. Results are compared and verified through simulations finally. Results show that the preemptive-resume mechanism for the highest priority service in Scheme 2 gains a large improvement in the performance of the highest priority service at the expense of a little performance of other priority services.
基于信道门限的fanet多址多优先级排队机制
为了在无线信道资源有限的情况下实现飞自组网(FANET)中多种业务类型的并行传输,满足高优先级业务的高可靠性和超低延迟要求,提出了一种基于信道门限的多址(CTMA)协议的多优先级排队机制。首先,根据CTMA协议的原理,利用排队理论将该机制建模为具有服务器概率休假的多优先级M/G/1排队系统。然后,我们针对不同的优先级类型提出了两种优先级队列方案,并从理论上推导了两种方案的一些性能指标,如数据包的平均停留时间等。最后通过仿真对结果进行了比较和验证。结果表明,方案2中最高优先级服务的抢占恢复机制在牺牲其他优先级服务性能的前提下,对最高优先级服务的性能有较大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信