通过动态路径分配提高多无线电多信道网络的性能和寿命

Paulo Alexandre Regis, S. Bhunia, S. Sengupta
{"title":"通过动态路径分配提高多无线电多信道网络的性能和寿命","authors":"Paulo Alexandre Regis, S. Bhunia, S. Sengupta","doi":"10.1109/ICCNC.2017.7876179","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel approach to assign paths to data streams in a mission-centric heterogeneous wireless mesh network where nodes have multi-channel radio interfaces. Different than conventional packet-switching routing, our approach assigns the paths using a link utility based on sub-topologies of non-orthogonal frequencies. We use a graph coloring algorithm to calculate the utility of each link. We then propose two path assignment strategies: (i) single path, where each data stream traverse a unique path, and (ii) split-path, where the flows can be divided into multiple paths. Results show no best strategy fits all scenarios. Instead, in different situations, different algorithms are better suited.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Enhancing performance and longevity of multi-radio multi-channel hetnets through dynamic path-assignment\",\"authors\":\"Paulo Alexandre Regis, S. Bhunia, S. Sengupta\",\"doi\":\"10.1109/ICCNC.2017.7876179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a novel approach to assign paths to data streams in a mission-centric heterogeneous wireless mesh network where nodes have multi-channel radio interfaces. Different than conventional packet-switching routing, our approach assigns the paths using a link utility based on sub-topologies of non-orthogonal frequencies. We use a graph coloring algorithm to calculate the utility of each link. We then propose two path assignment strategies: (i) single path, where each data stream traverse a unique path, and (ii) split-path, where the flows can be divided into multiple paths. Results show no best strategy fits all scenarios. Instead, in different situations, different algorithms are better suited.\",\"PeriodicalId\":135028,\"journal\":{\"name\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2017.7876179\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2017.7876179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们提出了一种在任务中心异构无线网状网络中为数据流分配路径的新方法,其中节点具有多通道无线电接口。与传统的分组交换路由不同,我们的方法使用基于非正交频率子拓扑的链路实用程序来分配路径。我们使用图形着色算法来计算每个链接的效用。然后,我们提出了两种路径分配策略:(i)单路径,其中每个数据流遍历一个唯一的路径;(ii)分离路径,其中流可以分为多个路径。结果表明,没有适合所有情况的最佳策略。相反,在不同的情况下,不同的算法更适合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhancing performance and longevity of multi-radio multi-channel hetnets through dynamic path-assignment
In this paper, we present a novel approach to assign paths to data streams in a mission-centric heterogeneous wireless mesh network where nodes have multi-channel radio interfaces. Different than conventional packet-switching routing, our approach assigns the paths using a link utility based on sub-topologies of non-orthogonal frequencies. We use a graph coloring algorithm to calculate the utility of each link. We then propose two path assignment strategies: (i) single path, where each data stream traverse a unique path, and (ii) split-path, where the flows can be divided into multiple paths. Results show no best strategy fits all scenarios. Instead, in different situations, different algorithms are better suited.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信