Hashing-based lookup service with multiple anchor cluster distribution system in MANETs

This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By exploiting a multi-hop clustering topology, we avoid the empty region problem of grid system and eliminate the need of costly and energy-consuming GPS device. First, we introduce a new size-based hash function, rather than the uniform hash function which is used by most of previous home region based lookup services. Then, we allow multiple bindings between one node and lookup servers, namely anchor cluster-heads which are scattered evenly in the networks by the multiple anchor cluster distribution algorithm. Our extensive performance evaluation confirms that these procedures result in an extremely low communication overhead and a significant reduction of querying delay time. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios.