Protocol for dynamic ad-hoc networks using distributed spanning trees

Authors:
Sridhar Radhakrishnan;Gopal Racherla;Chandra N. Sekharan;Nageswara S. V. Rao;S. G. Batsell
Affiliations:
School of Computer Science, University of Oklahoma, Norman, OK;General Atomics (Photonics), 10240 Flanders Ct, San Diego, CA and School of Computer Science, University of Oklahoma, Norman, OK;Department of Computer Science, Loyola University at Chicago, Chicago, IL;Networking Laboratory, Oak Ridge National Laboratory, Oak Ridge, TN;Networking Laboratory, Oak Ridge National Laboratory, Oak Ridge, TN
Venue:
Wireless Networks
Year:
2003

Citing 7
Cited 5

Product guide

Product guide
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Signal stability based adaptive routing (SSA) for ad-hoc mobile networks

Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
PAMAS—power aware multi-access protocol with signalling for ad hoc networks

ACM SIGCOMM Computer Communication Review
Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

Wireless Networks
Internet-Based Mobile Ad Hoc Networking

IEEE Internet Computing
Software Organization for Dynamic and Adaptable Wearable Systems

ISWC '97 Proceedings of the 1st IEEE International Symposium on Wearable Computers

Diagnosing mobile ad-hoc networks: two distributed comparison-based self-diagnosis protocols

Proceedings of the 4th ACM international workshop on Mobility management and wireless access
An overlay approach to data security in ad-hoc networks

Ad Hoc Networks
A distributed fault identification protocol for wireless and mobile ad hoc networks

Journal of Parallel and Distributed Computing
A study of root driven routing protocol for wireless LAN mesh networks

WICON '07 Proceedings of the 3rd international conference on Wireless internet
System-level fault diagnosis in fixed topology mobile ad hoc networks

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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 a hold-and-forward or shuttling mechanisms. We introduce the notion of connectivity-through-time and the parameter holding-time as new fundamental concepts that can be used by ad-hoc routing algorithms. For various network connectivity scenarios we evaluate the impact of these concepts on the performance of ad-hoc routing algorithms. Using simulation, we study the throughput, reachability and message-reachability ratio of the proposed schemes under various connection/disconnection rates and holding times.