An Improved Method in Peer-To-Peer System?

Rumor Riding (RR) is a lightweight and non-path-based mutual anonymity protocol for P2P systems In RR, an initiator encrypts the query message with a symmetric key, and then sends the key and the cipher text to different neighbors. The key and the cipher texts take random walks separately in the system, where each walk is called a rumor. Employing a random walk concept, RR issues key rumors and cipher rumors separately, and expects that they meet in some random peers. Once a key rumor and a cipher rumor meet at some peer, the peer is able to recover the original query message and act as an agent to issue the query for the initiator. The agent peer is known as a sower. RR provides a high degree of anonymity and outperforms existing approaches in terms of reducing the traffic overhead and processing latency. The disadvantage is the time taken to send and receive the data. It is overcome by increasing the speed of the existing system. A message digest algorithm is used for sending the request to the responder. It improves the speed of the system.