Wireless vehicle-to-vehicle (V2V) and vehicle-toinfrastructure (V2I) communication holds great promise for significantly reducing the human and financial costs of vehicle collisions A common characteristic of this communication is the broadcast of a device's core state information at regular intervals (eg, vehicle speed and location or traffic signal state and timing) Unless controlled, the aggregate of these broadcasts will congest the channel under dense traffic scenarios, reducing the effectiveness of collision avoidance applications that use transmitted information Active congestion control using distributed techniques is a topic of great interest for establishing the scalability of this technology This paper defines a new adaptive congestion control algorithm that can be applied to the message rate of devices in this vehicular environment While other published approaches rely on binary control, the LInear MEssage Rate Integrated Control (LIMERIC) algorithm takes advantage of full-precision control inputs that are available on the wireless channel The result is provable convergence to fair and efficient channel utilization in the deterministic environment, under simple criteria for setting adaptive parameters This “perfect” convergence avoids the limit cycle behavior that is inherent to binary control We also discuss several practical aspects associated with implementing LIMERIC, including guidelines for the choice of system parameters to obtain desired utilization outcomes, a gain saturation technique that maintains robust convergence under all conditions, convergence with asynchronous updates, and using channel load to determine the aggregate message rate that is observable at a receiver This paper also extends the convergence analysis for two important cases, ie, measurement noise in the input signal and delay in the update process This paper illustrates key analytical results using MATLAB numerical results and employs standard NS-2 simulations to demonstrate the performance of LIMERIC in several high-density scenarios

LIMERIC: A Linear Adaptive Message Rate Algorithm for DSRC Congestion Control

With the remarkable progress of cooperative communication technology in recent years, its transformation to vehicular networking is gaining momentum. Such a transformation has brought a new research challenge in facing the realization of cooperative vehicular networking (CVN). This paper presents a comprehensive survey of recent advances in the field of CVN. We cover important aspects of CVN research, including physical, medium access control, and routing protocols, as well as link scheduling and security. We also classify these research efforts in a taxonomy of cooperative vehicular networks. A set of key requirements for realizing the vision of cooperative vehicular networks is then identified and discussed. We also discuss open research challenges in enabling CVN. Lastly, the paper concludes by highlighting key points of research and future directions in the domain of CVN.

/pdf/cooperative-vehicular-networking-a-survey-47r0gpwto5.pdf

Cooperative Vehicular Networking: A Survey

In vehicular ad hoc network (VANET) safety applications, the source vehicle that detects an accident can generate a warning message and propagate it to the following vehicles to notify other drivers before they reach the potential danger zone on the road. Recent studies have shown that sparse vehicle traffic leads to network fragmentation, which poses a crucial research challenge for safety applications. In this paper, we analyze and quantify the improvement in VANET connectivity when a limited number of roadside units (RSUs) are deployed and to investigate the routing performance for broadcast-based safety applications in this enhanced VANET environment. Our results show that, even with a small number of RSUs, the performance in terms of the probability of network connectivity, the rehealing delay, the number of rehealing hops, and the message penetration time can be significantly improved in highway VANET scenarios.

Enhancing VANET Connectivity Through Roadside Units on Highways

Due to the uncertainty of transmission opportunities between mobile nodes, the routing of delay-tolerant networks (DTNs) exploits the mechanism of opportunistic forwarding. Efficient algorithms and policies for opportunistic forwarding are crucial for maximizing the message delivery probability while reducing the delivery cost. In this paper, we investigate the problem of energy-efficient opportunistic forwarding for DTNs. First, we model the message dissemination by introducing a continuous-time Markov framework. Based on this framework, we formulate the optimization problem of opportunistic forwarding, with the constraint of energy consumed by the message delivery for both two-hop and epidemic forwarding. Then, based on the solution of the optimization problem, we design different kinds of forwarding policies such as static and dynamic policies. Among these policies, we find that the threshold dynamic policy is optimal for both two-hop and epidemic forwarding. By simulation results, we show the accuracy of our continuous-time Markov analysis model. Furthermore, through extensive numerical results, we demonstrate that the performance of the threshold dynamic policy is the best among the static and continuous dynamic policies, and among the continuous dynamic policies, the negative-power policy provides relatively better performance.

Energy-Efficient Optimal Opportunistic Forwarding for Delay-Tolerant Networks

Due to the uncertainty of transmission opportunities between mobile nodes, delay tolerant networks (DTNs) exploit the opportunistic forwarding mechanism. This mechanism requires nodes to forward messages in a cooperative and selfish way. However, in the real word, most of the nodes exhibit selfish behaviors, such as individual and social selfishness. In this paper, we are the first to investigate how the selfish behaviors of nodes affect the performance of DTN multicast. We consider two typical multicast relaying schemes, namely, two-hop relaying and epidemic relaying, and study their performance in terms of average message transmission delay and transmission cost. Specifically, we model the message delivery process under selfish behaviors by a 3-D continuous time Markov chain; under this model, we derive closed-form formulas for the message transmission delay and cost. Then, we evaluate the accuracy of the proposed Markov chain model by comparing the theoretical results with the simulation results obtained by simulating the message dissemination under both two-hop and epidemic relaying with different network sizes and mobility models. Our study shows that different selfish behaviors may have different impacts on different performance metrics. In addition, selfish behaviors influence epidemic relaying more than two-hop relaying. Furthermore, our results show that the performance of multicast with selfish nodes depends on the multicast group size.

The Impact of Node Selfishness on Multicasting in Delay Tolerant Networks

Broadcast communications is critically important in vehicular networks. Many safety applications need safety warning messages to be broadcast to all vehicles present in an area. Design of a medium access control (MAC) protocol for vehicular networks is an interesting problem because of challenges posed by broadcast traffic, high mobility, high reliability and low delay requirements of these networks. In this article, we propose a topology-transparent broadcast protocol and present a detailed mathematical analysis for obtaining the probability of success and the average delay. We show, by analysis and simulations, that the proposed protocol outperforms two existing protocols for vehicular networks with topology-transparent properties and provides reliable broadcast communications for delivering safety messages under load conditions deemed to be common in vehicular environments.

/pdf/reliable-broadcast-of-safety-messages-in-vehicular-ad-hoc-4eais8pgve.pdf

F. Farnoud Hassanzadeh

Papers

Reliable Broadcast of Safety Messages in Vehicular Ad Hoc Networks