城市车辆环境下最优网关布局与可靠互联网接入

Wiem Benrhaiem, A. Hafid, P. Sahu
{"title":"城市车辆环境下最优网关布局与可靠互联网接入","authors":"Wiem Benrhaiem, A. Hafid, P. Sahu","doi":"10.1109/LCN.2016.116","DOIUrl":null,"url":null,"abstract":"Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"241 1","pages":"662-670"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal Gateway Placement and Reliable Internet Access in Urban Vehicular Environments\",\"authors\":\"Wiem Benrhaiem, A. Hafid, P. Sahu\",\"doi\":\"10.1109/LCN.2016.116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.\",\"PeriodicalId\":6864,\"journal\":{\"name\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"volume\":\"241 1\",\"pages\":\"662-670\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2016.116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

车联网需要可靠的车际通信。由于无线通信信道在城市环境中具有很大的误差和损耗,因此这一要求具有挑战性。人们提出了许多将车辆连接到互联网的解决方案。然而,现有的多跳网关发现方案没有考虑到城市环境下广播的不可靠性问题。在本文中,我们的目标是找出到网关的最小通信跳数,具有非常高的可靠性(例如,97%)。为了实现这一点,我们将网关放置问题(称为GP)建模为k中心优化问题。我们用(2-1)降维技术在O(n^2*log(n))时间内解决了这个问题。我们利用M-HRB来发现到网关的可靠的多跳路径。仿真结果表明,与现有的解决方案相比,将M-HRB与GP结合使用可以提供更高的数据包接收速率和更小的端到端延迟。此外,我们的方案有效地利用了无线信道的带宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Gateway Placement and Reliable Internet Access in Urban Vehicular Environments
Internet of Vehicles requires reliable Inter-Vehicular communications. Such a requirement is challenging since the wireless communication channel is very erroneous and lossy in city environments. A lot of solutions for connecting vehicles to the internet have been proposed. However, existing multi-hop gateway discovery solutions do not consider, a key issue, the unreliability of broadcast in city environments. In this paper, our objective is to find out the minimum communication hops, with very high reliability (e.g., 97%), to gateways. To accomplish this, we model the gateway placement problem (called GP) as a k-center optimization problem. We solve it in O(n^2*log(n)) time using a (2-1) dimension reduction technique. We make use of M-HRB to discover reliable multi-hop paths to gateways. Simulation results demonstrate that applying M-HRB with GP provides high packet reception rate and generates smaller end-to-end delay compared to existing solutions. Furthermore, our proposal makes efficient use of wireless channel bandwidth.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the General Chair Message from the general chair Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management? TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1