Efficient data dissemination in cooperative multi-RSU Vehicular Ad Hoc Networks (VANETs)

Ali, G. G. Md. Nawaz; Chong, J. Michael; Samantha, Syeda Khairunnesa; Chan, Edward

doi:10.1016/j.jss.2016.04.005

Cited by 72 publications

(8 citation statements)

References 37 publications

(67 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The performance difference between EDF and SIN becomes more significant with an increase workload. The observations are consistent with the results reported in previous studies [9,50].…”

Section: Performance Evaluationsupporting

confidence: 94%

Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast

et al. 2019

View full text Add to dashboard Cite

On-demand broadcast is a scalable approach to disseminating information to a large population of clients while satisfying dynamic needs of clients, such as in vehicular networks. However, in conventional broadcast approaches, only one data item can be retrieved by clients in one broadcast tick. To further improve the efficiency of wireless bandwidth, in this work, we conduct a comprehensive study on incorporating network coding with representative on-demand scheduling algorithms while preserving their original scheduling criteria. In particular, a graph model is derived to maximize the coding benefit based on the clients’ requested and cached data items. Furthermore, we propose a heuristic coding-based approach, which is applicable for all the on-demand scheduling algorithms with low computational complexity. In addition, based on various application requirements, we classify the existing on-demand scheduling algorithms into three groups—real-time, non-real-time and stretch optimal. In view of different application-specific objectives, we implement the coding versions of representative algorithms in each group. Extensive simulation results conclusively demonstrate the superiority of coding versions of algorithms against their non-coding versions on achieving their respective scheduling objectives.

show abstract

“…The performance difference between EDF and SIN becomes more significant with an increase workload. The observations are consistent with the results reported in previous studies [9,50].…”

Section: Performance Evaluationsupporting

confidence: 94%

Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Nawaz Ali et al imitated an enhanced cooperative load balancing approach that utilized the residual bandwidth of neighboring RSUs to prevent network overload ( 17 ). Both the RSU and onboard unit have a limited transmission and reception range that affected the connection time and packet loss.…”

Section: Literature Reviewmentioning

confidence: 99%

A Low-Cost Real-World Planning Strategy for Deploying a Dedicated Short-Range Communications Roadside Unit on a Highway Off-Ramp

Walker

Heaslip

2018

Transportation Research Record

View full text Add to dashboard Cite

The deployment of dedicated short-range communications (DSRC) roadside units (RSUs) allows a connected or automated vehicle to acquire information from the surrounding environment, such as a traffic light’s signal phase and timing, using vehicle-to-infrastructure communication. Several scholarly papers exist on planning strategies for DSRC RSU deployments using simulation without accounting for wireless communication constraints and environmental changes. This paper proposes an empirical-based planning strategy for a highway off-ramp in a real-world environment. The research goal focuses on developing a low-cost and structured deployment plan for DSRC RSUs with the following objectives: use free planning tools; apply the deployment strategy in a real-world environment; utilize publicly available DSRC RSU data measurements; and leverage existing intelligent transportation systems infrastructure when possible. The proposed planning strategy includes three steps: (1) conduct a virtual site survey, (2) gather baseline performance data for the DSRC RSU equipment, and (3) generate a predictive radio frequency signal. The planning strategy was successfully applied on a highway off-ramp at exit 19A of the Capital Beltway, which encircles Washington, DC.

show abstract

“…The results presented by authors suggest that the cooperative scheme helped in saving the bandwidth. Ali et al [40] proposed an another co-operative technique. The co-operative load balancing technique used the residual bandwidth to reduce the request drop rates in communication.…”

Section: Zone Formation-basedmentioning

confidence: 99%

“…t C H = t request (36) t RSU = t request (37) T T request = 3 × t request (38) T T reply = T T request (39) T T = T T request + T T reply (40) T T = 6 × t request (41) In the worst case, total time taken is equal to six times the time required to transmit a message from one vehicle to other vehicle.…”

Section: Algorithmmentioning

confidence: 99%

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

2016

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) have emerged as fast growing networks with aims to provide safety, and comfort to the onboard passengers. But, in this environment reliable data dissemination to the destination nodes is one of the biggest challenges as there may be a congestion in the network due to blind flooding of messages to their final destination, called as broadcast storm which may lead to the performance degradation with respect to the metric such as-message delivery, reliability and response time.To address this issue, in this paper, we propose a reliabilityaware intelligent data dissemination protocol for broadcast storm problem in VANETs. We have solved the above specified problem using game theory concepts in which players, strategy space and decisions with respect to the current state of the system. To reduce the message overhead with respect to the communication cost among the players of the game, in the proposed scheme, messages are routed to the next destination by selecting the most reliable path in an intelligent manner. A coalition game is formulated among the vehicles by considering vehicles as the players in the game. Each player in the game has an initial payoff value based upon the parameters such as-communication range, storage requirements, and computation power. Based upon the payoff value of the players in the game, different coalitions/clusters are formulated among the players in the proposed scheme. Then, the players send the messages to the other vehicles/players within B Neeraj Kumar the same coalition which increases the reliability of transmission. In the proposed scheme, messages are unicasted to their final destination in an intelligent manner. Different algorithms are designed for coalition formation, maintenance, and reliability-aware data dissemination. The performance of the proposed scheme is evaluated using various evaluation metrics such as-service time, packet delivery ration, and throughput. The results obtained prove the effectiveness of the proposed scheme as compared to the other state-of-the-art existing schemes.

show abstract

Efficient data dissemination in cooperative multi-RSU Vehicular Ad Hoc Networks (VANETs)

Cited by 72 publications

References 37 publications

Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast

Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast

A Low-Cost Real-World Planning Strategy for Deploying a Dedicated Short-Range Communications Roadside Unit on a Highway Off-Ramp

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

Contact Info

Product

Resources

About