基于GPSR的车辆自组织网络链路可用时间预测

Haojun Yang, Ming Yu, Xuming Zeng
{"title":"基于GPSR的车辆自组织网络链路可用时间预测","authors":"Haojun Yang, Ming Yu, Xuming Zeng","doi":"10.1109/ICNSC.2017.8000107","DOIUrl":null,"url":null,"abstract":"Vehicle mobile ad-hoc networks (VANETs) are becoming the mainstream of network research in these days. Researches have been carried out from many aspects. However, due to the limitation of the characteristics of VANETs, the implementation in real-world still requires much effort to overcome the shortcomings to guarantee a reliable link and efficient data delivery. In the paper, we present an improved scheme based on the well-known position-based routing protocol greedy perimeter stateless routing (GPSR). Taking the advantages of GPSR, we preserve the core algorithm of GPSR, and then introduce the link available time (LAT) prediction into the next hop selection of GPSR, instead of simply using a greedy forwarding algorithm. LAT prediction is only decided by the measurable variables within a predefined time interval. Next, we establish a matrix based on the LAT and geographic progress to the next hop to decide which node should be the next hop for relaying. Finally, the simulation results are given to demonstrate the improvement in aspects of delay time, package delivery ratio, hop-count, etc.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Link available time prediction based GPSR for vehicular ad hoc networks\",\"authors\":\"Haojun Yang, Ming Yu, Xuming Zeng\",\"doi\":\"10.1109/ICNSC.2017.8000107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle mobile ad-hoc networks (VANETs) are becoming the mainstream of network research in these days. Researches have been carried out from many aspects. However, due to the limitation of the characteristics of VANETs, the implementation in real-world still requires much effort to overcome the shortcomings to guarantee a reliable link and efficient data delivery. In the paper, we present an improved scheme based on the well-known position-based routing protocol greedy perimeter stateless routing (GPSR). Taking the advantages of GPSR, we preserve the core algorithm of GPSR, and then introduce the link available time (LAT) prediction into the next hop selection of GPSR, instead of simply using a greedy forwarding algorithm. LAT prediction is only decided by the measurable variables within a predefined time interval. Next, we establish a matrix based on the LAT and geographic progress to the next hop to decide which node should be the next hop for relaying. Finally, the simulation results are given to demonstrate the improvement in aspects of delay time, package delivery ratio, hop-count, etc.\",\"PeriodicalId\":145129,\"journal\":{\"name\":\"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC.2017.8000107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC.2017.8000107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

车载移动自组网(vanet)正在成为当今网络研究的主流。研究从多个方面展开。然而,由于VANETs自身特性的限制,在实际应用中,为了保证可靠的链路和高效的数据传输,还需要付出很大的努力来克服这些缺点。本文提出了一种基于位置路由协议贪婪周界无状态路由(GPSR)的改进方案。利用GPSR的优点,保留GPSR的核心算法,并将链路可用时间(LAT)预测引入GPSR的下一跳选择中,而不是简单地使用贪婪转发算法。LAT预测仅由预定义时间间隔内的可测量变量决定。接下来,我们根据LAT和到下一跳的地理进展建立一个矩阵来决定哪个节点应该是下一跳进行中继。最后给出了仿真结果,验证了该方法在延迟时间、包投递率、跳数等方面的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link available time prediction based GPSR for vehicular ad hoc networks
Vehicle mobile ad-hoc networks (VANETs) are becoming the mainstream of network research in these days. Researches have been carried out from many aspects. However, due to the limitation of the characteristics of VANETs, the implementation in real-world still requires much effort to overcome the shortcomings to guarantee a reliable link and efficient data delivery. In the paper, we present an improved scheme based on the well-known position-based routing protocol greedy perimeter stateless routing (GPSR). Taking the advantages of GPSR, we preserve the core algorithm of GPSR, and then introduce the link available time (LAT) prediction into the next hop selection of GPSR, instead of simply using a greedy forwarding algorithm. LAT prediction is only decided by the measurable variables within a predefined time interval. Next, we establish a matrix based on the LAT and geographic progress to the next hop to decide which node should be the next hop for relaying. Finally, the simulation results are given to demonstrate the improvement in aspects of delay time, package delivery ratio, hop-count, etc.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信