Chord is a peer-to-peer look up algorithm based on a distributed hash table protocol in wired IP networks, exploiting the advantage of scalability for large-scale of distributed applications. However, deploying Chord into mobile networks should be inherently accompanied with supplementary network traffics to maintain the hash key mapping rules because of a high rate of joining and leaving nodes. This paper proposes an enhanced reactive Chord for mobile networks, which can reduce network traffics and achieve fast lookup services. For this purpose, a conventional Chord is modified to act reactively, and then the table activity checking feature is devised into it, called enhanced reactive Chord. Simulation results show that the proposed Chord can decrease network traffics by an average of 41.3% maintaining same setup latency, compared with conventional Chord in mobile networks.