Routing Protocol in Mobile Ad Hoc Networks based on Energy Consumption

Nishit Manishbhai Shah, H. El‐Ocla, Pearly Shah
{"title":"Routing Protocol in Mobile Ad Hoc Networks based on Energy Consumption","authors":"Nishit Manishbhai Shah, H. El‐Ocla, Pearly Shah","doi":"10.1109/ICCNS58795.2023.10193472","DOIUrl":null,"url":null,"abstract":"Due to the network’s resource limitations and its dynamic nature, routing in mobile ad hoc networks (MANETs) is one of the most difficult jobs. Ad hoc infrastructure and node mobility add to the network’s complexity and instability. Finding the desired path from source to destination using routing techniques becomes even hazier due to limited radio range communication and dynamic topology. Numerous studies offer a wide range of techniques for transferring data from one place to another. In this paper, we have taken the energy of the nodes and the distance between the nodes as key components in deciding whether the route established with these components is appropriate or not. We are using the ad hoc on-demand multipath distance vector (AOMDV) protocol which is considered one of the most effective reactive routing techniques to deal with the unpredictability of the routing path in MANETs. Along with that, we propose a genetic algorithm-based new protocol that will provide the most energy-efficient path by considering the least distance between nodes with the help of mutation and crossover. Lastly, the proposed protocol results are compared with existing routing protocols like AOMDV and DSR. We have used routing overhead, end-to-end delay, throughput, energy consumption, and packet delivery ratio as key metrics for the performance evaluation of our proposed model.","PeriodicalId":158016,"journal":{"name":"2023 International Conference on Intelligent Computing, Communication, Networking and Services (ICCNS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Intelligent Computing, Communication, Networking and Services (ICCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNS58795.2023.10193472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the network’s resource limitations and its dynamic nature, routing in mobile ad hoc networks (MANETs) is one of the most difficult jobs. Ad hoc infrastructure and node mobility add to the network’s complexity and instability. Finding the desired path from source to destination using routing techniques becomes even hazier due to limited radio range communication and dynamic topology. Numerous studies offer a wide range of techniques for transferring data from one place to another. In this paper, we have taken the energy of the nodes and the distance between the nodes as key components in deciding whether the route established with these components is appropriate or not. We are using the ad hoc on-demand multipath distance vector (AOMDV) protocol which is considered one of the most effective reactive routing techniques to deal with the unpredictability of the routing path in MANETs. Along with that, we propose a genetic algorithm-based new protocol that will provide the most energy-efficient path by considering the least distance between nodes with the help of mutation and crossover. Lastly, the proposed protocol results are compared with existing routing protocols like AOMDV and DSR. We have used routing overhead, end-to-end delay, throughput, energy consumption, and packet delivery ratio as key metrics for the performance evaluation of our proposed model.
基于能耗的移动Ad Hoc网络路由协议
由于网络的资源限制和动态特性,移动自组网(manet)中的路由是最困难的工作之一。自组织基础设施和节点移动性增加了网络的复杂性和不稳定性。由于有限的无线电范围通信和动态拓扑结构,使用路由技术寻找从源到目的地的所需路径变得更加模糊。许多研究提供了从一个地方到另一个地方传输数据的广泛技术。在本文中,我们将节点的能量和节点之间的距离作为决定用这些分量建立的路由是否合适的关键分量。我们正在使用自组织的按需多路径距离矢量(AOMDV)协议,该协议被认为是最有效的响应路由技术之一,用于处理manet中路由路径的不可预测性。同时,我们提出了一种基于遗传算法的新协议,该协议通过突变和交叉来考虑节点之间的最小距离,从而提供最节能的路径。最后,将所提协议的结果与AOMDV、DSR等现有路由协议进行了比较。我们使用路由开销、端到端延迟、吞吐量、能耗和数据包传送率作为我们所提出模型的性能评估的关键指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书