Robust broadcast scheme regardless of vehicle distribution in vehicular ad hoc networks
© Choi et al.; licensee Springer. 2014
Received: 31 January 2014
Accepted: 11 August 2014
Published: 18 August 2014
In vehicular ad hoc networks (VANETs), the efficient and reliable dissemination of emergency messages in a highly mobile environment under a dense or sparse network is a significant challenge. This paper proposes a robust broadcast scheme for VANETs, called the virtual slotted p-persistence scheme, which operates efficiently regardless of the vehicle density and distribution. Via the exchange of hello messages, each vehicle maintains position information on neighbor vehicles in a neighbor table. When a vehicle receives an emergency message, it determines its vehicle group, called a virtual slot, based on the position information in its neighbor table. The proposed scheme guarantees that the vehicles in the farthest group from the broadcaster probabilistically rebroadcast the message first. Simulation results demonstrate that the proposed scheme outperforms the slotted p-persistence scheme in terms of the end-to-end delay, collision ratio, and network overhead, regardless of the vehicle density and distribution.
KeywordsVehicular ad hoc network Broadcast storm Slotted p-persistence Virtual slotted p-persistence
Vehicular ad hoc networks (VANETs) have recently emerged as a promising field of research for increasing road safety by enabling drivers and/or vehicles to communicate with each other . Most current applications targeting VANETs rely heavily on broadcast transmissions to disseminate safety-related information, such as look-ahead emergency warnings and information about unsafe driving conditions. Yet, broadcasting messages blindly can lead to frequent transmission contentions and collisions among neighbor vehicles. This problem is known as a broadcast storm .
This paper focuses on the broadcasting of emergency messages for safety applications. When designing an efficient and reliable broadcast protocol for VANETs, the broadcast storm problem must be considered. One solution to alleviate the broadcast storm in a VANET is to have the farthest vehicle from the broadcaster perform the rebroadcasting, and various broadcast storm mitigating schemes have already been proposed in [2–12]. The weighted p-persistence scheme  and the slotted p-persistence scheme  are representative examples of these broadcast approaches. The weighted p-persistence scheme assigns a higher probability to vehicles that are located farther away from the broadcaster and the slotted p-persistence scheme divides the transmission range into a pre-determined number of slots and assigns the pre-determined probability at each slot. However, these schemes have some problems. In a dense network, multiple vehicles may rebroadcast the message simultaneously, resulting in collisions. Also, in a sparse network, the waiting time can cause a long delay before the message is rebroadcasted. These mean that the performance of existing broadcast schemes is highly dependent on the vehicle density and distribution.
Accordingly, this paper presents a robust broadcast protocol for VANETs, called the virtual slotted p-persistence scheme, which operates efficiently regardless of the vehicle density and distribution. The remainder of this paper is organized as follows. Section 2 describes related works. Section 3 explains our proposed virtual slotted p-persistence scheme. Section 4 describes the simulation environment and compares the performance of the virtual slotted p-persistence scheme and the slotted p-persistence scheme. Finally, Section 5 provides some conclusions.
2 Related works
Many algorithms have already been proposed to cope with the broadcast storm problem [2–12]. In , the broadcasting schemes are categorized into two types: sender-oriented schemes and receiver-oriented schemes. In the case of sender-oriented schemes [3–5], the sender uses neighbor position information to select the farthest vehicle as the next forwarder. The advantage of sender-oriented schemes is that only a single vehicle rebroadcasts the message. Meanwhile, receiver-based schemes [6–12] use contention to automatically select the next forwarder(s) in a distributed fashion. All the one-hop receivers of an emergency message enter a contention phase after receiving the message. After a waiting time, which is calculated using the distance from the broadcaster, the message is rebroadcast. One of representative receiver-oriented approaches is a probabilistic scheme, where vehicles rebroadcast a received message using a predetermined probability. For example, Wisitpongphan et al. proposed the weighted p-persistence scheme and slotted p-persistence scheme as probabilistic broadcast suppression techniques .
Several methods have already been proposed to enhance the slotted p-persistence scheme based on estimating the vehicle density using hello messages. In , a dynamic broadcast scheme is proposed to control the rebroadcast probability p according to the vehicle density. Meantime,  presents a scheme to adjust the number of slots dynamically according to the vehicle density. However, in real highway scenarios, the vehicle density constantly varies and the vehicles cannot be evenly distributed in slots. Therefore, neither approach can prevent unnecessary waiting delay before rebroadcasting due to empty slots, i.e. slots with no vehicles.
Accordingly, this paper proposes a robust broadcast scheme for VANETs, called the virtual slotted p-persistence scheme, which operates efficiently regardless of the vehicle density and distribution. The proposed virtual slotted p-persistence scheme uses hello messages to periodically exchange the basic information between any two vehicles. Using the information in the received hello message, each vehicle maintains its own neighbor table. When a vehicle receives an emergency message, it determines its vehicle group, called a virtual slot, based on the position information in its neighbor table. The vehicles in the farthest group from the broadcaster then probabilistically rebroadcast the message first.
3 Virtual slotted p-persistence scheme
This section introduces the basic operation of the virtual slotted p-persistence scheme that includes how to build a neighbor table, how to group vehicles, and the rebroadcasting procedure. The proposed scheme assumes that every vehicle has a GPS and knows its geographical position.
3.1 Building neighbor table using hello messages
3.2 Grouping vehicles into virtual slot and rebroadcast probability
When a vehicle receives an emergency message, it determines its vehicle group based on the position information and moving direction of the neighbor vehicles in its neighbor table. In the proposed scheme, a vehicle group is called a virtual slot, as it virtually corresponds to a slot in the slotted p-persistence scheme.
where τ is a predetermined slot time.
Equation 3 means that the rebroadcast probability is set at for each virtual slot, except for the last virtual slot, where it is set at .
3.3 Rebroadcasting procedure
4 Performance evaluation
The performance of the proposed virtual slotted p-persistence scheme was compared with that of the slotted p-persistence scheme in terms of the end-to-end delay, collision ratio, and network overhead through a simulation using ns-2 .
4.1 Simulation environments
In the simulation, the distributed coordination function (DCF) of IEEE 802.11 was used as the medium access control (MAC) protocol, which was modeled as a shared-media radio with a 1-Mbps nominal bit rate and 500-m transmission range. To evaluate how the two schemes behaved under different vehicle densities, four traffic conditions were used: 10, 25, 50, and 100 vehicles/km/lane on a 5-km road section. The emergency message was broadcast by the source vehicle every second. The slot time τ was set at 2.5 ms and the hello interval was set at 1 s. The velocity of each vehicle was randomly selected among 80, 100, and 120 km/h.
Length of road section
10, 25, 50, 100 vehicles/km/lane
80, 100, 120 km/h
Slot time (τ)
0.5, 1 (for slotted p-persistence)
The number of vehicles per slot (N s )
1, 3, 5
4.2 Performance metrics
For the performance comparison, the following metrics were used.
End-to-end delay: defined as the delay between the time the broadcast message originated at the source vehicle and the time it reached all the vehicles in the road section.
Collision ratio: defined as the ratio of the number of broadcast messages lost by collision to the total number of broadcast messages.
Network overhead: defined as the total number of broadcast messages incurred during a single broadcast.
4.3 Simulation results
To identify the impact of the number of vehicles per slot (N s ) in the virtual slotted p-persistence scheme, we also have done the simulation when N s was set at 1, 3, and 5, respectively. As shown in Figures 8 to 10, the end-to-end delay, the collision ratio, and the network overhead of the virtual slotted p-persistence scheme increased a little bit as N s increased, respectively. This is because the probability that more than two vehicles in a slot rebroadcast simultaneously increases as N s increases, resulting in more collisions. Also, the collisions will increase the end-to-end delay and network overhead.
In the slotted p-persistence scheme, the number of vehicles in a slot varies according to the vehicle distribution, yet the rebroadcast probability p is pre-determined regardless of the number of vehicles in a slot. Therefore, a small probability p can result in a long end-to-end delay in a sparse network, while a high probability p can cause more collisions in a dense network. Also, in a sparse network, the slotted p-persistence scheme can cause a long waiting time before rebroadcasting when there are no vehicles in the previous slots. However, in the virtual slotted p-persistence scheme, the number of vehicles in a virtual slot can be controlled by N s , regardless of the vehicle distribution, and the rebroadcast probability p is determined optimally according to the number of vehicles in a virtual slot.
This paper proposed a virtual slotted p-persistence scheme in which the number of vehicles in a slot can be controlled regardless of the vehicle density and distribution. Thus, in the case of a sparse network, the proposed scheme can avoid unnecessary waiting before rebroadcasting by eliminating the empty slots that occur with the slotted p-persistence scheme. Plus, in a sparse or dense network, the proposed scheme can reduce collisions by controlling both the number of vehicles in a slot and the rebroadcast probability p according to the number of vehicles. Simulation results demonstrated that the proposed scheme outperformed the slotted p-persistence scheme in terms of the end-to-end delay, collision ratio, and network overhead, regardless of the vehicle density. In the future work, we will consider the proposed scheme to apply for urban scenario.
This research was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (NRF-2013R1A1A4A01012534), and the IT R&D program of MSIP/IITP [10041145, Self-Organized Software platform (SoSp) for Welfare Devices].
- Kellerer W: Mobile communication in a heterogeneous and converged world. IEEE Pers. Commun 2001, 8: 41-47. 10.1109/98.972167View ArticleGoogle Scholar
- Tseng YC, Ni SY, Chen YS, Sheu JP: The broadcast storm problem in a mobile ad hoc network. ACM/Kluwer Wireless Netw 2002, 8: 153-167. 10.1023/A:1013763825347View ArticleGoogle Scholar
- Taleb T, Ooi K, Hashimoto K: An efficient collision avoidance strategy for ITS systems. In Proceedings of IEEE WCNC. Las Vegas; 2008:2212-2217.Google Scholar
- Shi Z, Liu F, Xu S: Novel relay scheme based on traffic type in vehicular networks. In Proceedings of ICICTA. Hunan; 2008:392-397.Google Scholar
- Lai P, Wang X, Lu N, Liu F: A reliable broadcast routing scheme based on mobility prediction for VANET. In Proceedings of IEEE Intelligent Vehicles Symposium. Xi’an; 2009:1083-1087.Google Scholar
- Tonguz OK, Parikh JS, Mudalige P, Bai F, Sadekar V, N Wisitpongphan: Broadcast storm mitigation techniques in vehicular ad hoc networks. IEEE Wireless Commun 2007, 14: 84-94.Google Scholar
- Bae JS, Kum DW, Nam JC, Choi JI, Cho YZ: Neighbor information-based broadcast scheme for VANET. In Proceedings of IEEE Asia-Pacific Conference on Communication (APCC). Jeju Island; 2012:544-545.Google Scholar
- Kum DW, Khan A, Cho YZ: Traffic density-based broadcast scheme for vehicular ad hoc networks. IEICE Trans. Commun 2012, E95B: 3875-3878.View ArticleGoogle Scholar
- Yu-Tian T, Rong-Hong J, Chien C, Chu-Fu W, Hsia-Hsin L: A vehicle-density-based forwarding scheme for emergency message broadcasts in VANETs. In Proceedings of IEEE Mobile Adhoc and Sensor Systems (MASS). San Francisco, CA; 2010:703-708.Google Scholar
- Vegni AM, Stramacci A, Natalizio E: SRB: a selective reliable broadcast protocol for safety applications in VANETs. In Proceedings of IEEE International Conf. on Selected Topics (iCOST). Avignon; 2012:89-94.Google Scholar
- Sou SI, Lee Y: SCB: store-carry-broadcast scheme for message dissemination in sparse VANET. In Proceedings of IEEE Vehicular Technology Conference (VTC). Yokohama; 2012:1-5.Google Scholar
- Tonguz OK, Wisitpongphan N, Fan B: DV-CAST: A distributed vehicular broadcast protocol for vehicular ad hoc networks. IEEE Wireless Commun 2010, 17: 47-57.View ArticleGoogle Scholar
- NS-2 . Accessed 15 September 2013 http://www.isi.edu/nsnam/ns/
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.