基于Garson剪枝递归神经网络和MSO模型的多路径路由的高效稳定节点选择

R. Hemalatha, R. Umamaheswari, S. Jothi
{"title":"基于Garson剪枝递归神经网络和MSO模型的多路径路由的高效稳定节点选择","authors":"R. Hemalatha, R. Umamaheswari, S. Jothi","doi":"10.1002/cpe.7105","DOIUrl":null,"url":null,"abstract":"In mobile ad hoc network, the routing task is considered to be more complicated issue. In order to find efficient route in MANET, the positions of each stable node in the network is identified initially. The main contribution of this paper is to identify the locations of neighboring nodes in MANET for the establishment of multi path routing in diverse mobility patterns. It also handles packet scheduling to balance the load as well as data forwarding with less communication time. The proposed work explains four phases such as stable node prediction, stability determination, route exploration, and packet dissemination. At first, the stable nodes are identified using recurrent neural network along with modified seagull optimization approach. By means of Garson's pruning based recurrent neural network accompanied with modified sea gull optimization (RMSG) algorithm, the stable neighbors are chosen. The network routing is formed by interconnecting the stable nodes from the source to the destination. When a routing link failure happens, the route recovery process will be initiated. Thus, the data packets are broadcasted in multi‐paths without any intervention. The measures namely packet delivery ratio, throughput, end‐to‐end delay, routing overhead, optimal path selection, and energy consumption are utilized to evaluate the performance of proposed approach. The experimental analysis proved that the proposed approach well performed than other compared existing approaches.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"50 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An efficient stable node selection based on Garson's pruned recurrent neural network and MSO model for multipath routing in MANET\",\"authors\":\"R. Hemalatha, R. Umamaheswari, S. Jothi\",\"doi\":\"10.1002/cpe.7105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In mobile ad hoc network, the routing task is considered to be more complicated issue. In order to find efficient route in MANET, the positions of each stable node in the network is identified initially. The main contribution of this paper is to identify the locations of neighboring nodes in MANET for the establishment of multi path routing in diverse mobility patterns. It also handles packet scheduling to balance the load as well as data forwarding with less communication time. The proposed work explains four phases such as stable node prediction, stability determination, route exploration, and packet dissemination. At first, the stable nodes are identified using recurrent neural network along with modified seagull optimization approach. By means of Garson's pruning based recurrent neural network accompanied with modified sea gull optimization (RMSG) algorithm, the stable neighbors are chosen. The network routing is formed by interconnecting the stable nodes from the source to the destination. When a routing link failure happens, the route recovery process will be initiated. Thus, the data packets are broadcasted in multi‐paths without any intervention. The measures namely packet delivery ratio, throughput, end‐to‐end delay, routing overhead, optimal path selection, and energy consumption are utilized to evaluate the performance of proposed approach. The experimental analysis proved that the proposed approach well performed than other compared existing approaches.\",\"PeriodicalId\":10584,\"journal\":{\"name\":\"Concurrency and Computation: Practice and Experience\",\"volume\":\"50 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation: Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/cpe.7105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在移动自组织网络中,路由任务被认为是一个更为复杂的问题。为了在MANET中找到有效的路由,首先对网络中每个稳定节点的位置进行初始识别。本文的主要贡献在于识别出MANET中相邻节点的位置,从而建立不同移动模式下的多路径路由。它还处理数据包调度以平衡负载以及用更少的通信时间进行数据转发。提出的工作解释了四个阶段:稳定节点预测、稳定性确定、路由探索和分组分发。首先利用递归神经网络和改进的海鸥优化方法对稳定节点进行识别。采用基于Garson剪枝的递归神经网络,结合改进的海鸥优化(RMSG)算法,选取稳定邻域。网络路由是由从源到目的的稳定节点相互连接而形成的。当路由链路发生故障时,将启动路由恢复过程。因此,数据包在没有任何干预的情况下以多路径广播。利用数据包传送率、吞吐量、端到端延迟、路由开销、最优路径选择和能耗等指标来评估所提方法的性能。实验分析表明,该方法的性能优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An efficient stable node selection based on Garson's pruned recurrent neural network and MSO model for multipath routing in MANET
In mobile ad hoc network, the routing task is considered to be more complicated issue. In order to find efficient route in MANET, the positions of each stable node in the network is identified initially. The main contribution of this paper is to identify the locations of neighboring nodes in MANET for the establishment of multi path routing in diverse mobility patterns. It also handles packet scheduling to balance the load as well as data forwarding with less communication time. The proposed work explains four phases such as stable node prediction, stability determination, route exploration, and packet dissemination. At first, the stable nodes are identified using recurrent neural network along with modified seagull optimization approach. By means of Garson's pruning based recurrent neural network accompanied with modified sea gull optimization (RMSG) algorithm, the stable neighbors are chosen. The network routing is formed by interconnecting the stable nodes from the source to the destination. When a routing link failure happens, the route recovery process will be initiated. Thus, the data packets are broadcasted in multi‐paths without any intervention. The measures namely packet delivery ratio, throughput, end‐to‐end delay, routing overhead, optimal path selection, and energy consumption are utilized to evaluate the performance of proposed approach. The experimental analysis proved that the proposed approach well performed than other compared existing approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Time‐based DDoS attack detection through hybrid LSTM‐CNN model architectures: An investigation of many‐to‐one and many‐to‐many approaches Distributed low‐latency broadcast scheduling for multi‐channel duty‐cycled wireless IoT networks Open‐domain event schema induction via weighted attentive hypergraph neural network Fused GEMMs towards an efficient GPU implementation of the ADER‐DG method in SeisSol Simulation method for infrared radiation transmission characteristics of typical ship targets based on optical remote sensing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1