By Topic

A Distributed Routing Algorithm Based on the Reliable Path

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
$33 $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)
Zan Ma ; Sch. of Electron. Inf. Eng., BUAA, Beijing, China ; Zhen Xu ; Liyang Rui

In this paper we present a distributed routing algorithm based on the reliable path to improve the efficiency of routing protocols in ad hoc network. This protocol takes advantage of the graphical information, velocity and position, to acquire the link lifetime. When the link is broken, the routing information is updated at once. Moreover, one neighbor with the fewest hops to the destination and relatively greater link lifetime is used to forward messages without transmission back-off delay as the next hop. The experimental results show that DBRP can deliver messages more reliably and more quickly compared to SSR.

Published in:

2009 5th International Conference on Wireless Communications, Networking and Mobile Computing

Date of Conference:

24-26 Sept. 2009