基于q -学习的自组织网络路由算法设计与仿真

Yuejia Dou, Huilin Liu, Liangkang Wei, Shiyou Chen
{"title":"基于q -学习的自组织网络路由算法设计与仿真","authors":"Yuejia Dou, Huilin Liu, Liangkang Wei, Shiyou Chen","doi":"10.23919/APNOMS50412.2020.9237020","DOIUrl":null,"url":null,"abstract":"With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Therefore, mobile wireless communication methods have attracted more and more attention. Due to its dynamic topology and self-organizing without center, the self-organizing network can form a mobile temporary multi-hop mobile communication network through multiple wireless communication devices, which can well meet the above requirements. At present, research on self-organizing networks mainly focuses on routing protocols. The main types are based on network topology information and location information. This paper designs a routing algorithm based on link reliability. The algorithm fully considers the self-organizing network link information, and models the node's sending and receiving work as a Markov decision process, and uses Q-learning to demodulate. This article used NS2 for network simulation and analysis and comparison of performance indicators with traditional routing algorithms.","PeriodicalId":122940,"journal":{"name":"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"302 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Design and simulation of self-organizing network routing algorithm based on Q-learning\",\"authors\":\"Yuejia Dou, Huilin Liu, Liangkang Wei, Shiyou Chen\",\"doi\":\"10.23919/APNOMS50412.2020.9237020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Therefore, mobile wireless communication methods have attracted more and more attention. Due to its dynamic topology and self-organizing without center, the self-organizing network can form a mobile temporary multi-hop mobile communication network through multiple wireless communication devices, which can well meet the above requirements. At present, research on self-organizing networks mainly focuses on routing protocols. The main types are based on network topology information and location information. This paper designs a routing algorithm based on link reliability. The algorithm fully considers the self-organizing network link information, and models the node's sending and receiving work as a Markov decision process, and uses Q-learning to demodulate. This article used NS2 for network simulation and analysis and comparison of performance indicators with traditional routing algorithms.\",\"PeriodicalId\":122940,\"journal\":{\"name\":\"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"volume\":\"302 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/APNOMS50412.2020.9237020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 21st Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APNOMS50412.2020.9237020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着计算机网络通信技术的不断进步,传统的有线和无线网络受到电缆和基站的限制,在某些应用场景中已不适用。因此,移动无线通信方式越来越受到人们的重视。自组织网络由于具有动态拓扑结构和无中心自组织特性,可以通过多个无线通信设备组成移动临时多跳移动通信网络,很好地满足了上述要求。目前,对自组织网络的研究主要集中在路由协议方面。主要根据网络拓扑信息和位置信息进行分类。本文设计了一种基于链路可靠性的路由算法。该算法充分考虑了自组织网络链路信息,将节点的发送和接收工作建模为马尔可夫决策过程,并采用q学习进行解调。本文利用NS2进行网络仿真,并与传统路由算法的性能指标进行分析比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design and simulation of self-organizing network routing algorithm based on Q-learning
With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Therefore, mobile wireless communication methods have attracted more and more attention. Due to its dynamic topology and self-organizing without center, the self-organizing network can form a mobile temporary multi-hop mobile communication network through multiple wireless communication devices, which can well meet the above requirements. At present, research on self-organizing networks mainly focuses on routing protocols. The main types are based on network topology information and location information. This paper designs a routing algorithm based on link reliability. The algorithm fully considers the self-organizing network link information, and models the node's sending and receiving work as a Markov decision process, and uses Q-learning to demodulate. This article used NS2 for network simulation and analysis and comparison of performance indicators with traditional routing 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学术文献互助群
群 号:604180095
Book学术官方微信