基于机器学习的无线网状网络节点预测转发

Jianjun Yang, Ju Shen, Mengyi Ying
{"title":"基于机器学习的无线网状网络节点预测转发","authors":"Jianjun Yang, Ju Shen, Mengyi Ying","doi":"10.14738/TNC.66.5653","DOIUrl":null,"url":null,"abstract":"As part of the next generation Internet, Wireless Mesh Networks have emerged as a key technology  to deliver Internet broadband access, wireless local area network coverage and network connectivity at low costs. The capacity of a wireless mesh network is improved by equipping mesh nodes with multi-radios tuned to non-overlapping channels. Hence the data forwarding between two nodes has multiple selections of links and the bandwidth between the pair of nodes varies dynamically. The new technology makes mesh nodes cognitive, thus a mesh node is able to adopt machine learning mechanisms to choose the possible best next hop which has maximum bandwidth when it intends to forward data. In this paper, we present a new forwarding algorithm by which a forwarding node dynamically select its next hop with highest potential bandwidth capacity to resume communication based on learning algorithm.  The efficiency of this approach is that a node only maintains three past status, and then it is able to learn and predict the potential bandwidth capacities of its links. Then, the node selects the next hop with potential maximal link bandwidth. Additionally, a geometrical based algorithm is developed to let the forwarding node figure out the best forwarding region in order to avoid flooding. Simulations demonstrate that our approach significantly outperforms peer algorithms.","PeriodicalId":448328,"journal":{"name":"Transactions on Networks and Communications","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Forwarding with Prediction over Machine Learning based Nodes in Wireless Mesh Networks\",\"authors\":\"Jianjun Yang, Ju Shen, Mengyi Ying\",\"doi\":\"10.14738/TNC.66.5653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As part of the next generation Internet, Wireless Mesh Networks have emerged as a key technology  to deliver Internet broadband access, wireless local area network coverage and network connectivity at low costs. The capacity of a wireless mesh network is improved by equipping mesh nodes with multi-radios tuned to non-overlapping channels. Hence the data forwarding between two nodes has multiple selections of links and the bandwidth between the pair of nodes varies dynamically. The new technology makes mesh nodes cognitive, thus a mesh node is able to adopt machine learning mechanisms to choose the possible best next hop which has maximum bandwidth when it intends to forward data. In this paper, we present a new forwarding algorithm by which a forwarding node dynamically select its next hop with highest potential bandwidth capacity to resume communication based on learning algorithm.  The efficiency of this approach is that a node only maintains three past status, and then it is able to learn and predict the potential bandwidth capacities of its links. Then, the node selects the next hop with potential maximal link bandwidth. Additionally, a geometrical based algorithm is developed to let the forwarding node figure out the best forwarding region in order to avoid flooding. Simulations demonstrate that our approach significantly outperforms peer algorithms.\",\"PeriodicalId\":448328,\"journal\":{\"name\":\"Transactions on Networks and Communications\",\"volume\":\"2011 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Networks and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14738/TNC.66.5653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Networks and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14738/TNC.66.5653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

作为下一代互联网的一部分,无线网状网络已经成为以低成本提供互联网宽带接入、无线局域网覆盖和网络连接的关键技术。通过在mesh节点上配置调谐到非重叠信道的多无线电,提高了无线mesh网络的容量。因此,两个节点之间的数据转发具有多种链路选择,并且对节点之间的带宽动态变化。新技术使网格节点具有认知能力,因此网格节点在转发数据时能够采用机器学习机制选择可能的最佳带宽最大的下一跳。本文提出了一种新的转发算法,该算法基于学习算法,转发节点动态选择潜在带宽容量最大的下一跳恢复通信。这种方法的效率在于一个节点只保持三个过去的状态,然后它就能够学习和预测其链路的潜在带宽容量。然后,节点选择链路带宽可能最大的下一跳。此外,提出了一种基于几何的算法,使转发节点能够找出最佳转发区域,以避免洪水泛滥。仿真表明,我们的方法明显优于同类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Forwarding with Prediction over Machine Learning based Nodes in Wireless Mesh Networks
As part of the next generation Internet, Wireless Mesh Networks have emerged as a key technology  to deliver Internet broadband access, wireless local area network coverage and network connectivity at low costs. The capacity of a wireless mesh network is improved by equipping mesh nodes with multi-radios tuned to non-overlapping channels. Hence the data forwarding between two nodes has multiple selections of links and the bandwidth between the pair of nodes varies dynamically. The new technology makes mesh nodes cognitive, thus a mesh node is able to adopt machine learning mechanisms to choose the possible best next hop which has maximum bandwidth when it intends to forward data. In this paper, we present a new forwarding algorithm by which a forwarding node dynamically select its next hop with highest potential bandwidth capacity to resume communication based on learning algorithm.  The efficiency of this approach is that a node only maintains three past status, and then it is able to learn and predict the potential bandwidth capacities of its links. Then, the node selects the next hop with potential maximal link bandwidth. Additionally, a geometrical based algorithm is developed to let the forwarding node figure out the best forwarding region in order to avoid flooding. Simulations demonstrate that our approach significantly outperforms peer algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信