An agent using matrix for backward path search on MANET

Authors:
SungSoo Lee;ZhiPeng Liu;ChongGun Kim
Affiliations:
Department of Computer Engineering, Yeungnam University;Department of Computer Engineering, Yeungnam University;Department of Computer Engineering, Yeungnam University
Venue:
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Year:
2008

Citing 3
Cited 0

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

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A Matrix-Based Fast Calculation Algorithm for Estimating Network Capacity of MANETs

ICW '05 Proceedings of the 2005 Systems Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc networks is to search path from a source to a destination with an efficient routing method, which is also an important issue for delay-sensitive real-time application. A topology of the nodes interconnections in an ad hoc network can be modeled as an adjacency matrix. In this paper, we present a knowledge discovery agent to collect topology information and derive the adjacency matrix. Based on a sequence matrix calculation, we propose an effective routing algorithm Matrix-Based Backward path Search (MBBS) for route discovery from a destination to a source. The performance of MBBS and that of Breadth First Search (BFS) algorithm are compared. The research result proves that MBBS is more efficient in recognizing the route.