Constrained geocast to support Cooperative Adaptive Cruise Control (CACC) merging

Abstract

In this paper we introduce a new geocasting concept to target vehicles based on where they will be in the direct future, in stead of their current position. We refer to this concept as constrained geocast. This may be useful in situations where vehicles have interdependencies based on (future) maneuvers. We have developed a first version of such a protocol in the context of an automated merging application, and tested it using simulations. Results show that the protocol is able to meet the requirements of such applications. Compared to a common geo-broadcast protocol this protocol becomes more reliable as road traffic densities increase, but in other aspects the performance is so far lacking. Based on our experiences with implementing the protocol however we see plenty of room for further improvement. Index Terms-Cooperative Adaptive Cruise Control (CACC), geocast, V2V, VANET1 In this paper a node is defined as a network-entity, so any communicationcapable vehicle is also a node.

Inter-vehicle communication: Quo vadis

“…In the 2010 seminar, the participants proposed to put more focus on the applications and the assessment of their benefits, first ignoring too many technical details and then adding technological constraints successively [3]. Several research results appeared to have followed the proposed roadmap, see for example [6]- [8].…”

Creative Design for Barrier Tolls

“…So the design of the toll plaza and its merging pattern is significantly important to avoid congestion [1][2][3][4]. Except considering the accident prevention, throughput and the minimum cost of the toll plaza design, we should also discuss different operation model under various traffic situation to achieve the optimal result.…”

Location-based forwarding in vehicular networks

“…The work presented in Chapters 4 and 5 was published, in increasing levels of maturity, at the ERCIM Workshop on eMobility (ERCIM) 2010 [4], the IEEE Vehicular Networking Conference (VNC) 2010 [5], ERCIM 2011 [6], and the International Conference on ITS Telecommunications (ITST) 2011 [7]. The work in [8] served as a basis for all of the modelling work presented in Part III of the thesis and has been published in the proceedings of VNC 2011.…”

“…In previous work vehicles would estimate a range of future locations by taking into account a predefined maximum acceleration/deceleration value: in [4] a vehicle is considered a destination vehicle if for some acceleration/deceleration value that is less than the maximum the vehicle is estimated to be inside the event area during the event time, again using the formula for linear motion. With this method initially multiple vehicles will estimate to be inside the event area during the event time, consider themselves destination nodes, and therefore start creating a merging gap.…”

“…, f n−1 ). Since a node in interval i has a probability of S |i−fn−1| of receiving the (n − 1) th forwarder's transmission, the distribution of the number of candidate n th forwarders in interval i is thus Poisson distributed with its mean given by 5) for n, i ∈ N + and S 0 = 1. Fig.…”