KELOP: distributed key-value lookup in wireless ad hoc networks

It is critical to discover and utilized shared services and resources in wireless ad hoc networks. While wireline networks can use domain name system (DNS) to perform such key-value lookups, designing scalable key-value lookup protocols with high success rates and low message overhead in the dynamic topologies of wireless ad hoc networks presents a nontrivial challenge. In this paper, we present KELOP, a key-value lookup protocol for wireless ad hoc networks. KELOP is a fully distributed best-effort protocol that relies only on the local information stored at each node to locate the closest estimates of the target. This strategy results in remarkably low control-message overhead. Simulation results show that, in addition to low message overhead, KELOP is able to provide lookup success rate close to 100% in most cases.

[1]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[2]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[3]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[4]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[5]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Leandros Tassiulas,et al.  Network layer support for service discovery in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Baochun Li,et al.  Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[9]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[10]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.