Genetic algorithm and probability based routing protocol for Opportunistic Networks

D. Sharma, S. K. Dhurandher, M. Obaidat, Aman Bansal, Apoorv Gupta
{"title":"Genetic algorithm and probability based routing protocol for Opportunistic Networks","authors":"D. Sharma, S. K. Dhurandher, M. Obaidat, Aman Bansal, Apoorv Gupta","doi":"10.1109/CITS.2017.8035288","DOIUrl":null,"url":null,"abstract":"The random nature of network topology is a major challenge while developing new routing protocol for Opportunistic Networks (OppNets). Additionally, other factors like intermittent connections, limited bandwidth etc. further restrict the performance of existing routing protocols. In this paper, an advanced context aware routing protocol called GAP is proposed. The proposed protocol efficiently combines the benefits of Genetic Algorithm and Probabilistic Routing to route the message from the source to destination. The protocol uses the Genetic algorithm to predict the path a message would take if it is transferred to the neighbouring node. A Fitness function is defined to evaluate the efficiency of this predicted path. The message is transferred to the neighbouring node only if the fitness value of the predicted path is greater than a threshold value, which is calculated by implementing the concepts of probabilistic routing. Simulation results show that the GAP routing protocol outperforms Prophet, Spray and Wait and GAER protocol in terms of message delivery ratio, overhead ratio and average latency.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"32 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2017.8035288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The random nature of network topology is a major challenge while developing new routing protocol for Opportunistic Networks (OppNets). Additionally, other factors like intermittent connections, limited bandwidth etc. further restrict the performance of existing routing protocols. In this paper, an advanced context aware routing protocol called GAP is proposed. The proposed protocol efficiently combines the benefits of Genetic Algorithm and Probabilistic Routing to route the message from the source to destination. The protocol uses the Genetic algorithm to predict the path a message would take if it is transferred to the neighbouring node. A Fitness function is defined to evaluate the efficiency of this predicted path. The message is transferred to the neighbouring node only if the fitness value of the predicted path is greater than a threshold value, which is calculated by implementing the concepts of probabilistic routing. Simulation results show that the GAP routing protocol outperforms Prophet, Spray and Wait and GAER protocol in terms of message delivery ratio, overhead ratio and average latency.
基于遗传算法和概率的机会网络路由协议
网络拓扑结构的随机性是开发机会网络(OppNets)路由协议时面临的主要挑战。此外,其他因素,如间歇性连接,有限的带宽等,进一步限制了现有路由协议的性能。本文提出了一种高级的上下文感知路由协议GAP。该协议有效地结合了遗传算法和概率路由的优点,实现了消息从源路由到目的路由。该协议使用遗传算法来预测消息传输到相邻节点时将采取的路径。定义了适应度函数来评估该预测路径的效率。只有当预测路径的适应度值大于阈值时,消息才会传输到邻近节点,该阈值是通过实现概率路由的概念来计算的。仿真结果表明,GAP路由协议在消息传递率、开销率和平均延迟方面优于Prophet、Spray and Wait和GAER协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信