OPPRES: Opportunistic Routing algorithm for routing messages in emergency situations using vehicular delay tolerant network

M. Penurkar, U. Deshpande
{"title":"OPPRES: Opportunistic Routing algorithm for routing messages in emergency situations using vehicular delay tolerant network","authors":"M. Penurkar, U. Deshpande","doi":"10.1109/ANTS.2016.7947851","DOIUrl":null,"url":null,"abstract":"A vehicular delay tolerant network (VDTN) is a special type of delay tolerant network (DTN), in which vehicles act as mobile nodes that are carriers of the message. It is characterized by the absence of an end-to-end connectivity between the nodes residing at the extreme ends. The routing in VDTN is critical as nodes are not connected permanently and the goal is to complete the message delivery successfully. We propose an opportunistic Routing algorithm for Emerging Situations (OPPRES) using VDTN to route messages in the real world. OPPRES is based on a utility mechanism for routing messages in VDTN. The algorithm takes into account node's contact history recorded as a utility for forwarding the messages. This history comprises the past encounters of a node with the destination nodes or the relay nodes. The algorithm can be used to route the messages in emergency situations. Simulations show that, our algorithm OPPRES beat some existing DTN routing approaches like PRoPHET and Spray-and-Wait in terms of increased message delivery ratio and less average delivery latency at the cost of the large overhead ratio.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2016.7947851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A vehicular delay tolerant network (VDTN) is a special type of delay tolerant network (DTN), in which vehicles act as mobile nodes that are carriers of the message. It is characterized by the absence of an end-to-end connectivity between the nodes residing at the extreme ends. The routing in VDTN is critical as nodes are not connected permanently and the goal is to complete the message delivery successfully. We propose an opportunistic Routing algorithm for Emerging Situations (OPPRES) using VDTN to route messages in the real world. OPPRES is based on a utility mechanism for routing messages in VDTN. The algorithm takes into account node's contact history recorded as a utility for forwarding the messages. This history comprises the past encounters of a node with the destination nodes or the relay nodes. The algorithm can be used to route the messages in emergency situations. Simulations show that, our algorithm OPPRES beat some existing DTN routing approaches like PRoPHET and Spray-and-Wait in terms of increased message delivery ratio and less average delivery latency at the cost of the large overhead ratio.
OPPRES:利用车辆容忍延迟网络在紧急情况下路由消息的机会路由算法
车辆容忍延迟网络(VDTN)是一种特殊类型的容忍延迟网络(DTN),其中车辆作为移动节点是消息的载体。它的特点是位于两端的节点之间没有端到端连接。VDTN中的路由非常关键,因为节点不是永久连接的,其目标是成功地完成消息传递。我们提出了一种利用VDTN在现实世界中路由消息的机会路由算法(OPPRES)。OPPRES是基于VDTN中消息路由的实用机制。该算法考虑了节点的联系记录作为消息转发的实用工具。该历史记录包括一个节点与目标节点或中继节点的过往相遇。该算法可用于紧急情况下的消息路由。仿真结果表明,我们的OPPRES算法在提高消息传递率和减少平均传递延迟方面优于现有的一些DTN路由方法,如PRoPHET和Spray-and-Wait。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信