Randomized Adaptive Routing Based on Mobile Agents

Authors:
Marc Bui;Ajoy K. Datta;Olivier Flauzac;Dai Tho Nguyen
Affiliations:
-;-;-;-
Venue:
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
1999

Citing 0
Cited 2

Self-Stabilizing Agent Traversal

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile agent has been shown to be a convenient, efficient, and robust approach to designing distributed protocols. This paper introduces an adaptive, mobile-agents-based routing algorithm. While performing a random walk through the network, mobile agents sense changes in network state, and trigger the computation of updated values for the routing tables. The randomized moving strategy exerts a negligible and balanced impact on the network resources, both in terms of bandwidth and computation. The memory requirement is very moderate. The correctness of the protocol is proven and its complexity is analyzed.