Abstract
We propose a novel approach for shortest path routing in wireless mobile networks. The approach makes use of n mobile agents initially launched from n mobile nodes forming the network. The agents move randomly from node to node and update routing information as they go. The approach is presented in this paper with two protocols. Both of them exhibit good performance in terms of the network and computing resource consumptions. The first protocol relies on independent mobile agents and imposes a minimum bandwidth requirement on individual mobile agents. Each agent carries the link state of its creator and this information remains unchanged except when the mobile agent returns to the home node. The second protocol is a refinement of the first protocol, with some form of interaction between the mobile agents. Each agent maintains the routing table of its creator instead of link state. The randomly walking agents spread the update information and compute the shortest paths via exchanging network state information between the routing tables they carry and the routing tables at the nodes they traverse. The correctness of the protocols is proven. Our analysis shows that the agent cooperation improves the system performance when dealing with topology and link cost changes.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call