By Topic

A distributed routing algorithm for multihop packet radio networks with uni- and bi-directional links

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

1 Author(s)
C. A. Pomalaza-Raez ; Dept. of Eng., Purdue Univ., West Lafayette, IN, USA

Multihop packet radio networks require routing algorithms which are distributed in nature and which have the ability to timely detect changes in the network topology. These changes are mostly changes in connectivity caused by link or node failures and by the relative motion of the nodes. This paper describes and analyzes an adaptive decentralized routing algorithm for packet radio networks. The network connectivity, as perceived by each node, is translated into a graph representation of the network. The proposed routing mechanism then uses a breadth-first search algorithm along the inbound links of such a graph. Unlike most of the algorithms found in the open literature the one proposed here can be used in networks having both uni- and bi-directional radio links. Examples are shown to illustrate the methodology

Published in:

IEEE Transactions on Vehicular Technology  (Volume:44 ,  Issue: 3 )