An error model for inter-vehicle communications in highway scenarios at 5.9GHz
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Reliable and Efficient Alarm Message Routing in VANET
ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
Reliable Routing in Vehicular Ad Hoc Networks
ICDCSW '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops
PAWDS: A Roadmap Profile-Driven Adaptive System for Alert Dissemination in VANETs
NCA '11 Proceedings of the 2011 IEEE 10th International Symposium on Network Computing and Applications
MASCOTS '11 Proceedings of the 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
QoSHVCP: hybrid vehicular communications protocol with QoS prioritization for safety applications
ISRN Communications and Networking
A Reliability-Based Routing Scheme for Vehicular Ad Hoc Networks (VANETs) on Highways
TRUSTCOM '12 Proceedings of the 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
A Sender-Initiated Adaptive and Reliable Broadcast Scheme for VANET Safety Message
ISISE '12 Proceedings of the 2012 Fourth International Symposium on Information Science and Engineering
| Hi-index | 0.00 |
In this paper, we introduce a novel reliable and low-collision packet-forwarding scheme for vehicular ad hoc networks, based on a probabilistic rebroadcasting. Our proposed scheme, called Collision-Aware REliable FORwarding (CAREFOR), works in a distributed fashion where each vehicle receiving a packet, rebroadcasts it based on a predefined probability. This probability is manipulated by different physical factors derived from the vehicular environment, including density of the vehicles in the vicinity, distance between transmitting and receiving vehicles, and finally, transmission range of the next-hop. All these factors are combined into one probability that enables each vehicle to evaluate whether there is another vehicle that ought to be receiving this message and could be feasible if the message is rebroadcasted. The success of rebroadcast is determined based on allowing the message to travel the furthest possible distance with the least amount of packet rebroadcast collision. CAREFOR is different from other existing techniques as it accounts for the effect of the next-hop transmission in the rebroadcast decision. Simulation results show the effectiveness of our approach in terms of limited number of rebroadcasts needed with low collision probability as compared to existing techniques. Two and three-hops message retransmissions are also considered.