EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks

S. K. Dhurandher, S. J. Borah, I. Woungang, D. Sharma, Kunal Arora, Divyansh Agarwal
{"title":"EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks","authors":"S. K. Dhurandher, S. J. Borah, I. Woungang, D. Sharma, Kunal Arora, Divyansh Agarwal","doi":"10.1109/AINA.2016.15","DOIUrl":null,"url":null,"abstract":"In an Opportunistic Network (Oppnet), the transmission of messages between mobile devices is achieved in a store-carry-and-forward fashion since nodes store the incoming messages in their buffer and wait until a suitable next hop node is encountered that can carry the message closer to the destination. In such environment, due to the delay-tolerant nature of the network, designing a routing protocol is a challenge. This paper proposes a novel routing protocol called Encounter and Distance based Routing (EDR), which utilizes the so-called forward parameter to determine the next hop selection. This parameter is calculated by taking into account the number of encounters and the distance of each node in the network with respect to a particular destination. Simulation results are provided, showing the superiority of EDR over the History based Prediction for Routing (HBPR) protocol and the ProWait protocol, chosen as benchmark schemes, in terms of hop count, messages dropped, and average latency.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2016.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

Abstract

In an Opportunistic Network (Oppnet), the transmission of messages between mobile devices is achieved in a store-carry-and-forward fashion since nodes store the incoming messages in their buffer and wait until a suitable next hop node is encountered that can carry the message closer to the destination. In such environment, due to the delay-tolerant nature of the network, designing a routing protocol is a challenge. This paper proposes a novel routing protocol called Encounter and Distance based Routing (EDR), which utilizes the so-called forward parameter to determine the next hop selection. This parameter is calculated by taking into account the number of encounters and the distance of each node in the network with respect to a particular destination. Simulation results are provided, showing the superiority of EDR over the History based Prediction for Routing (HBPR) protocol and the ProWait protocol, chosen as benchmark schemes, in terms of hop count, messages dropped, and average latency.
机会网络中基于相遇和距离的路由协议
在机会网络(Oppnet)中,移动设备之间的消息传输是以存储-携带-转发的方式实现的,因为节点将传入的消息存储在它们的缓冲区中,并等待,直到遇到一个合适的下一跳节点,该节点可以将消息携带到离目的地更近的地方。在这种环境下,由于网络的容延迟特性,路由协议的设计是一个挑战。本文提出了一种新的路由协议,称为基于相遇和距离的路由(EDR),它利用所谓的转发参数来确定下一跳的选择。这个参数是通过考虑相遇次数和网络中每个节点相对于特定目的地的距离来计算的。仿真结果表明,EDR在跳数、丢弃消息和平均延迟方面优于基于历史的路由预测(HBPR)协议和ProWait协议作为基准方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信