Simulating Vehicle Movement and Multi-Hop Connectivity from Basic Safety Messages

The Basic Safety Message (BSM) is a standardized communication packet that is sent every tenth of a second between connected vehicles using Dedicated Short Range Communication (DSRC). BSMs contain data about the sending vehicle's state, such as speed, location, and the status of the turn signal. Currently, many BSM datasets are available through the connected vehicle testbeds of U.S. Department of Transportation from all over the country. However, without a proper visualization tool, it is not possible to analyze or visually get an overview of the spatio-temporal distribution of the data. With this goal, a web application has been developed which can ingest a raw BSM dataset and display a time-based simulation of vehicle movement. The simulation also displays multi-hop vehicular network connectivity over DSRC. This paper gives details about the application, including an explanation of the multi-hop partitioning algorithm used to classify the vehicles into separate network partitions. A performance analysis for the simulation is included, in which it is suggested that calculating a connectivity matrix with the multi-hop partitioning algorithm is computationally expensive for large number of vehicles

Evaluation of Time-Critical Communications for IEC 61850-Substation Network Architecture

Present-day developments, in electrical power transmission and distribution, require considerations of the status quo. In other meaning, international regulations enforce increasing of reliability and reducing of environment impact, correspondingly they motivate developing of dependable systems. Power grids especially intelligent (smart grids) ones become industrial solutions that follow standardized development. The International standardization, in the field of power transmission and distribution, improve technology influences. The rise of dedicated standards for SAS (Substation Automation Systems) communications, such as the leading International Electro-technical Commission standard IEC 61850, enforces modern technological trends in this field. Within this standard, a constraint of low ETE (End-to-End) latency should be respected, and time-critical status transmission must be achieved. This experimental study emphasis on IEC 61850 SAS communication standard, e.g. IEC 61850 GOOSE (Generic Object Oriented Substation Events), to implement an investigational method to determine the protection communication delay. This method observes GOOSE behaviour by adopting monitoring and analysis capabilities. It is observed by using network test equipment, i.e. SPAN (Switch Port Analyser) and TAP (Test Access Point) devices, with on-the-shelf available hardware and software solutions

Making Transport Safer: V2V-Based Automated Emergency Braking System

An important goal in the field of intelligent transportation systems (ITS) is to provide driving aids aimed at preventing accidents and reducing the number of traffic victims. The commonest traffic accidents in urban areas are due to sudden braking that demands a very fast response on the part of drivers. Attempts to solve this problem have motivated many ITS advances including the detection of the intention of surrounding cars using lasers, radars or cameras. However, this might not be enough to increase safety when there is a danger of collision. Vehicle to vehicle communications are needed to ensure that the other intentions of cars are also available. The article describes the development of a controller to perform an emergency stop via an electro-hydraulic braking system employed on dry asphalt. An original V2V communication scheme based on WiFi cards has been used for broadcasting positioning information to other vehicles. The reliability of the scheme has been theoretically analyzed to estimate its performance when the number of vehicles involved is much higher. This controller has been incorporated into the AUTOPIA program control for automatic cars. The system has been implemented in Citroën C3 Pluriel, and various tests were performed to evaluate its operation

Efficient and Low-Cost RFID Authentication Schemes

Security in passive resource-constrained Radio Frequency Identification (RFID) tags is of much interest nowadays. Resistance against illegal tracking, cloning, timing, and replay attacks are necessary for a secure RFID authentication scheme. Reader authentication is also necessary to thwart any illegal attempt to read the tags. With an objective to design a secure and low-cost RFID authentication protocol, Gene Tsudik proposed a timestamp-based protocol using symmetric keys, named YA-TRAP*. Although YA-TRAP* achieves its target security properties, it is susceptible to timing attacks, where the timestamp to be sent by the reader to the tag can be freely selected by an adversary. Moreover, in YA-TRAP*, reader authentication is not provided, and a tag can become inoperative after exceeding its pre-stored threshold timestamp value. In this paper, we propose two mutual RFID authentication protocols that aim to improve YA-TRAP* by preventing timing attack, and by providing reader authentication. Also, a tag is allowed to refresh its pre-stored threshold value in our protocols, so that it does not become inoperative after exceeding the threshold. Our protocols also achieve other security properties like forward security, resistance against cloning, replay, and tracking attacks. Moreover, the computation and communication costs are kept as low as possible for the tags. It is important to keep the communication cost as low as possible when many tags are authenticated in batch-mode. By introducing aggregate function for the reader-to-server communication, the communication cost is reduced. We also discuss different possible applications of our protocols. Our protocols thus capture more security properties and more efficiency than YA-TRAP*. Finally, we show that our protocols can be implemented using the current standard low-cost RFID infrastructures.Comment: 21 pages, Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA), Vol 2, No 3, pp. 4-25, 201