Agent-Based Distance Vector Routing

Amin, Kaizar; Mayes, John T.; Mikler, Armin R.

doi:10.1007/3-540-44651-6_5

Cited by 20 publications

(12 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If so it dies; else it extends its life time and continues its quest into the network. Alternative approaches involve using pheromones [10] or modelling such a system based on an artificial immune system [11]. In our implementation of the Gaber and Bakhouya resource discovery algorithm [9], we have used a robot that acts as a requestor as shown in Figure 2.…”

Section: Methodsmentioning

confidence: 99%

Typhon - A Mobile Agents Framework for Real World Emulation in Prolog

Matani

Nair

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we present a mobile agent framework nicknamed Typhon, based on LPA Prolog's Chimera agent system, which allows users to go in for rapid emulation of algorithms and test beds rather than their mere simulation. This framework provides for agent migration, cloning, payload carrying abilities, state saving and security and also facilitates a reduced deployment time. The framework allows users to exploit the intelligence programming abilities of Prolog and integrate them with the inherent parallelism exhibited by mobile agents. To portray the versatility of the system we describe implementations of a typical resource discovery application for a robot tethered to a node in a network.

show abstract

Section: Methodsmentioning

confidence: 99%

Typhon - A Mobile Agents Framework for Real World Emulation in Prolog

Matani

Nair

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A mobile agent is a program that can move between sites (i.e., peers) of the network and perform computations at these sites on behalf of a user or an application [12]. Several applications have shown clear evidence of benefiting from the use of mobile agents such as electronic trading, distributed information retrieval, information dissemination, and resource discovery and composition [1,3,11,15,32].…”

Section: Unstructured Architecturesmentioning

confidence: 99%

A Query Routing Approach Based on Users’ Satisfaction for Resource Discovery in Service-Oriented Networks

Bakhouya

Gaber

2009

World Wide Web

View full text Add to dashboard Cite

Service oriented networks are distributed computing infrastructures that provide widely distributed resources. These networks are dynamic and their size and complexity continue to increase and allow to users a ubiquitous access to available resources and services. Therefore, efficient query routing approaches in large and highly distributed service oriented networks are required and need to be adaptive in order to cope with a dynamically changing environment. In this paper, a query routing approach based on mobile agents and random walks with a reinforcement learning technique is presented. By enhancing random walks with a reinforcement learning mechanism centered on users' satisfaction, this approach allows dynamic and self-adaptive location of required resources. Peers incorporate knowledge from past and present queries which will be used during next searches by mobile agents to select their next hops. This approach is analyzed through two query routing techniques using the network simulator ns2.

show abstract

“…An example of agent-based routing is the Agent-based Distance Vector Routing (ADVR) [61]. It is introduced in 2001 as a generalized distributed distance vector routing algorithm in which network data is moved about by independent agents.…”

Section: Agent-based Routingmentioning

confidence: 99%

Termite: A swarm intelligent routing algorithm for mobilewireless Ad-Hoc networks

Wicker

Roth

2006

Studies in Computational Intelligence

View full text Add to dashboard Cite

A biologically inspired algorithm is presented to route messages in mobile wireless ad-hoc networks. Such computer networks are primarily characterized by their quickly changing topologies due to frequent node mobility. The principles of swarm intelligence are used to define a probabilistic algorithm for which routing through paths of maximum utility is an emergent property. This adaptive algorithm, dubbed Termite, uses stigmergy to reduce the amount of control traffic needed to maintain performance. Strong routing robustness is achieved through the use of multiple paths; each packet is routed randomly and independently. Once the basic operation of Termite is verified, alternative metric estimation techniques are tested via simulation. Optimal system parameters are selected by testing over orders of magnitude. A simple analytical model is built in order to explain the simulation results. The model also used to propose two heuristics for determining the optimal pheromone decay rate. All of the enhancements to Termite, now known as ReTermite, are consolidated and tested against Ad-hoc On-demand Distance Vector (AODV), a leading ad-hoc routing algorithm. ReTermite is shown to be superior in many primary metrics and the reasons for this explained. Previous heuristic models are also compared to simulation results.

show abstract

Agent-Based Distance Vector Routing

Cited by 20 publications

References 5 publications

Typhon - A Mobile Agents Framework for Real World Emulation in Prolog

Typhon - A Mobile Agents Framework for Real World Emulation in Prolog

A Query Routing Approach Based on Users’ Satisfaction for Resource Discovery in Service-Oriented Networks

Termite: A swarm intelligent routing algorithm for mobilewireless Ad-Hoc networks

Contact Info

Product

Resources

About