Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
Pub Date : 2017-09-01DOI: 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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：