2019 8th International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)最新文献

筛选

英文中文

Securing Vehicular Platooning against Vehicle Platooning Disruption (VPD) Attacks 保护车辆队列免受车辆队列中断(VPD)攻击

2019 8th International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN) Pub Date : 2019-11-01 DOI: 10.23919/PEMWN47208.2019.8986956

Nabila Bermad, Salah Zemmoudj, Mawloud Omar

{"title":"Securing Vehicular Platooning against Vehicle Platooning Disruption (VPD) Attacks","authors":"Nabila Bermad, Salah Zemmoudj, Mawloud Omar","doi":"10.23919/PEMWN47208.2019.8986956","DOIUrl":"https://doi.org/10.23919/PEMWN47208.2019.8986956","url":null,"abstract":"The traffic problems related to bottlenecks, accidents and delays on the road intersections create a significant need for the application of platoon mechanism. In this context, we consider a scenario when a platoon of negotiating vehicles approaches the intersection. The platoon leader should negotiate the passage of its following vehicles from the traffic light to enable them to reach their destinations as soon as possible. However, some platooned member vehicles try to destroy platoon stability. In this paper, we considered the VPD (Vehicle platooning disruption) attacks, where an attacker seeks to destabilize or take control of a platoon through false data injection (FDI) and replay of control messages. To conceive a countermeasure to this attack, first, we propose a VPD Attacks Detection Algorithm (VPD-ADA), which can identify the instability of the platoon dynamics model as a primary step for mitigating the impact of FDI and replay attacks. We use stochastic time series analysis to evaluate the impact of VPD attacks by the deviation anomalies of cartesian coordinates of vehicles from the expected trajectory determined by the platoon. Second, we introduce a Reputation-based Reliable Mitigation Algorithm (RRMA) that uses fused information from neighboring vehicles to decide the reliability of received messages.","PeriodicalId":440043,"journal":{"name":"2019 8th International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121562340","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}

引用次数: 9

Performance Evaluation of Neighbor Discovery Algorithms in a Star WSN: Switched beam antenna vs omnidirectional antenna at the Sink 星型无线传感器网络中邻居发现算法的性能评价:交换波束天线与全向天线

2019 8th International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN) Pub Date : 2019-11-01 DOI: 10.23919/PEMWN47208.2019.8986963

Guéréguin Der Sylvestre Sidibé, Hamadoun Tall, M. Servajean, M. Misson

{"title":"Performance Evaluation of Neighbor Discovery Algorithms in a Star WSN: Switched beam antenna vs omnidirectional antenna at the Sink","authors":"Guéréguin Der Sylvestre Sidibé, Hamadoun Tall, M. Servajean, M. Misson","doi":"10.23919/PEMWN47208.2019.8986963","DOIUrl":"https://doi.org/10.23919/PEMWN47208.2019.8986963","url":null,"abstract":"One of the key element in performance measurement for a neighbor discovery algorithm with switched beam antennas is how long it takes to discover the neighbors given that nodes do not have any prior knowledge about their neighbors. An impression we may have in neighbor discovery is that algorithms based on directional antennas takes longer time for a node to discover all its neighbors than those entirely based on omnidirectional antennas. We propose two neighbor discovery schemes, one is based on time slotting and the other on the well known CSMA/CA unslotted version. We evaluate the time that the sink needs to discover its neighbors when it is equipped with a switched beam antenna, and when it uses an omnidirectional antenna. Through our simulation results, we show that when neighbor discovery algorithms based on directional antennas are correctly designed, they achieve the same order of performance in terms of time needed by the sink to discover all its neighbors as those based on omnidirectional antennas. Our simulation results also show that when using a switched beam antenna and CSMA/CA algorithm for medium access at the sink, the discovery delay is higher.","PeriodicalId":440043,"journal":{"name":"2019 8th International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128071550","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

首页上一页