This paper proposes VADD (Vehicle-Assisted Data Delivery) protocols for efficient data delivery in vehicular ad hoc networks (VANETs). VADD leverages predictable vehicle mobility, based on traffic patterns and road layouts, to forward packets to the best road with the lowest delivery delay. The protocols use the "carry and forward" approach, where vehicles carry packets until a new vehicle moves into their vicinity to forward them. Three VADD protocols are proposed: L-VADD (Location First Probe), D-VADD (Direction First Probe), and H-VADD (Hybrid Probe). L-VADD may suffer from routing loops, while D-VADD avoids loops but may have longer delivery delays. H-VADD combines the advantages of both, using L-VADD for low-density scenarios and D-VADD for loop recovery. The paper evaluates the performance of these protocols against existing solutions such as DSR, epidemic routing, and GPSR. Experimental results show that VADD protocols outperform existing solutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. H-VADD, in particular, achieves the best performance, with a significantly higher packet-delivery ratio and lower delay compared to other protocols. The VADD protocols are designed to handle sparsely connected networks, where end-to-end connections are difficult to establish. By using predictable vehicle mobility and dynamic path selection, VADD ensures efficient data delivery in VANETs, even in scenarios where wireless infrastructure is unavailable or damaged. The protocols are evaluated in a simulated environment with varying data-sending rates and vehicle densities, demonstrating their effectiveness in different network conditions.This paper proposes VADD (Vehicle-Assisted Data Delivery) protocols for efficient data delivery in vehicular ad hoc networks (VANETs). VADD leverages predictable vehicle mobility, based on traffic patterns and road layouts, to forward packets to the best road with the lowest delivery delay. The protocols use the "carry and forward" approach, where vehicles carry packets until a new vehicle moves into their vicinity to forward them. Three VADD protocols are proposed: L-VADD (Location First Probe), D-VADD (Direction First Probe), and H-VADD (Hybrid Probe). L-VADD may suffer from routing loops, while D-VADD avoids loops but may have longer delivery delays. H-VADD combines the advantages of both, using L-VADD for low-density scenarios and D-VADD for loop recovery. The paper evaluates the performance of these protocols against existing solutions such as DSR, epidemic routing, and GPSR. Experimental results show that VADD protocols outperform existing solutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. H-VADD, in particular, achieves the best performance, with a significantly higher packet-delivery ratio and lower delay compared to other protocols. The VADD protocols are designed to handle sparsely connected networks, where end-to-end connections are difficult to establish. By using predictable vehicle mobility and dynamic path selection, VADD ensures efficient data delivery in VANETs, even in scenarios where wireless infrastructure is unavailable or damaged. The protocols are evaluated in a simulated environment with varying data-sending rates and vehicle densities, demonstrating their effectiveness in different network conditions.