A* search based next hop selection for routing in opportunistic networks

Pragya Kuchhal, S. K. Dhurandher, S. J. Borah, I. Woungang, Satbir Jain, Sahil Gupta
{"title":"A* search based next hop selection for routing in opportunistic networks","authors":"Pragya Kuchhal, S. K. Dhurandher, S. J. Borah, I. Woungang, Satbir Jain, Sahil Gupta","doi":"10.1504/IJSSC.2017.10010065","DOIUrl":null,"url":null,"abstract":"Opportunistic network (oppnet) is one of the challenging fields of wireless network. It is an intermittently connected mobile network where nodes are mobile and no end-to-end path exists. Connectivity among nodes is established when they are within the transmission range of each other. If a node has message to communicate and no intermediate node is available, then the message is stored in the node's buffer till an appropriate communication opportunity arises which is known as store-carry-forward paradigm. This paradigm has given Oppnets a new direction in the field of research. In any network, efficient and effective routing is very crucial. In this paper, a novel routing technique has been proposed for Oppnets named as A* based opportunistic routing (A*OR) which uses the A* searching technique to select the best forwarders towards the destination. The proposed protocol is compared with prophet, PRoWait and EDR as a benchmark protocols and is found to perform 19%, 11% and 32% better than prophet, PRoWait and EDR, respectively in terms of delivery probability.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Space-Based and Situated Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSC.2017.10010065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Opportunistic network (oppnet) is one of the challenging fields of wireless network. It is an intermittently connected mobile network where nodes are mobile and no end-to-end path exists. Connectivity among nodes is established when they are within the transmission range of each other. If a node has message to communicate and no intermediate node is available, then the message is stored in the node's buffer till an appropriate communication opportunity arises which is known as store-carry-forward paradigm. This paradigm has given Oppnets a new direction in the field of research. In any network, efficient and effective routing is very crucial. In this paper, a novel routing technique has been proposed for Oppnets named as A* based opportunistic routing (A*OR) which uses the A* searching technique to select the best forwarders towards the destination. The proposed protocol is compared with prophet, PRoWait and EDR as a benchmark protocols and is found to perform 19%, 11% and 32% better than prophet, PRoWait and EDR, respectively in terms of delivery probability.
机会网络中基于A*搜索的下一跳选择
机会网络(oppnet)是无线网络中具有挑战性的领域之一。它是一种间歇连接的移动网络,节点是移动的,不存在端到端路径。当节点之间处于彼此的传输范围内时,建立节点间的连通性。如果一个节点有消息要通信,并且没有中间节点可用,那么该消息将存储在节点的缓冲区中,直到出现适当的通信机会,这被称为存储-前转范式。这一范式为Oppnets在研究领域提供了一个新的方向。在任何网络中,高效的路由都是至关重要的。本文提出了一种新的Oppnets路由技术,称为基于a *的机会路由(a *OR),它使用a *搜索技术来选择到目的地的最佳转发器。将提出的协议与prophet、PRoWait和EDR作为基准协议进行比较,发现在交付概率上分别比prophet、PRoWait和EDR高19%、11%和32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Space-Based and Situated Computing
International Journal of Space-Based and Situated Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-
自引率
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学术官方微信