Reactive Chord for Wireless Networks

Peer-to-peer networking in the form of distributed hash tables (DHT) overcomes the drawbacks of unstructured P2P system by providing high scalability in the number of peers and high speed. It has to maintain its protocol using periodical messages. However, in wireless networks, it might cause serious traffics in network. This paper proposes a reactive table update method to overcome the disadvantage of DHT-based peer-to-peer system in wireless networks by reducing the number of table updates. Various simulations are executed based on Chord: a scalable peer-to-peer lookup service for Internet applications using Chord simulator of UC Berkeley. Simulation results show that the proposed reactive method can reduce greatly network traffic, compared with the conventional proactive method, on both non data request and data request situation.