Adaptive scheduling for real-time and temporal information services in vehicular networks

Vehicular networks represent a research area of significant importance in improving the safety, efficiency and sustainability of transportation systems. One of the key research problems in vehicular networks is real-time data dissemination, which is crucial to the satisfactory performance of many emergent applications providing real-time information services in vehicular networks. Specifically, the two issues need to be addressed in this problem are maintenance of temporal data freshness and timely dissemination of data. Most existing works only considered periodical data update via backbone wired networks in maintaining temporal data freshness. However, many applications rely on passing vehicles to upload their collected information via wireless network, which imposes new challenges as the uplink data update will have to compete with the downlink data dissemination for the limited wireless bandwidth. With such observations, we propose a temporal information service system, in which vehicles are able to collect up-to-date temporal information and upload them to the roadside units (RSU) along their trajectories. Meanwhile, RSU can disseminate its available data items to vehicles based on their specific requests. Particularly, in this paper, we first quantitatively analyze the freshness of temporal data and propose a mathematical model to evaluate the usefulness of the temporal data. Next, we give the formulation of the proposed real-time and temporal information service (RTIS) problem, and prove the NP-hardness of this problem by constructing a polynomial-time reduction from 0–1 knapsack problem. Subsequently, we establish a probabilistic model to theoretically analyze the tradeoff between timely temporal data update and requested data dissemination sharing a common communication resource, which provides a deeper insight of the proposed RTIS. Further, a heuristic algorithm, namely adaptive update request scheduling (AURS), is designed to enhance the efficacy of RTIS by synthesizing the broadcast effect, the real-time service requirement and the service quality in making scheduling decisions. The computational complexity and scalability analysis of AURS is also discussed. Last but not least, a simulation model is implemented and a comprehensive performance evaluation has been carried out to demonstrate the superiority of ARUS against several state-of-the-art approaches in a variety of application scenarios.     

Optimization models to characterize the broadcast capacity of vehicular ad hoc networks

Broadcast capacity of the entire network is one of the fundamental properties of vehicular ad hoc networks (VANETs). It measures how efficiently the information can be transmitted in the network and usually it is limited by the interference between the concurrent transmissions in the physical layer of the network. This study defines the broadcast capacity of vehicular ad hoc network as the maximum successful concurrent transmissions. In other words, we measure the maximum number of packets which can be transmitted in a VANET simultaneously, which characterizes how fast a new message such as a traffic incident can be transmitted in a VANET. Integer programming (IP) models are first developed to explore the maximum number of successful receiving nodes as well as the maximum number of transmitting nodes in a VANET. The models embed an traffic flow model in the optimization problem. Since IP model cannot be efficiently solved as the network size increases, this study develops a statistical model to predict the network capacity based on the significant parameters in the transportation and communication networks. MITSIMLab is used to generate the necessary traffic flow data. Response surface method and linear regression technologies are applied to build the statistical models. Thus, this paper brings together an array of tools to solve the broadcast capacity problem in VANETs. The proposed methodology provides an efficient approach to estimate the performance of a VANET in real-time, which will impact the efficacy of travel decision making.     

Experimental evaluation of CAM and DENM messaging services in vehicular communications

The Cooperative Awareness Basic Service and Decentralized Environmental Notification Basic Service have been standardized by the European Telecommunications Standards Institute (ETSI) to support vehicular safety and traffic efficiency applications needing continuous status information about surrounding vehicles and asynchronous notification of events, respectively. These standard specifications detail not only the packet formats for both the Cooperative Awareness Message (CAM) and Decentralized Environmental Notification Message (DENM), but also the general message dissemination rules. These basic services, also known as facilities, have been developed as part of a set of standards in which both ISO and ETSI describe the Reference Communication Architecture for future Intelligent Transportation Systems (ITS). By using a communications stack that instantiates this reference architecture, this paper puts in practice the usage of both facilities in a real vehicular scenario. This research work details implementation decisions and evaluates the performance of CAM and DENM facilities through a experimental testbed deployed in a semi-urban environment that uses IEEE 802.11p (ETSI G5-compliant), which is a WiFi-like communication technology conceived for vehicular communications. On the one hand, this validation considers the development of two ITS applications using CAM and DENM functionalities for tracking vehicles and disseminating traffic incidences. In this case, CAM and DENM have demonstrated to be able to offer all the necessary functionality for the study case. On the other hand, both facilities have been also validated in a extensive testing campaign in order to analyze the influence in CAM and DENM performance of aspects such as vehicle speed, signal quality or message dissemination rules. In these tests, the line of sight, equipment installation point and hardware capabilities, have been found as key variables in the network performance, while the vehicle speed has implied a slight impact.     

