No abstract

I n this paper, we presen,t a routing protocol f0rfi.ding two node-disjoint paths between each pair of nodes in a computer network. I n the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology such as an adjacent n,ode on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load.The concept of spanning tree-based kernel construction is introduced t o synchronize procedures under the distributed control of the protocol. The routing scheme based on the protocol possesses the en,hanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Furthermore, even if topology changes occur iuhich damage the obtained disjoint paths, the paths themselves can be updated eficiently.

Recently sophisticated protocols for routing in ad hoc networks have been proposed, but there is still little work on service discovery in such volatile environments. In this paper a mobile agent-based scheme for service discovery in ad hoc networks is introduced. Mobile agents are traveling through the network, collecting the dynamically changing service information. The travel route and the number of travel agents are adjusted according to the information state and the change of network topology. In a quantitative analysis the proposed algorithm is compared with the flooding scheme. The usefulness of the approach is proved by an implementation for mobile devices using J2ME and Bluetooth.

No abstract

No abstract

No abstract

No abstract

No abstract