新兴认知无线网络中基于树的多播路由和信道分配

H. Salameh, Mustafa Ali
{"title":"新兴认知无线网络中基于树的多播路由和信道分配","authors":"H. Salameh, Mustafa Ali","doi":"10.34028/iajit/20/3a/1","DOIUrl":null,"url":null,"abstract":"In future multi-hop wireless networks like 5G and B5G, efficient large-scale video sharing and data dissemination are expected to rely heavily on multicast routing and Cognitive Radio (CR) technology. While multicast routing is efficient when the network always has access to the spectrum, the dynamic nature of Primary User (PU) activities, heterogeneous spectrum across the CR Network (CRN), and PU access priority make it challenging to implement efficient multicast routing protocols in CRNs. This paper proposes a hierarchical multicast routing mechanism for multi-hop CRNs that exploits the Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) concepts. The proposed multicast routing mechanism consists of tree construction and channel assignment algorithms. The tree-construction algorithm models the network topology as a multicast tree rooted at the CR source and spanning all the CR nodes. Based on the constructed tree, the channel assignment algorithm employs the Probability Of Success (POS) metric to assign channels to the various layers defined by the constructed SPT or MST, ensuring that the most reliable channel is used for the multi-hop multicast transmissions. Simulation experiments are conducted to evaluate the mechanism’s effectiveness, revealing significant improvements in throughput and Packet Delivery Rate (PDR) compared to state-of-the-art protocols under different network conditions. The simulations also show that the SPT-based mechanism outperforms the MST-based mechanism in terms of throughput but has a higher tree construction complexity.","PeriodicalId":13624,"journal":{"name":"Int. Arab J. Inf. Technol.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tree-based multicast routing and channel assignment for enhanced throughout in emerging cognitive radio networks\",\"authors\":\"H. Salameh, Mustafa Ali\",\"doi\":\"10.34028/iajit/20/3a/1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In future multi-hop wireless networks like 5G and B5G, efficient large-scale video sharing and data dissemination are expected to rely heavily on multicast routing and Cognitive Radio (CR) technology. While multicast routing is efficient when the network always has access to the spectrum, the dynamic nature of Primary User (PU) activities, heterogeneous spectrum across the CR Network (CRN), and PU access priority make it challenging to implement efficient multicast routing protocols in CRNs. This paper proposes a hierarchical multicast routing mechanism for multi-hop CRNs that exploits the Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) concepts. The proposed multicast routing mechanism consists of tree construction and channel assignment algorithms. The tree-construction algorithm models the network topology as a multicast tree rooted at the CR source and spanning all the CR nodes. Based on the constructed tree, the channel assignment algorithm employs the Probability Of Success (POS) metric to assign channels to the various layers defined by the constructed SPT or MST, ensuring that the most reliable channel is used for the multi-hop multicast transmissions. Simulation experiments are conducted to evaluate the mechanism’s effectiveness, revealing significant improvements in throughput and Packet Delivery Rate (PDR) compared to state-of-the-art protocols under different network conditions. The simulations also show that the SPT-based mechanism outperforms the MST-based mechanism in terms of throughput but has a higher tree construction complexity.\",\"PeriodicalId\":13624,\"journal\":{\"name\":\"Int. Arab J. Inf. Technol.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. Arab J. Inf. Technol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.34028/iajit/20/3a/1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. Arab J. Inf. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34028/iajit/20/3a/1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在未来的5G和B5G等多跳无线网络中,高效的大规模视频共享和数据传播预计将严重依赖组播路由和认知无线电(CR)技术。当网络总是有频谱访问时,组播路由是有效的,但是主用户(Primary User, PU)活动的动态性、跨CR网络(CRN)的异构频谱以及PU访问优先级给在CRN中实现高效的组播路由协议带来了挑战。本文提出了一种利用最短路径树(SPT)和最小生成树(MST)概念的多跳crn分层组播路由机制。提出的组播路由机制包括树构造和信道分配算法。树形构造算法将网络拓扑建模为一棵以CR源为根、跨越所有CR节点的组播树。在构造的树的基础上,采用成功概率(POS)指标将信道分配到构造的SPT或MST定义的各个层,确保使用最可靠的信道进行多跳组播传输。通过仿真实验来评估该机制的有效性,揭示了在不同网络条件下,与最先进的协议相比,该机制在吞吐量和分组传输速率(PDR)方面的显著改进。仿真还表明,基于spt的机制在吞吐量方面优于基于mst的机制,但具有更高的树构建复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Tree-based multicast routing and channel assignment for enhanced throughout in emerging cognitive radio networks
In future multi-hop wireless networks like 5G and B5G, efficient large-scale video sharing and data dissemination are expected to rely heavily on multicast routing and Cognitive Radio (CR) technology. While multicast routing is efficient when the network always has access to the spectrum, the dynamic nature of Primary User (PU) activities, heterogeneous spectrum across the CR Network (CRN), and PU access priority make it challenging to implement efficient multicast routing protocols in CRNs. This paper proposes a hierarchical multicast routing mechanism for multi-hop CRNs that exploits the Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) concepts. The proposed multicast routing mechanism consists of tree construction and channel assignment algorithms. The tree-construction algorithm models the network topology as a multicast tree rooted at the CR source and spanning all the CR nodes. Based on the constructed tree, the channel assignment algorithm employs the Probability Of Success (POS) metric to assign channels to the various layers defined by the constructed SPT or MST, ensuring that the most reliable channel is used for the multi-hop multicast transmissions. Simulation experiments are conducted to evaluate the mechanism’s effectiveness, revealing significant improvements in throughput and Packet Delivery Rate (PDR) compared to state-of-the-art protocols under different network conditions. The simulations also show that the SPT-based mechanism outperforms the MST-based mechanism in terms of throughput but has a higher tree construction complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信