DST-A routing protocol for Ad Hoc networks using distributed spanning trees

S. Radhakrishnan, Gopal Racherla, Chandra N. Sekharan, N. S.V. Rao, Steven G. Batsell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

48 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication1999 IEEE Wireless Communications and Networking Conference, WCNC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1543-1547
Number of pages5
ISBN (Electronic)0780356683
DOIs
StatePublished - 1999
Event1st IEEE Annual Wireless Communications and Networking Conference, WCNC 1999 - New Orleans, United States
Duration: Sep 21 1999Sep 24 1999

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
Volume3
ISSN (Print)1525-3511

Conference

Conference1st IEEE Annual Wireless Communications and Networking Conference, WCNC 1999
Country/TerritoryUnited States
CityNew Orleans
Period09/21/9909/24/99

Fingerprint

Dive into the research topics of 'DST-A routing protocol for Ad Hoc networks using distributed spanning trees'. Together they form a unique fingerprint.

Cite this