Instantaneous communication throughputs of vehicular ad hoc networks

Vehicular ad hoc networks (VANETs) formed by connected vehicles in a traffic stream could be applied to improve safety, mobility, and environmental impacts of a transportation system. In this paper, we present analytical models for the instantaneous communication throughputs of VANETs to measure the efficiency of information propagation under various traffic conditions at a time instant. In particular, we define broadcast and unicast communication throughputs by the wireless channel bandwith multiplied by the average probabilities that one vehicle is a successful receiver and sender in a VAENT, respectively. With a protocol communication model, we derive formulas to determine the probabilities for an equipped vehicle to be a successful broadcast receiver and a successful unicast receiver/sender, and obtain broadcast and unicast throughputs along discrete and continuous traffic streams. We further examine the impacts on communication throughputs of the transmission range and the interference range of dedicated short range communication devices as well as the market penetration rate of equipped vehicles and the percentage of senders. Finally, we investigate the influence of shock waves on communication throughputs.     

Stochastic prediction of train delays in real-time using Bayesian networks

In this paper we present a stochastic model for predicting the propagation of train delays based on Bayesian networks. This method can efficiently represent and compute the complex stochastic inference between random variables. Moreover, it allows updating the probability distributions and reducing the uncertainty of future train delays in real time under the assumption that more information continuously becomes available from the monitoring system. The dynamics of a train delay over time and space is presented as a stochastic process that describes the evolution of the time-dependent random variable. This approach is further extended by modelling the interdependence between trains that share the same infrastructure or have a scheduled passenger transfer. The model is applied on a set of historical traffic realisation data from the part of a busy corridor in Sweden. We present the results and analyse the accuracy of predictions as well as the evolution of probability distributions of event delays over time. The presented method is important for making better predictions for train traffic, that are not only based on static, offline collected data, but are able to positively include the dynamic characteristics of the continuously changing delays.     

Modeling traffic crash rates of road segments through a lognormal hurdle framework with flexible scale parameter

This study examines distributional characteristics of crash rates for road segments using observed accident data. The results indicate that the distribution of crash rates is mixed and right‐skewed, which motivates the consideration of non‐normal distributions. With the aid of Kolmogorov–Smirnov tests, kernel density plots, and Q–Q plots, the lognormal distribution is verified as an appropriate candidate for representing the positive domain of crash rates. Then, a lognormal hurdle model was developed and also compared with gamma and Weibull hurdle models. Further, the lognormal hurdle model was revised by allowing the scale parameter to vary with respect to explanatory variables. Such a modification enables the heterogeneous skewness of samples to be captured while enhancing the modeling flexibility. The proposed model was also compared with a Tobit model, an alternative approach that treats crash rates as censored data. Among all these models, the proposed lognormal hurdle model with flexible scale parameter presents the best modeling performance, and the analyses also reveal that several explanatory variables affect crash rates through not only the location parameter but also the scale parameter in the lognormal model. This study finally attempted to inspect crash rates through count models, and it discovered that the proposed hurdle model is superior because it is able to output the whole distribution form of crash rates, whereas the crash count model can only provide the expected value of crash rates, provided the exposure variable servers as an offset term in the link function of the mean parameter. Copyright © 2015 John Wiley & Sons, Ltd.     

Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach

