AN IMPLEMENTATION OF EFFICIENT PATH SELECTION METHOD FOR SUCCESSFUL DATA TRANSMISSION IN MOBILE AD HOC NETWORKS

Arjun Jadhaw, Vikrant Sharma
{"title":"AN IMPLEMENTATION OF EFFICIENT PATH SELECTION METHOD FOR SUCCESSFUL DATA TRANSMISSION IN MOBILE AD HOC NETWORKS","authors":"Arjun Jadhaw, Vikrant Sharma","doi":"10.51767/jc1205","DOIUrl":null,"url":null,"abstract":"Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.","PeriodicalId":408370,"journal":{"name":"BSSS Journal of Computer","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"BSSS Journal of Computer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.51767/jc1205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.
移动AD hoc网络中有效路径选择方法的实现
路由是将数据从已知源转发到目的地的过程。在这个过程中,数据可能会在一些中间路径上传输,并且需要选择最可能的最佳节点来转发数据。这种节点的最佳选择将允许在网络中实现高表示。在网络路由中寻找最佳路径,以提高网络路由的有效性,并消除网络中的拥挤问题,已经进行了大量的工作。一个好的路由算法应该能够找到最优路径,并且必须简单。它还必须具有低开销、健壮和稳定、快速收敛,并且必须保持灵活性。在MANET中,通过直接路径度量进行路由并不足以构建高质量的路径,因为最小跳数路由经常选择比网络中存在的最佳路径容量小得多的路由。在本文中,我们提出了一种基于吞吐量、PDR、能量消耗等多种度量来优选路由协议的机制。这些路径是相当丰富的。网络演示将通过使用这些路径来提高。利用网络模拟器ns-2进行了仿真,验证了该机制的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信