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

Reliable and Efficient Alarm Message Routing in VANET

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)
Hao Jiang ; Sch. of Electron. Inf., Wuhan Univ., Wuhan ; Hao Guo ; Lijia Chen

In this paper, a reliable and efficient alarm message broadcast routing is proposed for VANET. Unlike other similar routing algorithms, REAR is based on the real wireless channel in VANET. REAR uses less broadcast packets to propagate alarm message. According to the theory model of wireless channel, it estimates the receipt probability of alarm messages for nodes. The contention scheme based on the receipt probability is used to select the optimized relay. Two approaches for utilizing the receipt probability and three functions for calculating contention delay are discussed and analyzed. The simulation and theory analysis are confirmed that REAR has a higher reliability and uses less broadcast packets than the location-based algorithm.

Published in:

Distributed Computing Systems Workshops, 2008. ICDCS '08. 28th International Conference on

Date of Conference:

17-20 June 2008

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.