{"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":"119 1","pages":"0"},"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\":\"119 1\",\"pages\":\"0\"},\"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}
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.