ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

2016 ◽  
Vol 64 (3) ◽  
pp. 439-458 ◽  
Author(s):  
Amit Dua ◽  
Neeraj Kumar ◽  
Seema Bawa
2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Sara Najafzadeh ◽  
Norafida Binti Ithnin ◽  
Shukor Abd Razak

This paper starts with an overview of vehicular ad hoc networks (VANETs) and their characteristics. Then this paper reviews diverse applications of VANETs and the requirements of these applications. In addition it reviews VANETs standards, different broadcasting presented in a variety of studies, and also associated issues with data dissemination in connected and fragmented vehicular networks to solve broadcast storm problem and temporary disconnected VANETs. The discussion will be about the encountered challenges and presented solutions with respect to the related issues, based on the literature and strength and weakness of each protocol.


2020 ◽  
Vol 2020 ◽  
pp. 1-14 ◽  
Author(s):  
Shujuan Wang ◽  
Qian Zhang ◽  
Shuguang Lu

Vehicular Ad hoc NETworks (VANETs) are becoming an important part of people’s daily life, as they support a wild range of applications and have great potential in critical fields such as accident warning, traffic control and management, infotainment, and value-added services. However, the harsh and stringent transmission environment in VANETs poses a great challenge to the efficient and effective data dissemination for VANETs, which is the essential in supporting and providing the desired applications. To resolve this issue, Instantly Decodable Network Coding (IDNC) technology is applied to stand up to the tough transmission conditions and to advance the performance. This paper proposes a novel admission control method that works well with any IDNC-assisted data dissemination algorithm, to achieve fast and reliable data dissemination in VANETs. Firstly, the proposed admission control strategy classifies the safety-related applications as high priority and the user-related applications as low priority. It then conducts different admission policies on these two prioritized applications’ data. An artfully designed network coding-aware admission policy is proposed to regulate the flow of low-priority data requests and to prevent the network from congestion, through comparing the vectorized distances between the data requests and the encoding packets. Moreover, the carefully planned admission strategy is benefit for maximizing the network coding opportunities by inclining to admit requests which can contribute more to the encoding clique, thus further enhancing the system performance. Simulation results approve that the proposed admission control method achieves clear advantages in terms of delay, deadline miss ratio, and download success ratio.


Author(s):  
Guilherme Maia ◽  
Leandro A. Villas ◽  
Azzedine Boukerche ◽  
Aline C. Viana ◽  
Andre L. L. Aquino ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document