Optimal epidemic broadcasting for vehicular ad hoc networks

Abstract

Dynamic nature of vehicular ad hoc networks (VANETs) creates great challenges for message dissemination. To satisfy the high reliability and low delivery latency requirements for safety applications in VANETs, a dynamic epidemic broadcasting model is presented in this paper. On the basis of the ordinary differential equations, the proposed optimal control scheme is analyzed to understand the epidemic broadcasting properties, which include the message delivery probability, the expected delivery latency, and the number of copies. The correctness of the theoretical analyses is confirmed by simulations, and the experiment results prove the efficiency of the optimal epidemic broadcasting model. subclass of the WAVE technologies for vehicle-to-vehicle and vehicle-to-infrastructure interactions, which aims at accelerating the deployment of VANETs as well as improving traffic safety [2][3][4][5]. However, because the IEEE 1609 family provides only the overall protocol that is suitably used in VANETs, the actual model for information dissemination and the efficient algorithm to be implemented under this protocol are left to the designers.On the other hand, VANETs face great challenges including dynamic network topology, lack of centralized control, and unattended potential failures in wireless link [6]. High mobility of vehicles leads to more uncertainty of opportunistic transmission between two vehicles. Additionally, sparse node density and opportunistic inter-meeting between any two vehicles make absence of end-to-end paths from communication sources to their destinations in VANETs in most time [7]. VANETs are also characterized by intermittent connection in many traffic situations and process message propagation in the delay-tolerant manner as delay tolerant networks. So, many traditional routing protocols and message dissemination models are no longer suitable or fail to work for VANETs, and a novel-efficient broadcasting mechanism for message dissemination is necessary [8].In the past few years, a novel routing paradigm, so called 'the store-carry-and-forward', has been developed and studied at full length to support opportunistic communication in VANETs [9]. In this routing paradigm, a mobile node is able to store the message in its buffer with limited capacity after receiving that message and then carries the message as it moves unless the next hop for routing the message is available. This node will forward the stored message to other new mobile nodes when those nodes that it encounters move into its communication coverage. The process is named as 'communication contact' or 'inter-meeting' between two vehicles and can be analogous to the spread of infectious diseases [10]. Some improved variations of the epidemic-based routing have recently received a large amount of attentions in current research literatures [11][12][13][14][15]. For example, Ren et al. adopt an approach of adaptive compression of vectors to reduce some redundant overhead when nodes exchange summary vectors (SVs) and request vectors and store th...

An adaptive vehicular epidemic routing method based on attractor selection model

“…According to many existing studies such as [5,6,8,10,11,12,13], the exponential distribution model is sufficiently accurate for approximating the distribution of the inter-contact time (ITC) of vehicles in VANETs.…”

“…A basic epidemic routing protocol is proposed in the early work [5], and some variations of the epidemic routing have subsequently developed for improving the performance of the basic epidemic routing in specified application scenarios [8,9,10,11,12,13]. In [8], an epidemic-based broadcast scheme is formulated with the consideration of limited-time forwarding and controlled-beaconing. They use a pre-fixed timeout parameter to trade off the delivery latency against the number of rebroadcast and the storage occupancy.…”

“…Therefore, some novel control strategies or optimization mechanisms have been proposed to overcome the drawbacks of pure epidemic routing, such as limited-time forwarding used to restrict the number of unnecessary message copies in VANETs [8], 'spray and wait' scheme [9], energy-efficient n-epidemic routing [10], energy-efficient probabilistic forwarding [11], optimal beaconing control strategy [12,13]. Although there exist many schemes proposed for improving epidemic routing protocol, it remains an open issue to explore how to disseminate messages in dynamic VANETs in terms of realizing a good trade-off between delivery latency, reachability and resource cost.…”

Enhanced fuzzy logic‐based spray and wait routing protocol for delay tolerant networks

“…The network is flooded with a lot of messages, which requires a high amount of buffer space leading to buffer congestion and high drop rate of messages. A strategy based on epidemic forwarding has been used in [23] for VANETs for data dissemination. Recently in [22], a method based on adaptive compression of vectors has been proposed to reduce the overhead involved in exchange of summary vectors and request vectors and their storage.…”

Modeling and simulating traffic congestion propagation in connected vehicles driven by temporal and spatial preference

“…Connected vehicles [3] are a new-emerging technology to solve and ease the traffic congestion, in which vehicles are equipped with radio devices to communicate with each other in a certain range [4][5][6][7], and thus can offer a feasible opportunity to improve traffic safety and pass efficiency through the continuous information exchange between vehicles and between vehicles and infrastructure [8][9][10][11][12]. Therefore, the connected vehicles enable the sharing of traffic-congestion information and help to plan path in advance.…”