首页 > 最新文献

2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)最新文献

英文 中文
MISO Secure Transmission with Imperfect Channel State Information 不完全信道状态信息的MISO安全传输
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288215
Huan-huan Song, H. Wen, Lin Hu, Zhengguang Zhang, Luping Zhang
In this paper, we study artificial noise (AN) assisted beamforming secure transmission system with imperfect main channel state information (CSI) between a friendly cooperative jammer (Oscar) and an authorized receiver (Bob). We deduce out the maximum secrecy rate of secure system and the corresponding optimal power allocation ratio between information signal and AN under the constraint of secrecy outage probability. For realistic security communication system, we use advanced back propagation neural network (BPNN) for channel estimation. The numerical results show that estimation error results in a decrease in secrecy rate, but BPNN channel estimator still can guarantee secure transmission. Analytical derivations and numerical simulations are presented to validate the correctness of obtained expressions.
本文研究了在友好合作干扰机(Oscar)和授权接收机(Bob)之间具有不完全主信道状态信息(CSI)的人工噪声(AN)辅助波束形成安全传输系统。在保密中断概率约束下,推导出了安全系统的最大保密率和相应的信息信号与AN的最优功率分配比。针对现实的安全通信系统,采用先进的反向传播神经网络(BPNN)进行信道估计。数值结果表明,估计误差会导致保密率降低,但BPNN信道估计器仍然可以保证传输的安全。通过解析推导和数值模拟验证了所得表达式的正确性。
{"title":"MISO Secure Transmission with Imperfect Channel State Information","authors":"Huan-huan Song, H. Wen, Lin Hu, Zhengguang Zhang, Luping Zhang","doi":"10.1109/VTCFall.2017.8288215","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288215","url":null,"abstract":"In this paper, we study artificial noise (AN) assisted beamforming secure transmission system with imperfect main channel state information (CSI) between a friendly cooperative jammer (Oscar) and an authorized receiver (Bob). We deduce out the maximum secrecy rate of secure system and the corresponding optimal power allocation ratio between information signal and AN under the constraint of secrecy outage probability. For realistic security communication system, we use advanced back propagation neural network (BPNN) for channel estimation. The numerical results show that estimation error results in a decrease in secrecy rate, but BPNN channel estimator still can guarantee secure transmission. Analytical derivations and numerical simulations are presented to validate the correctness of obtained expressions.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116108684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Coordination of Wheeled Mobile Robots for Unknown Moving Targets Interception 轮式移动机器人拦截未知运动目标的分布式协调
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288381
Kai Luo, Bin Hu, Z. Guan, Xuemin Shen
This paper investigates distributed coordination of a team of wheeled mobile robots for multiple moving targets interception over a convex domain. In order to successfully intercept potential intruders entering the mission domain from different orientations, mobile robots are dynamically deployed to monitor the whole area and track moving targets once they are detected at a certain location. Due to the lack of knowledge about the numbers and online dynamic models of targets, a time-varying priority function indicating the most probable area where these targets may appear is introduced to increase the chance of intercepting them. Meanwhile, a target switching mechanism is employed to decide when targets should be considered by each mobile robot for interception task. Based on this priority function, a novel distributed coverage control law is designed to guarantee that wheeled mobile robots asymptotically converge to their generalized Centroidal Voronoi Tessellation and minimize the cost function with respect to those moving targets. Simulation results are given to present the advantage of the proposed approach over traditional coverage control strategy.
研究了一组轮式移动机器人在凸域上拦截多个运动目标时的分布式协调问题。为了成功拦截从不同方向进入任务域的潜在入侵者,动态部署移动机器人对整个区域进行监控,并在某个位置检测到移动目标后对其进行跟踪。由于缺乏对目标数量和在线动态模型的了解,引入了一个时变的优先级函数来指示这些目标最可能出现的区域,以增加拦截它们的机会。同时,采用目标切换机制来决定每个移动机器人在拦截任务中应该考虑哪些目标。在此基础上,设计了一种新的分布式覆盖控制律,以保证轮式移动机器人渐近收敛于其广义质心Voronoi镶嵌,并使其相对于运动目标的代价函数最小。仿真结果表明,该方法优于传统的覆盖控制策略。
{"title":"Distributed Coordination of Wheeled Mobile Robots for Unknown Moving Targets Interception","authors":"Kai Luo, Bin Hu, Z. Guan, Xuemin Shen","doi":"10.1109/VTCFall.2017.8288381","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288381","url":null,"abstract":"This paper investigates distributed coordination of a team of wheeled mobile robots for multiple moving targets interception over a convex domain. In order to successfully intercept potential intruders entering the mission domain from different orientations, mobile robots are dynamically deployed to monitor the whole area and track moving targets once they are detected at a certain location. Due to the lack of knowledge about the numbers and online dynamic models of targets, a time-varying priority function indicating the most probable area where these targets may appear is introduced to increase the chance of intercepting them. Meanwhile, a target switching mechanism is employed to decide when targets should be considered by each mobile robot for interception task. Based on this priority function, a novel distributed coverage control law is designed to guarantee that wheeled mobile robots asymptotically converge to their generalized Centroidal Voronoi Tessellation and minimize the cost function with respect to those moving targets. Simulation results are given to present the advantage of the proposed approach over traditional coverage control strategy.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Novel Architecture for Information Sharing & Exchange between IoT Systems 一种物联网系统间信息共享与交换的新架构
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288358
Hui Zhang, Jing Dong
How to share and exchange information between heterogeneous IoT (Internet of Things) systems is a big problem in building smart cities. Based on general demand for information Sharing & Exchange between IoT systems, this paper proposed a novel system architecture and designed two kinds of deployment model for information Sharing & Exchange and workflows. It could provide unified guideline for building information Sharing & Exchange system between IoT application systems in smart cities.
如何在异构物联网系统之间共享和交换信息是建设智慧城市的一个大问题。基于物联网系统间信息共享与交换的普遍需求,提出了一种新的系统架构,设计了信息共享与交换和工作流两种部署模型。可为智慧城市物联网应用系统间信息共享交换系统的构建提供统一的指导。
{"title":"A Novel Architecture for Information Sharing & Exchange between IoT Systems","authors":"Hui Zhang, Jing Dong","doi":"10.1109/VTCFall.2017.8288358","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288358","url":null,"abstract":"How to share and exchange information between heterogeneous IoT (Internet of Things) systems is a big problem in building smart cities. Based on general demand for information Sharing & Exchange between IoT systems, this paper proposed a novel system architecture and designed two kinds of deployment model for information Sharing & Exchange and workflows. It could provide unified guideline for building information Sharing & Exchange system between IoT application systems in smart cities.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122489045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance of Spectrum Sensing Based on Absolute Value Cumulation in Laplacian Noise 拉普拉斯噪声中基于绝对值累积的频谱感知性能
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8287978
Yinghui Ye, Yongzhao Li, G. Lu, Fuhui Zhou, Hailin Zhang
Spectrum sensing based on absolute value cumulating (AVC sensing) has attracted much attention due to its effectiveness in the presence of Laplaican noise and simpleness of implementation. In this paper, we investigate its detection performance and optimal detection threshold. Specifically, based on the derived mean and variance of the test statistic, an accurate expression of the detection probability is given. Using the accurate expression, an optimization problem is formulated to minimize the total error rate of AVC sensing by optimizing the detection threshold with a constraint on false alarm probability, and the optimal detection threshold is derived. Numerical results are provided to support our work.
基于绝对值累积的频谱感知(AVC sensing)因其在拉普莱恩噪声存在下的有效性和实现简单而备受关注。本文研究了它的检测性能和最优检测阈值。具体地说,根据得到的检验统计量的均值和方差,给出了检测概率的精确表达式。利用精确表达式,在虚警概率约束下,通过优化检测阈值,推导出AVC传感总错误率最小的优化问题,并推导出最优检测阈值。数值结果支持了我们的工作。
{"title":"Performance of Spectrum Sensing Based on Absolute Value Cumulation in Laplacian Noise","authors":"Yinghui Ye, Yongzhao Li, G. Lu, Fuhui Zhou, Hailin Zhang","doi":"10.1109/VTCFall.2017.8287978","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8287978","url":null,"abstract":"Spectrum sensing based on absolute value cumulating (AVC sensing) has attracted much attention due to its effectiveness in the presence of Laplaican noise and simpleness of implementation. In this paper, we investigate its detection performance and optimal detection threshold. Specifically, based on the derived mean and variance of the test statistic, an accurate expression of the detection probability is given. Using the accurate expression, an optimization problem is formulated to minimize the total error rate of AVC sensing by optimizing the detection threshold with a constraint on false alarm probability, and the optimal detection threshold is derived. Numerical results are provided to support our work.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114102305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Theory and Design of a Direct Space-to-Information Converter for Rapid Detection of Interferer DoA 一种用于快速检测干扰DoA的直接空信转换器的理论与设计
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288041
Matthew Bajor, Tanbir Haque, John Wright, P. Kinget
A reconfigurable and scalable architecture called the Direct Space-to-Information Converter (DSIC) is presented for rapid and energy-efficient direction-of-arrival (DoA) finding. In conventional delay-and-sum beamformers (CBF), the tradeoff between scan time, resolution and energy consumption is fixed due to the Nyquist sampling theorem. To accurately detect the DoA of an interferer, many scan angles and complex energy intensive calculations are needed. In contrast, the proposed DSIC directly converts an incoming wavefront to spatial information and generates only a few compressed sensing (CS) measurements by forming random projections of the spatial signal consecutively in time. The DoA of the wavefront is then rapidly found from these CS measurements. The energy consumption of the DSIC is 16x lower than the CBF for a realistic scenario where the DoA of only one large interferer needs to be found. Compared to other recently proposed CS DoA finders, the DSIC delivers significant reconfigurability and scalability advantages especially when the number of interferers is unknown.
提出了一种可重构、可扩展的直接空间-信息转换器(DSIC)结构,用于快速、节能地寻找到达方向(DoA)。在传统的延迟和波束形成器(CBF)中,由于奈奎斯特采样定理,扫描时间、分辨率和能耗之间的权衡是固定的。为了准确地检测干扰源的方位,需要多种扫描角度和复杂的能量密集计算。相比之下,DSIC直接将输入波前转换为空间信息,并通过在时间上连续形成空间信号的随机投影,仅产生少量压缩感知(CS)测量。然后从这些CS测量中迅速找到波前的DoA。对于只需要找到一个大干扰的DoA的现实场景,DSIC的能耗比CBF低16倍。与最近提出的其他CS DoA检测器相比,DSIC具有显著的可重构性和可扩展性优势,特别是在干扰数量未知的情况下。
{"title":"Theory and Design of a Direct Space-to-Information Converter for Rapid Detection of Interferer DoA","authors":"Matthew Bajor, Tanbir Haque, John Wright, P. Kinget","doi":"10.1109/VTCFall.2017.8288041","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288041","url":null,"abstract":"A reconfigurable and scalable architecture called the Direct Space-to-Information Converter (DSIC) is presented for rapid and energy-efficient direction-of-arrival (DoA) finding. In conventional delay-and-sum beamformers (CBF), the tradeoff between scan time, resolution and energy consumption is fixed due to the Nyquist sampling theorem. To accurately detect the DoA of an interferer, many scan angles and complex energy intensive calculations are needed. In contrast, the proposed DSIC directly converts an incoming wavefront to spatial information and generates only a few compressed sensing (CS) measurements by forming random projections of the spatial signal consecutively in time. The DoA of the wavefront is then rapidly found from these CS measurements. The energy consumption of the DSIC is 16x lower than the CBF for a realistic scenario where the DoA of only one large interferer needs to be found. Compared to other recently proposed CS DoA finders, the DSIC delivers significant reconfigurability and scalability advantages especially when the number of interferers is unknown.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114374262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Bargaining-Based Power Allocation of Hybrid Green Cellular Networks with Energy Harvesting 基于讨价还价的能量收集混合绿色蜂窝网络功率分配
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288120
Lin Wang, Xing Zhang, Shuo Wang, Juwo Yang
In this paper, we investigate an energy harvesting and cooperation protocol in hybrid green cellular networks, where power beacons (PBs) overlaying with an uplink cellular network. PBs harvest renewable energy from the nature and then charge mobile terminals (MTs) with microwave power transfer in energy beamforming. The network is powered by green energy only. Owing to the space-time instability and non-uniformity of renewable energy, some PBs' energy may not be enough to support the communication. We propose a bargaining-based Green Energy Allocation Game (GEAG) and introduce a dual-level control architecture for implement green energy cooperation to improve the performance of the system. The optimal power allocation problem is solved by the Nash bargaining solution (NBS). Simulation results show that the proposed GEAG algorithm can achieve 84% gains of MT's average rate and 75% reductions of the outage probability over the conventional green energy cooperation scheme.
在本文中,我们研究了一种混合绿色蜂窝网络中的能量收集和合作协议,其中功率信标(PBs)与上行蜂窝网络重叠。PBs从自然界中获取可再生能源,然后在能量波束形成中利用微波功率传输给移动终端(mt)充电。该网络仅由绿色能源供电。由于可再生能源的时空不稳定性和非均匀性,一些PBs的能量可能不足以支持通信。提出了一种基于讨价还价的绿色能源分配博弈(GEAG),并引入了一种双层控制架构来实现绿色能源合作,以提高系统的性能。最优功率分配问题采用纳什议价解(NBS)求解。仿真结果表明,与传统的绿色能源合作方案相比,本文提出的GEAG算法可使MT平均率提高84%,中断概率降低75%。
{"title":"Bargaining-Based Power Allocation of Hybrid Green Cellular Networks with Energy Harvesting","authors":"Lin Wang, Xing Zhang, Shuo Wang, Juwo Yang","doi":"10.1109/VTCFall.2017.8288120","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288120","url":null,"abstract":"In this paper, we investigate an energy harvesting and cooperation protocol in hybrid green cellular networks, where power beacons (PBs) overlaying with an uplink cellular network. PBs harvest renewable energy from the nature and then charge mobile terminals (MTs) with microwave power transfer in energy beamforming. The network is powered by green energy only. Owing to the space-time instability and non-uniformity of renewable energy, some PBs' energy may not be enough to support the communication. We propose a bargaining-based Green Energy Allocation Game (GEAG) and introduce a dual-level control architecture for implement green energy cooperation to improve the performance of the system. The optimal power allocation problem is solved by the Nash bargaining solution (NBS). Simulation results show that the proposed GEAG algorithm can achieve 84% gains of MT's average rate and 75% reductions of the outage probability over the conventional green energy cooperation scheme.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122092274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Transmission Rate Maximization in Self-Backhauled Wireless Small Cell Networks 自回程无线小蜂窝网络的传输速率最大化
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288356
M. Lashgari, B. Maham, W. Saad
One key challenge in heterogeneous cellular networks is the presence of wireless backhaul links whose resources must be jointly allocated with those of the radio access network. In this paper, a novel approach for joint backhaul and radio resource allocation in a two-tier small cell network is proposed. The problem is formulated as a Stackelberg game, in which the macrocell base station (MBS) acts as a leader and overlaid picocell base stations (PBSs) as followers. In this game, the MBS maximizes its sum rate transmission by properly allocating the subcarriers over the backhaul links and the PBSs seek to maximize their transmission rate by allocating power and the subcarriers. A self- backhauling model and an orthogonal frequency allocation between the backhaul and the access links are adopted, in which the subcarrier allocation over the backhaul and the access links will be captured in the leader's and followers' optimization problems, respectively. The optimal power allocation problem is studied for the followers problem. Furthermore, the uniqueness of the Stackelberg equilibrium point is investigated. Simulation results show the effectiveness of the proposed algorithm which yields up to 14.2% and 24.9% transmission rate improvement compared to the baseline method.
异构蜂窝网络面临的一个关键挑战是无线回程链路的存在,其资源必须与无线接入网的资源共同分配。提出了一种两层小蜂窝网络中联合回传和无线资源分配的新方法。该问题被描述为一个Stackelberg博弈,其中宏蜂窝基站(MBS)作为领导者,覆盖的皮蜂窝基站(PBSs)作为追随者。在此博弈中,MBS通过合理分配回程链路上的子载波来最大化其总速率传输,PBSs通过分配功率和子载波来最大化其传输速率。采用自回程模型和回程与接入链路间的正交频率分配,将回程和接入链路上的子载波分配分别捕获到领导者和追随者的优化问题中。研究了follower问题的最优功率分配问题。进一步研究了Stackelberg平衡点的唯一性。仿真结果表明了该算法的有效性,与基准方法相比,传输速率分别提高了14.2%和24.9%。
{"title":"Transmission Rate Maximization in Self-Backhauled Wireless Small Cell Networks","authors":"M. Lashgari, B. Maham, W. Saad","doi":"10.1109/VTCFall.2017.8288356","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288356","url":null,"abstract":"One key challenge in heterogeneous cellular networks is the presence of wireless backhaul links whose resources must be jointly allocated with those of the radio access network. In this paper, a novel approach for joint backhaul and radio resource allocation in a two-tier small cell network is proposed. The problem is formulated as a Stackelberg game, in which the macrocell base station (MBS) acts as a leader and overlaid picocell base stations (PBSs) as followers. In this game, the MBS maximizes its sum rate transmission by properly allocating the subcarriers over the backhaul links and the PBSs seek to maximize their transmission rate by allocating power and the subcarriers. A self- backhauling model and an orthogonal frequency allocation between the backhaul and the access links are adopted, in which the subcarrier allocation over the backhaul and the access links will be captured in the leader's and followers' optimization problems, respectively. The optimal power allocation problem is studied for the followers problem. Furthermore, the uniqueness of the Stackelberg equilibrium point is investigated. Simulation results show the effectiveness of the proposed algorithm which yields up to 14.2% and 24.9% transmission rate improvement compared to the baseline method.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116592299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Impact of Varying Penetration Rate of Intelligent Routing Capabilities on Vehicular Traffic Flow 智能路由能力渗透率变化对车辆交通流的影响
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288307
Christian Backfrieder, Manuel Lindorfer, C. Mecklenbräuker, G. Ostermayer
Beyond question, the improvement of traffic flow is a hot topic in current research, and numerous proposals how to optimize traffic on the roads exist. Distributed communication systems have come up recently as a very important mechanism in modern road networks in order to deal with this issue. Also, traffic delay problems due to jams are manifesting in many of the urban centers worldwide. With the objective of decreasing and in the best case avoiding congestion, V2X communication is exploited in order to counteract traffic jams by intelligent rerouting. Notwithstanding, the transition from very low penetration rates of vehicles that are equipped with communication functionality to a situation where basically all vehicles have the capability to send and receive information will not be made overnight. To a greater degree, the penetration of connected vehicles will increase more and more, which further will result in a very long period of mixed composition. This paper focuses on the analysis of a variable ratio of vehicles with routing and communication capabilities to those who are not. It analyzes the performance of a predictive rerouting algorithm when a distinct percentage of vehicles is unable to communicate for distinct traffic densities, and proves by simulations that even penetration rates far from a hundred percent lead to an improvement of the average time and fuel consumption as well as CO2 emissions per vehicle.
毫无疑问,交通流的改善是当前研究的热点问题,关于如何优化道路交通的建议很多。为了解决这一问题,分布式通信系统作为一种重要的机制在现代道路网络中应运而生。此外,由于交通堵塞导致的交通延误问题在全球许多城市中心都很明显。为了减少并在最好的情况下避免拥堵,V2X通信被利用来通过智能重路由来抵消交通拥堵。尽管如此,从配备通信功能的车辆普及率非常低到基本上所有车辆都有能力发送和接收信息的情况的转变不会在一夜之间完成。在更大程度上,互联汽车的渗透率将越来越高,这将进一步导致很长一段时间的混合构成。本文的重点是分析具有路由和通信能力的车辆与不具有路由和通信能力的车辆的可变比率。它分析了一种预测改道算法在一定比例的车辆因不同的交通密度而无法通信时的性能,并通过模拟证明,即使渗透率远低于100%,也会导致每辆车的平均时间、燃料消耗和二氧化碳排放的改善。
{"title":"Impact of Varying Penetration Rate of Intelligent Routing Capabilities on Vehicular Traffic Flow","authors":"Christian Backfrieder, Manuel Lindorfer, C. Mecklenbräuker, G. Ostermayer","doi":"10.1109/VTCFall.2017.8288307","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288307","url":null,"abstract":"Beyond question, the improvement of traffic flow is a hot topic in current research, and numerous proposals how to optimize traffic on the roads exist. Distributed communication systems have come up recently as a very important mechanism in modern road networks in order to deal with this issue. Also, traffic delay problems due to jams are manifesting in many of the urban centers worldwide. With the objective of decreasing and in the best case avoiding congestion, V2X communication is exploited in order to counteract traffic jams by intelligent rerouting. Notwithstanding, the transition from very low penetration rates of vehicles that are equipped with communication functionality to a situation where basically all vehicles have the capability to send and receive information will not be made overnight. To a greater degree, the penetration of connected vehicles will increase more and more, which further will result in a very long period of mixed composition. This paper focuses on the analysis of a variable ratio of vehicles with routing and communication capabilities to those who are not. It analyzes the performance of a predictive rerouting algorithm when a distinct percentage of vehicles is unable to communicate for distinct traffic densities, and proves by simulations that even penetration rates far from a hundred percent lead to an improvement of the average time and fuel consumption as well as CO2 emissions per vehicle.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129600952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The Multi-Cast Packet Loss in Mobile Ad-Hoc Networks 移动Ad-Hoc网络中的多播丢包
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288169
Siyang Liu, Jingchao Wang, Xiaoying Gan, Xiaohua Tian
In the last two decades, Multi-Cast schemes in mobile ad-hoc networks have been widely studied and lots of research results have been put into use and changed our everyday life. However, packet loss for Multi-Cast schemes in mobile ad-hoc networks has not been well studied yet. The influence of node density and relay schemes on packet loss is not clear. Thus, we study the packet loss problem for Multi-Cast schemes in MANETs in this paper. First, we present a general Multi-Cast probabilistic model to get a better understanding of the packet loss problem. Second, based on the general model and Chernoff Bounds, we prove that the upper bound of the general packet loss for Multi-Cast is $Omega(me^{-frac{n}{2}})$, where $n$ is the node number and 𝓂 denotes number of hops. Thus we can conclude that large node density decreases the packet loss rate by exponential factor, and bigger hops increase packet loss rate linearly. In addition, we present a reliable Multi-Cast protocol(RMP). Through an emph{ACK Aware Tree} to complete packet acknowledgement and repair host selection, RMP is able to minimize the impact of packet loss on the Multi-Cast throughput in the simulation.
近二十年来,移动自组织网络中的多播方案得到了广泛的研究,许多研究成果已经投入使用,改变了我们的日常生活。然而,对于移动自组网中多播方案的丢包问题,目前还没有很好的研究。节点密度和中继方案对丢包的影响尚不清楚。因此,本文研究了多播无线网络中的丢包问题。首先,我们提出了一个通用的多播概率模型,以便更好地理解丢包问题。其次,根据一般模型和Chernoff边界,证明了Multi-Cast的一般丢包上限为$Omega(me^{-frac{n}{2}})$,其中$n$为节点数,𝓂为跳数。由此可知,节点密度越大,丢包率呈指数因子降低,跳数越大,丢包率呈线性增加。此外,我们提出了一个可靠的多播协议(RMP)。RMP通过emph{ACK感知树}完成报文确认和修复主机选择,使丢包对多播吞吐量的影响最小化。
{"title":"The Multi-Cast Packet Loss in Mobile Ad-Hoc Networks","authors":"Siyang Liu, Jingchao Wang, Xiaoying Gan, Xiaohua Tian","doi":"10.1109/VTCFall.2017.8288169","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288169","url":null,"abstract":"In the last two decades, Multi-Cast schemes in mobile ad-hoc networks have been widely studied and lots of research results have been put into use and changed our everyday life. However, packet loss for Multi-Cast schemes in mobile ad-hoc networks has not been well studied yet. The influence of node density and relay schemes on packet loss is not clear. Thus, we study the packet loss problem for Multi-Cast schemes in MANETs in this paper. First, we present a general Multi-Cast probabilistic model to get a better understanding of the packet loss problem. Second, based on the general model and Chernoff Bounds, we prove that the upper bound of the general packet loss for Multi-Cast is $Omega(me^{-frac{n}{2}})$, where $n$ is the node number and 𝓂 denotes number of hops. Thus we can conclude that large node density decreases the packet loss rate by exponential factor, and bigger hops increase packet loss rate linearly. In addition, we present a reliable Multi-Cast protocol(RMP). Through an emph{ACK Aware Tree} to complete packet acknowledgement and repair host selection, RMP is able to minimize the impact of packet loss on the Multi-Cast throughput in the simulation.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128242837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RSS Estimation Based on Bayesian Learning Mechanism by Vehicular Sensor Networks 基于贝叶斯学习机制的车载传感器网络RSS估计
Pub Date : 2017-09-01 DOI: 10.1109/VTCFall.2017.8288277
Silan Zheng, Cailian Chen, X. Guan, Li Yu
Received Signal Strength (RSS) estimation for networks in urban transportation systems can be carried out by Vehicular Sensor Networks (VSN). All moving vehicles on roads with signal-sensing applications can act as mobile sensors, collecting RSS along their driving routes and uploading data to data center at the end of every drive. However, there must be inconsistencies among RSS values achieved at same locations owing to different types and brands for vehicles. In this paper, we propose a RSS estimation algorithm to improve the credibility of RSS information at certain locations. This algorithm is based on Bayesian learning mechanism and calibrated by the values gained by high-precision equipment PXI experimental platform. We evaluate the algorithm based on the real-world data collected by our Android application. The results demonstrate the effectiveness and superiority of the method compared with typical algorithms.
城市交通系统网络的接收信号强度(RSS)估计可以通过车辆传感器网络(VSN)来实现。所有安装了信号传感应用程序的行驶车辆都可以充当移动传感器,沿着行驶路线收集RSS,并在每次行驶结束时将数据上传到数据中心。但是,由于车辆的类型和品牌不同,在同一地点取得的RSS值必然不一致。在本文中,我们提出了一种RSS估计算法,以提高RSS信息在特定位置的可信度。该算法基于贝叶斯学习机制,并通过高精度仪器PXI实验平台获得的数值进行校准。我们基于Android应用程序收集的真实数据来评估算法。结果表明,该方法与典型算法相比具有较好的有效性和优越性。
{"title":"RSS Estimation Based on Bayesian Learning Mechanism by Vehicular Sensor Networks","authors":"Silan Zheng, Cailian Chen, X. Guan, Li Yu","doi":"10.1109/VTCFall.2017.8288277","DOIUrl":"https://doi.org/10.1109/VTCFall.2017.8288277","url":null,"abstract":"Received Signal Strength (RSS) estimation for networks in urban transportation systems can be carried out by Vehicular Sensor Networks (VSN). All moving vehicles on roads with signal-sensing applications can act as mobile sensors, collecting RSS along their driving routes and uploading data to data center at the end of every drive. However, there must be inconsistencies among RSS values achieved at same locations owing to different types and brands for vehicles. In this paper, we propose a RSS estimation algorithm to improve the credibility of RSS information at certain locations. This algorithm is based on Bayesian learning mechanism and calibrated by the values gained by high-precision equipment PXI experimental platform. We evaluate the algorithm based on the real-world data collected by our Android application. The results demonstrate the effectiveness and superiority of the method compared with typical algorithms.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129911297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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