Abstract
In wireless networks, mobile users may want to discover and share information about some services. In order to efficiently locate the node that stores the particular information, we use Chord, a distributed lookup protocol, to find the needed information. Each node and information will be mapped to a ring architecture which is called a Chord ring. Original Chord protocol requires a known root node to join the Chord ring. When nodes use different root nodes to join, it may cause many Chord rings to be formed simultaneously. When too many nodes join or leave the Chord ring at the same time, it may also cause a Chord ring to split into several independent ones. Information located in one Chord ring may not be discovered by users in other Chord rings. In order to solve this problem, we use the routine of mobile users' movement to let Chord rings be aware of each others. We propose a distributed solution to combine all of the small Chord rings into a big one. It provides higher scalability and service availability than the traditional solution which assigns a node called "super-peer" to one Chord ring to forward the service request messages to another to get the dedicated service if the mobile user can't find it in his own Chord ring.