Throughout analysis of IEEE 802.11p-based multi-hop V2I communications

Ribal Atallah, Maurice J. Khabbaz, C. Assi
{"title":"Throughout analysis of IEEE 802.11p-based multi-hop V2I communications","authors":"Ribal Atallah, Maurice J. Khabbaz, C. Assi","doi":"10.1109/WoWMoM.2015.7158214","DOIUrl":null,"url":null,"abstract":"This paper revolves around the evaluation of the achievable throughput in the context of an IEEE 802.11p-based vehicular subnetwork scenario where a completely isolated source vehicle, S, desires to communicate with a distant stationary Roadside Internet Gateway (RIG), D. Multi-hop inter-vehicular communication is exploited for the purpose of establishing a path between S and D along which downstream cooperative vehicles serve intermediate packet relays. The formation of such a path is governed by the vehicular traffic behaviour as well as the per-hop contention-oriented data forwarding process. Following the formation of a continuous chain of in-range cooperative vehicles between an arbitrary source-destination pair (S,D), a stochastic analytical framework is developed with the objective of determining the probability of successful data transfer from S to D taking into account the per-hop vehicle contentions for channel access. Then, theoretical expressions for the achievable per-hop as well as the end-to-end throughput are presented. Simulations are conducted for purpose of validating the presented analysis and evaluating the considered subnetwork's performance.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM.2015.7158214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper revolves around the evaluation of the achievable throughput in the context of an IEEE 802.11p-based vehicular subnetwork scenario where a completely isolated source vehicle, S, desires to communicate with a distant stationary Roadside Internet Gateway (RIG), D. Multi-hop inter-vehicular communication is exploited for the purpose of establishing a path between S and D along which downstream cooperative vehicles serve intermediate packet relays. The formation of such a path is governed by the vehicular traffic behaviour as well as the per-hop contention-oriented data forwarding process. Following the formation of a continuous chain of in-range cooperative vehicles between an arbitrary source-destination pair (S,D), a stochastic analytical framework is developed with the objective of determining the probability of successful data transfer from S to D taking into account the per-hop vehicle contentions for channel access. Then, theoretical expressions for the achievable per-hop as well as the end-to-end throughput are presented. Simulations are conducted for purpose of validating the presented analysis and evaluating the considered subnetwork's performance.
基于IEEE 802.11p的多跳V2I通信的全面分析
本文围绕基于IEEE 802.11p的车辆子网场景中可实现吞吐量的评估展开,在该场景中,完全隔离的源车辆S希望与远处固定的路边互联网网关(RIG) D进行通信,利用多跳车间通信在S和D之间建立一条路径,下游合作车辆沿着该路径提供中间数据包中继。这种路径的形成受车辆交通行为和逐跳竞争数据转发过程的控制。在任意源-目的地对(S,D)之间形成连续的范围内合作车辆链之后,考虑到通道访问的每跳车辆竞争,开发了一个随机分析框架,以确定从S到D成功传输数据的概率。然后,给出了每跳可达吞吐量和端到端吞吐量的理论表达式。为了验证所提出的分析和评估所考虑的子网的性能,进行了仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信