By Topic

DST-A routing protocol for ad hoc networks using distributed spanning trees

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

5 Author(s)
S. Radhakrishnan ; Sch. of Comput. Sci., Oklahoma Univ., Norman, OK, USA ; G. Racherla ; C. N. Sekharan ; N. S. V. Rao
more authors

A dynamic ad hoc network consists of a collection of mobile hosts with frequently changing network topology. We propose a distributed algorithm that adapts to the topology by utilizing spanning trees in the regions where the topology is stable, and resorting to an intelligent flooding-like approach in highly dynamic regions of the network. Routing is performed using the spanning trees based on a hold-and-forward or shuttling method. We introduce the notion of connectivity-through-time and holding time to quantify the performance of the routing algorithms for various network connectivity scenarios. Using simulation, we study the throughput, reachability and message-reachability ratio of the proposed network under various connection/reconnection rates and holding times

Published in:

Wireless Communications and Networking Conference, 1999. WCNC. 1999 IEEE

Date of Conference: