Free roaming mobile agent [D. Xu, L. Harn, M. Narasimhan, J. Luo. ''An Improved Free-Roaming Mobile Agent Security Protocol against Colluded Truncation Attacks.'' In Proceedings of the 30th Annual international Computer Software and Applications Conference(COMPSAC,06), Volume 2, Page(s):309-314,Chigago, Sept. 2006, IEEE Computer Society Press.; S. Venkatesan, C. Chellappan, ''Protecting free roaming mobile agent against multiple colluded truncation attacks'', In proceedings of the 3rd International conference on Mobile Multimedia Communication (Mobimedia'07), page(s): 293-297, August 2007.] is to collect information from more number of remote host using the shortest route. The routing table available in the router is not applicable for the free roaming mobile agent to roam around the network, so each and every server must have the routing information. This paper proposes a model to generate the routing table for the free roaming mobile agent to roam around the network by calculating the link cost between the nodes. Link cost between the servers is measured by the energy consumed to reach the destination. Link cost is measured by the transmission of agent instead of sending the message because here the route is calculated for agent roaming. The cost for transferring the message and the agent differs because of the migration and transfer. In agent transmission, the whole thing will be migrated to the remote host. But in the message transmission, the particular message is transmitted. Routing table in the destination will be generated automatically by the mobile agent while it visits the destination host and the routing table of the source host will be generated after the agent returns to its home (source host).
[1]
Ruibing Hao,et al.
An approach to accelerate convergence for path vector protocol
,
2002,
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[2]
Lein Harn,et al.
An Improved Free-Roaming Mobile Agent Security Protocol against Colluded Truncation Attacks
,
2006,
30th Annual International Computer Software and Applications Conference (COMPSAC'06).
[3]
Suresh Singh,et al.
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
,
1998,
CCRV.
[4]
C. Chellappan,et al.
Protecting free-roaming mobile agent against multiple colluded truncation attacks
,
2007,
Mobimedia 2007.
[5]
Eric C. Rosen,et al.
The New Routing Algorithm for the ARPANET
,
1980,
IEEE Trans. Commun..
[6]
Ichiro Satoh.
Adaptive protocols for agent migration
,
2001,
Proceedings 21st International Conference on Distributed Computing Systems.
[7]
Sung-Ju Lee,et al.
Dynamic load-aware routing in ad hoc networks
,
2001,
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[8]
Janelle J. Harms,et al.
Load-sensitive routing for mobile ad hoc networks
,
2001,
Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).