This paper studies a mean-standard deviation shortest path model, also called travel time budget (TTB) model. A route’s TTB is defined as this route’s mean travel time plus a travel time margin, which is the route travel time’s standard deviation multiplied with a factor. The TTB model violates the Bellman’s Principle of Optimality (BPO), making it difficult to solve it in any large stochastic and time-dependent network. Moreover, it is found that if path travel time distributions are skewed, the conventional TTB model cannot reflect travelers’ heterogeneous risk-taking behavior in route choice. This paper proposes to use the upper or lower semi-standard deviation to replace the standard deviation in the conventional TTB model (the new models are called derived TTB models), because these derived TTB models can well capture such heterogeneous risk-taking behavior when the path travel time distributions are skewed. More importantly, this paper shows that the optimal solutions of these two derived TTB models must be non-dominated paths under some specific stochastic dominance (SD) rules. These finding opens the door to solve these derived TTB models efficiently in large stochastic and time-dependent networks. Numerical examples are presented to illustrate these findings.     

Study on some bus transport networks in China with considering spatial characteristics

Many real-world networks are embedded in spaces. Recent studies have found that spatial characteristics are closely related to network features. Bus transport networks (BTNs) are typical spatially embedded networks, but their spatial characteristics are commonly disregarded in previous researches. In this paper, we propose a new spatial representation model for BTNs with information on the geographical location of bus stations and routes, for which we named as the ES model. The new model aids in the study of real-world BTNs. By performing a statistical study with the new representation model on three typical BTNs in China, namely the Beijing, Shanghai and Hangzhou BTNs, we identify some network features that are consistent with those revealed by previous studies, as well as some new features such as high clustering of short-distance station pairs (SSPs) and small average number of bus routes in a path. The result shows that the existence of SSPs can significantly influence the characteristics of BTNs. Besides, with the help of the ES model, we designed a new transfer algorithm for BTNs.     

Modeling the evolutions of day‐to‐day route choice and year‐to‐year ATIS adoption with stochastic user equilibrium

Suppose that in an urban transportation network there is a specific advanced traveler information system (ATIS) which acts for reducing the drivers' travel time uncertainty through provision of pre‐trip route information. Because of the imperfect information provided, some travelers are not in compliance with the ATIS advice although equipped with the device. We thus divide all travelers into three groups, one group unequipped with ATIS, another group equipped and in compliance with ATIS advice and the third group equipped but without compliance with the advice. Each traveler makes route choice in a logit‐based manner and a stochastic user equilibrium with multiple user classes is reached for every day. In this paper, we propose a model to investigate the evolutions of daily path travel time, daily ATIS compliance rate and yearly ATIS adoption, in which the equilibrium for every day's route choice is kept. The stability of the evolution model is initially analyzed. Numerical results obtained from a test network are presented for demonstrating the model's ability in depicting the day‐to‐day and year‐to‐year evolutions.     

Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance.     

Modeling travel mode choice of young people with differentiated E-hailing ride services in Nanjing China

E-hailing ride service (ERS) has become increasingly popular globally and is changing the urban mobility landscape. There is insufficient research effort in understanding the impact of ERS on travel behavior, in particular among young people. This paper aims to start filling that research gap by first collecting mode choice preference data through a stated preference survey in City of Nanjing, China and then applying nested logit (NL) models and a series of post-estimation analysis to address a number of key research questions of mode choice behavior without and with ERS. Three ERS modes are considered in the Chinese context: DiDi Taxi (D-Taxi), DiDi Express (D-Express), and DiDi Premier (D-Premier), all provided by DiDi Chuxing, the dominant ERS service provider in China. The study finds that age makes little difference in mode choice preference when ERS is introduced between the two age groups considered (18–30 and 31–45). The study results also suggest that young travelers are naturally drawn to ERS for what it represents (a technology innovation) and its business (pricing) model. ERS appears to be a competitive alternative to the conventional modes especially when they are under performed. The study also finds that ERS will likely increase vehicle kilometers traveled (VKT) considerably, which will lead to increase in on-road vehicular emissions, unless some mechanism to switch users to ridesharing is in place.