{"title":"基于信道门限的fanet多址多优先级排队机制","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":"{\"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}","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}
Multi-priority Queueing Mechanism for Channel Threshold based Multiple Access in FANETs
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.