Cart (Loading....) | Create Account
Close category search window
 

Reliable and Efficient Broadcasting in Vehicular Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ros, F.J. ; DIIC, Univ. of Murcia, Murcia ; Ruiz, P.M. ; Stojmenovic, I.

Most of the envisioned services over vehicular networks need to deliver information to all vehicles inside a certain region. Several such broadcasting protocols have been reported so far, but surprisingly only one of them addresses the issue of intermittent connectivity. In this paper, we present a broadcast protocol which is suitable for a wide range of vehicular scenarios and traffic conditions. The protocol employs local position information acquired via periodic beacon messages. Beacons are used by cars to decide whether or not they belong to a connected dominating set (CDS). Vehicles in the CDS use shorter waiting period before possible retransmissions. Identifiers of circulated broadcast messages are added to beacons as piggybacked acknowledgements. When waiting timeout expires, vehicle retransmits if it has at least one neighbor which did not acknowledge circulated message with the last beacon, and sets a new waiting period. Our algorithm does not depend on any parameter or threshold which varies its operation. Despite its simplicity, the protocol is shown to provide high reliability and efficiency by means of a simulation-based performance evaluation. It also greatly outperforms the only competing algorithm we found in the literature which explicitly considers different mobility scenarios.

Published in:

Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th

Date of Conference:

26-29 April 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.