Advertisement

Distributed Lookup in Structured Peer-to-Peer Ad-Hoc Networks

  • Raphaël Kummer
  • Peter Kropf
  • Pascal Felber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4276)

Abstract

Various peer-to-peer (P2P) architectures for ad-hoc networks have been proposed over the last few years. Most of them are unstructured and use some form of flooding to locate content, because the physical constraints of the underlying network make the construction of arbitrary application-layer overlays impractical.

In this paper, we study the problem of applying distributed hash tables (DHT) to ad-hoc networks. Our approach to efficiently lookup content in such networks exploits physical proximity of peers when establishing and maintaining the DHT based routing tables. The efficiency of our method is demonstrated by simulation of large networks.

Keywords

Distribute Hash Table Remote Node Physical Neighbor Logical Path Lookup Performance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The Gnutella (2006), web site: www.gnutella.com
  2. 2.
    The KaZaA (2006), web site: www.kazaa.com
  3. 3.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 149–160. ACM Press, New York (2001)CrossRefGoogle Scholar
  4. 4.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: SIGCOMM 2001: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 161–172. ACM Press, New York (2001)CrossRefGoogle Scholar
  5. 5.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: a self-organizing structured P2P system. SIGMOD Record 32(3), 29–33 (2003)CrossRefGoogle Scholar
  7. 7.
    Xu, J., Kumar, A., Yu, X.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas in Communications 22(1), 151–163 (2004)MATHCrossRefGoogle Scholar
  8. 8.
    Bosneag, A.M., Brockmeyer, M.: GRACE: Enabling collaborations in wide-area distributed systems. In: 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (WETICE 2005), pp. 72–77 (2005)Google Scholar
  9. 9.
    Pucha, H., Das, S.M., Hu, Y.C.: How to implement DHTs in mobile ad hoc networks? In: 10th ACM International Conference on Mobile Computing and Network (MobiCom) (2004)Google Scholar
  10. 10.
    Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353. Kluwer Academic, Dordrecht (1996)Google Scholar
  11. 11.
    Pucha, H., Das, S.M., Hu, Y.C.: EKTA: An efficient DHT substrate for distributed applications in mobile ad hoc networks. In: 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2004), pp. 163–173 (2004)Google Scholar
  12. 12.
    Zahn, T., Schiller, J.H.: MADPastry: A DHT substrate for practicably sized MANETs. In: 5th Workshop on Applications and Services in Wireless Networks (ASWN 2005) (2005)Google Scholar
  13. 13.
    Zahn, T., Schiller, J.H.: DHT-based unicast for mobile ad hoc networks. In: Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW 2006), pp. 179–183 (2006)Google Scholar
  14. 14.
    Perkins, C.E., Belding-Royer, E.M.: Ad-hoc on-demand distance vector routing. In: WMCSA, pp. 90–100 (1999)Google Scholar
  15. 15.
    Cramer, C., Fuhrmann, T.: Proximity neighbor selection for a dht in wireless multi-hop networks. In: Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, pp. 3–10 (2005)Google Scholar
  16. 16.
    Araùjo, F., Rodrigues, L., Kaiser, J., Liu, C., Mitidieri, C.: CHR: a distributed hash table for wireless ad hoc networks. In: 25th IEEE International Conference on Distributed Computing Systems Workshops, pp. 407–413 (2005)Google Scholar
  17. 17.
    Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: MobiCom 2000: Proceedings of the 6th annual international conference on Mobile computing and networking, pp. 243–254. ACM Press, New York (2000)CrossRefGoogle Scholar
  18. 18.
    Ko, Y.B., Vaidya, N.H.: Location-aided routing (LAR) in mobile ad hoc networks. Wirel. Netw. 6(4), 307–321 (2000)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Raphaël Kummer
    • 1
  • Peter Kropf
    • 1
  • Pascal Felber
    • 1
  1. 1.Computer Science DepartmentUniversity of NeuchâtelNeuchâtelSwitzerland

Personalised recommendations