Pub Date : 2014-09-01DOI: 10.1109/WIVEC.2014.6953267
Rekha Signoria, Joseph Peruski, Lars Wolleschensky
This demonstration focuses on two aspects of secure vehicle-to-vehicle communication. First, the generation of digital certificates using a backend server is showcased. Second, an example is shown as to how these certificates are used in vehicles, namely to digitally sign and subsequently verify basic safety messages.
{"title":"V2X demonstration","authors":"Rekha Signoria, Joseph Peruski, Lars Wolleschensky","doi":"10.1109/WIVEC.2014.6953267","DOIUrl":"https://doi.org/10.1109/WIVEC.2014.6953267","url":null,"abstract":"This demonstration focuses on two aspects of secure vehicle-to-vehicle communication. First, the generation of digital certificates using a backend server is showcased. Second, an example is shown as to how these certificates are used in vehicles, namely to digitally sign and subsequently verify basic safety messages.","PeriodicalId":410528,"journal":{"name":"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)","volume":"35 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122598610","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 : 2014-09-01DOI: 10.1109/WIVEC.2014.6953217
G. Bansal, Bin Cheng, Ali Rostami, Katrin Sjöberg, J. Kenney, M. Gruteser
Channel congestion is one of the major challenges for IEEE 802.11p-based vehicular ad hoc networks. Unless controlled, congestion increases with vehicle density, leading to high packet loss and degraded safety application performance. In this paper, we study two classes of congestion control - reactive and adaptive. The reactive approach is represented by the Decentralized Congestion Control (DCC) framework defined in ETSI. The adaptive approach is represented by the LIMERIC linear control algorithm. Both approaches control safety message transmission as a function of channel load (i.e. Channel Busy Ratio, CBR). A reactive approach uses CBR directly, defining an appropriate transmission behavior for each CBR value, e.g. via a table lookup. By contrast, an adaptive approach identifies the transmission behavior that drives CBR to a target channel load, thus achieving the best message throughput possible for any given vehicle density. The paper considers two variations of DCC, one in which it serves as a traffic shaping “gatekeeper” above the MAC sublayer, and another in which it additionally limits safety message generation at the facilities layer. The paper has two main results. First, it is shown that LIMERIC generally outperforms both DCC variations in a winding road scenario with various vehicle densities. Inter-packet reception gap and position tracking error are the primary metrics. This advantage is due to primarily LIMERIC's ability to achieve a target load consistent with maximum throughput and vehicle awareness. Second, it is shown that both DCC variations are subject to steady state oscillations, and the case in which DCC also limits message generation is subject to truly unstable variations. The paper uses NS-2 simulation results to support these conclusions.
{"title":"Comparing LIMERIC and DCC approaches for VANET channel congestion control","authors":"G. Bansal, Bin Cheng, Ali Rostami, Katrin Sjöberg, J. Kenney, M. Gruteser","doi":"10.1109/WIVEC.2014.6953217","DOIUrl":"https://doi.org/10.1109/WIVEC.2014.6953217","url":null,"abstract":"Channel congestion is one of the major challenges for IEEE 802.11p-based vehicular ad hoc networks. Unless controlled, congestion increases with vehicle density, leading to high packet loss and degraded safety application performance. In this paper, we study two classes of congestion control - reactive and adaptive. The reactive approach is represented by the Decentralized Congestion Control (DCC) framework defined in ETSI. The adaptive approach is represented by the LIMERIC linear control algorithm. Both approaches control safety message transmission as a function of channel load (i.e. Channel Busy Ratio, CBR). A reactive approach uses CBR directly, defining an appropriate transmission behavior for each CBR value, e.g. via a table lookup. By contrast, an adaptive approach identifies the transmission behavior that drives CBR to a target channel load, thus achieving the best message throughput possible for any given vehicle density. The paper considers two variations of DCC, one in which it serves as a traffic shaping “gatekeeper” above the MAC sublayer, and another in which it additionally limits safety message generation at the facilities layer. The paper has two main results. First, it is shown that LIMERIC generally outperforms both DCC variations in a winding road scenario with various vehicle densities. Inter-packet reception gap and position tracking error are the primary metrics. This advantage is due to primarily LIMERIC's ability to achieve a target load consistent with maximum throughput and vehicle awareness. Second, it is shown that both DCC variations are subject to steady state oscillations, and the case in which DCC also limits message generation is subject to truly unstable variations. The paper uses NS-2 simulation results to support these conclusions.","PeriodicalId":410528,"journal":{"name":"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128931874","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 : 2014-09-01DOI: 10.1109/WIVEC.2014.6953263
Xiaomin Qian, L. Hao
Recent advancement in vehicular wireless applications is also a major contributing factor in spectrum scarcity. Cognitive radio technique is applied to Vehicular Ad hoc Networks (VANETs) to increase frequency bandwidth. Fast and reliable detection of primary user is the key component of cognitive radio networks. Energy detection (ED) based spectrum sensing is a viable choice for vehicle communications due to its simplicity, low computational cost and ability to be applied on any kind of deterministic signal. This paper examines the performance of spectrum sensing using energy detection over correlated Rayleigh channel. For the no-diversity case and for the Equal Gain Combining (EGC) diversity case it presents some alternative closed-form expressions for the probability of miss detection to those recently reported in the literature. The relevant simulation results are presented to support our analytical results for average miss detection probability.
{"title":"Spectrum sensing with energy detection in cognitive Vehicular Ad hoc Networks","authors":"Xiaomin Qian, L. Hao","doi":"10.1109/WIVEC.2014.6953263","DOIUrl":"https://doi.org/10.1109/WIVEC.2014.6953263","url":null,"abstract":"Recent advancement in vehicular wireless applications is also a major contributing factor in spectrum scarcity. Cognitive radio technique is applied to Vehicular Ad hoc Networks (VANETs) to increase frequency bandwidth. Fast and reliable detection of primary user is the key component of cognitive radio networks. Energy detection (ED) based spectrum sensing is a viable choice for vehicle communications due to its simplicity, low computational cost and ability to be applied on any kind of deterministic signal. This paper examines the performance of spectrum sensing using energy detection over correlated Rayleigh channel. For the no-diversity case and for the Equal Gain Combining (EGC) diversity case it presents some alternative closed-form expressions for the probability of miss detection to those recently reported in the literature. The relevant simulation results are presented to support our analytical results for average miss detection probability.","PeriodicalId":410528,"journal":{"name":"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)","volume":"141 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120864657","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 : 2014-09-01DOI: 10.1109/WIVEC.2014.6953270
Steffen Beyme, C. Leung
A mobile, autonomous platform is assisted by a wireless sensor network in its task of inferring a map of the spatial distribution of a physical quantity that is measured by the sensor nodes. Sensor nodes initiate a broadcast in the network, when the measured quantity assumes a value in the range of interest. Specifically, we consider randomly deployed networks of location-agnostic wireless sensor nodes, which broadcast messages by flooding. The node-to-node delays are assumed to be random. In networks of this type, the hop count of a broadcast message, given the distance from the source node, can be approximated by a simple parametric distribution. The mobile platform can interrogate a nearby sensor node to obtain, with a given success probability, the hop counts of the broadcast messages originating from different source nodes. By fusing successive hop count observations, the mobile platform infers the locations of the source nodes and thereby, the spatial distribution of the quantity of interest. The path taken by the mobile platform should minimize the resulting mapping error as quickly as possible. We propose an information-driven path planning approach, in which the mobile platform acts by maximizing a weighted sum of myopic, mutual information gains. We show by simulation, that suitable control of the weights is effective at reducing the error between the true and the inferred map, by preventing the information gain to be dominated by only a few source nodes.
{"title":"Wireless sensor network-assisted, autonomous mapping with information-theoretic utility","authors":"Steffen Beyme, C. Leung","doi":"10.1109/WIVEC.2014.6953270","DOIUrl":"https://doi.org/10.1109/WIVEC.2014.6953270","url":null,"abstract":"A mobile, autonomous platform is assisted by a wireless sensor network in its task of inferring a map of the spatial distribution of a physical quantity that is measured by the sensor nodes. Sensor nodes initiate a broadcast in the network, when the measured quantity assumes a value in the range of interest. Specifically, we consider randomly deployed networks of location-agnostic wireless sensor nodes, which broadcast messages by flooding. The node-to-node delays are assumed to be random. In networks of this type, the hop count of a broadcast message, given the distance from the source node, can be approximated by a simple parametric distribution. The mobile platform can interrogate a nearby sensor node to obtain, with a given success probability, the hop counts of the broadcast messages originating from different source nodes. By fusing successive hop count observations, the mobile platform infers the locations of the source nodes and thereby, the spatial distribution of the quantity of interest. The path taken by the mobile platform should minimize the resulting mapping error as quickly as possible. We propose an information-driven path planning approach, in which the mobile platform acts by maximizing a weighted sum of myopic, mutual information gains. We show by simulation, that suitable control of the weights is effective at reducing the error between the true and the inferred map, by preventing the information gain to be dominated by only a few source nodes.","PeriodicalId":410528,"journal":{"name":"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131705327","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
扫码关注我们
求助内容：
应助结果提醒方式：