基于t -检验程序的无线网络高效分组传输路由算法

{"title":"基于t -检验程序的无线网络高效分组传输路由算法","authors":"","doi":"10.33140/jsndc.03.01.01","DOIUrl":null,"url":null,"abstract":"One of the laborious communication tasks in a mobile ad hoc network is packet transmission. Due to the MANET node's power backup, many routing paths may experience unsuccessful packet delivery. The routing algorithm chooses the path that packets take as they travel from the source node to the destination nodes, but it makes no guarantees regarding packet delivery. In order to determine the most effective path between nodes, this paper proposed a new routing algorithm with the use of the T-test process. This suggested technique determines the best path between nodes for communication in a recursive manner, ensuring that each node participating in the route discovery has enough energy for transmission. The criteria for evaluating the nodes that are chosen and rejected throughout the route discovery process are defined and supported by the T-Test procedure. This technique, together with T-Test, supports effective packet transmission in MANET packet flow. It is also built with the help of network simulation and compared to the current routing protocol, demonstrating that it performs better overall.","PeriodicalId":91517,"journal":{"name":"International journal of sensor networks and data communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Routing Algorithm for Efficient Packet Transmission in Manet Using T–Test Procedure\",\"authors\":\"\",\"doi\":\"10.33140/jsndc.03.01.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the laborious communication tasks in a mobile ad hoc network is packet transmission. Due to the MANET node's power backup, many routing paths may experience unsuccessful packet delivery. The routing algorithm chooses the path that packets take as they travel from the source node to the destination nodes, but it makes no guarantees regarding packet delivery. In order to determine the most effective path between nodes, this paper proposed a new routing algorithm with the use of the T-test process. This suggested technique determines the best path between nodes for communication in a recursive manner, ensuring that each node participating in the route discovery has enough energy for transmission. The criteria for evaluating the nodes that are chosen and rejected throughout the route discovery process are defined and supported by the T-Test procedure. This technique, together with T-Test, supports effective packet transmission in MANET packet flow. It is also built with the help of network simulation and compared to the current routing protocol, demonstrating that it performs better overall.\",\"PeriodicalId\":91517,\"journal\":{\"name\":\"International journal of sensor networks and data communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of sensor networks and data communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33140/jsndc.03.01.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of sensor networks and data communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33140/jsndc.03.01.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

分组传输是移动自组网中最繁重的通信任务之一。由于MANET节点的电源备份,许多路由路径可能会经历不成功的数据包传递。路由算法选择数据包从源节点到目标节点的路径,但它不保证数据包的传递。为了确定节点间最有效的路径,本文提出了一种利用t检验过程的路由算法。该技术以递归的方式确定节点间的最佳通信路径,保证参与路由发现的每个节点都有足够的能量进行传输。评估在整个路由发现过程中被选择和拒绝的节点的标准由T-Test过程定义和支持。该技术与T-Test一起支持在MANET包流中有效的数据包传输。在网络仿真的帮助下构建了它,并与当前的路由协议进行了比较,证明了它的总体性能更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing Algorithm for Efficient Packet Transmission in Manet Using T–Test Procedure
One of the laborious communication tasks in a mobile ad hoc network is packet transmission. Due to the MANET node's power backup, many routing paths may experience unsuccessful packet delivery. The routing algorithm chooses the path that packets take as they travel from the source node to the destination nodes, but it makes no guarantees regarding packet delivery. In order to determine the most effective path between nodes, this paper proposed a new routing algorithm with the use of the T-test process. This suggested technique determines the best path between nodes for communication in a recursive manner, ensuring that each node participating in the route discovery has enough energy for transmission. The criteria for evaluating the nodes that are chosen and rejected throughout the route discovery process are defined and supported by the T-Test procedure. This technique, together with T-Test, supports effective packet transmission in MANET packet flow. It is also built with the help of network simulation and compared to the current routing protocol, demonstrating that it performs better overall.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信