{"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}
引用次数: 1
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.