基于位置的城市环境路由协议

Hamdi Idjmayyel, B. Qazi, J. Elmirghani
{"title":"基于位置的城市环境路由协议","authors":"Hamdi Idjmayyel, B. Qazi, J. Elmirghani","doi":"10.1109/NGMAST.2010.43","DOIUrl":null,"url":null,"abstract":"Recently, Vehicular ad hoc networks (VANETs) have started receiving significant attention from both academia and industry. In order to support safety related applications in delay tolerant networks, the design of an efficient routing protocol for VANETs is extremely crucial. The main requirement for all routing protocols is to achieve minimum delay with minimum consumption of network resources. In this paper we propose a position-based routing algorithm namely position-based routing with Most Forward within Radius (PRMFR) which clearly enhances the performance of the system compared to flooding based routing protocols such as epidemic routing in terms of packet dropping probability and the total number of transmissions. Position based routing protocols are known to use the node’s geographical locations in order to initiate a route between the source and the destination. Moreover, we introduce a percentage of greedy nodes to both protocols, and study their impact on the performance. Furthermore, a 3x3 km Manhattan mobility model is presented to examine the performance of our scheme.","PeriodicalId":184193,"journal":{"name":"2010 Fourth International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Position Based Routing Protocol for a City Environment\",\"authors\":\"Hamdi Idjmayyel, B. Qazi, J. Elmirghani\",\"doi\":\"10.1109/NGMAST.2010.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Vehicular ad hoc networks (VANETs) have started receiving significant attention from both academia and industry. In order to support safety related applications in delay tolerant networks, the design of an efficient routing protocol for VANETs is extremely crucial. The main requirement for all routing protocols is to achieve minimum delay with minimum consumption of network resources. In this paper we propose a position-based routing algorithm namely position-based routing with Most Forward within Radius (PRMFR) which clearly enhances the performance of the system compared to flooding based routing protocols such as epidemic routing in terms of packet dropping probability and the total number of transmissions. Position based routing protocols are known to use the node’s geographical locations in order to initiate a route between the source and the destination. Moreover, we introduce a percentage of greedy nodes to both protocols, and study their impact on the performance. Furthermore, a 3x3 km Manhattan mobility model is presented to examine the performance of our scheme.\",\"PeriodicalId\":184193,\"journal\":{\"name\":\"2010 Fourth International Conference on Next Generation Mobile Applications, Services and Technologies\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Fourth International Conference on Next Generation Mobile Applications, Services and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGMAST.2010.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Fourth International Conference on Next Generation Mobile Applications, Services and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGMAST.2010.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

最近,车辆自组织网络(VANETs)开始受到学术界和工业界的广泛关注。为了支持容延迟网络中与安全相关的应用,设计一种高效的VANETs路由协议至关重要。所有路由协议的主要要求是在最小的网络资源消耗下实现最小的延迟。本文提出了一种基于位置的路由算法,即基于位置的最转发半径路由(PRMFR),该算法在丢包概率和传输总数方面明显优于基于泛洪的路由协议,如流行病路由。众所周知,基于位置的路由协议使用节点的地理位置来在源和目的地之间发起路由。此外,我们在两种协议中都引入了一定比例的贪婪节点,并研究了它们对性能的影响。此外,提出了一个3x3公里的曼哈顿交通模型来检验我们的方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Position Based Routing Protocol for a City Environment
Recently, Vehicular ad hoc networks (VANETs) have started receiving significant attention from both academia and industry. In order to support safety related applications in delay tolerant networks, the design of an efficient routing protocol for VANETs is extremely crucial. The main requirement for all routing protocols is to achieve minimum delay with minimum consumption of network resources. In this paper we propose a position-based routing algorithm namely position-based routing with Most Forward within Radius (PRMFR) which clearly enhances the performance of the system compared to flooding based routing protocols such as epidemic routing in terms of packet dropping probability and the total number of transmissions. Position based routing protocols are known to use the node’s geographical locations in order to initiate a route between the source and the destination. Moreover, we introduce a percentage of greedy nodes to both protocols, and study their impact on the performance. Furthermore, a 3x3 km Manhattan mobility model is presented to examine the performance of our scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信