Skip to main content
SpringerLink
Log in

An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In this paper we propose a Distributed Hash Table (DHT)-based peer-to-peer resource discovery protocol designed for large-scale Mobile Ad-hoc NETwork (MANET). The proposed Mobile Resource Discovery Protocol (MRDP) uses a distributed dynamic clustering algorithm to adaptively and rapidly group nodes in a MANET for resource discovery purpose, and utilizes DHTs to efficiently cache resource information in a peer-to-peer manner. We provide a probabilistic lower bound on the performance of the MRDP. We also present simulation results under different scenarios to show that MRDP has low message overheads and its performance is highly insensitive to the size of the MANET. These characteristics make MRDP suitable for large-scale MANETs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003). Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11, 17–23.

    Article  Google Scholar 

  2. Ratnasamy, S., Francis, P., Handley, M., & Karp, R. (2001). A scalable content-addressable network. In Proceedings of conference on applications, technologies, architectures, and protocols for computer communications. San Diego, CA, USA, August 2001, pp. 161–172.

  3. Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004). Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22, 41–53.

    Article  Google Scholar 

  4. Rowstron, A., & Druschel, P. (2001). Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM international conference on distributed systems platforms (Middleware). Heidelberg, Germany, November 2001, pp. 329–350.

  5. Hsieh, H. Y., & Sivakumar, R. (2004). On using peer-to-peer communication in cellular wireless data networks. IEEE Transactions on Mobile Computing 3, 57–72.

    Article  Google Scholar 

  6. Pucha, H., Das, S., & Hu, Y. (2004). Ekta: An efficient DHT substrate for distributed applications in mobile ad hoc networks. In Proceedings of the sixth IEEE workshop on mobile computing systems and applications (WMCSA). English Lake District, UK, December 2004, pp. 163–173.

  7. Caesar, M., Castro, M., Nightingale, E. B., O’Shea, G., & Rowstron, A. (2006). Virtual ring routing: Network routing inspired by DHTs. In Proceedings of ACM SIGCOMM. Pisa, Italy, September 2006, pp. 351–362.

  8. Liang, J.-C., Chen, J.-C., & Zhang, T. (2007). Mobile service discovery protocol (MSDP) for mobile ad-hoc networks. In Proceedings of IEEE Iiternational symposium on autonomous decentralized systems, special session on ad-hoc networks in automotive networking and applications (ISADS). Sedona, AZ, March 2007, pp. 352–362.

  9. Microsoft Cooperation, “Understanding universal plug and play: a white paper,” http://www.upnp.org/resources/whitepapers.asp. June 2000.

  10. Sun Microsystems, “Jini architecture specification,” http://www.sun.com/software/jini/specs/jini1.2html/jini-title.html. December 2001.

  11. Guttman, E., Perkins, C. E., Veizades, J., & Day, M. (1999). Service location procotol, version 2. IETF RFC 2608, June 1999.

  12. Bluetooth Specification Part E (1999). Service discovery protocol (SDP). http://www.bluetooth.com. November 1999.

  13. Klemm, A., Lindemann, C., & Waldhorst, O. P. (2003) A special-purpose peer-to-peer file sharing system for mobile ad hoc networks. In Proceedings of IEEE vehicular technology conference. Orlando, FL, USA, 2003, pp. 2758–2763.

  14. Chakraborty, D., Joshi, A., Yesha, Y., & Finin, T. (2002). GSD: A novel group-based service discovery protocol for MANETs. In Proceedings of the 4th international workshop on mobile and wireless communications network. Stockholm, Sweden, September 2002, pp. 140–144.

  15. Cheng, L. (2004). Service advertisement and discovery in mobile ad hoc networks. In Proceedings of conference on computer supported cooperative work (CSCW), 2004. [Online]. Available: http://citeseer.ist.psu.edu/article/cheng02service.html.

  16. Kozat, U. C., & Tassiulas, L. (2003). Network layer support for service discovery in mobile ad hoc networks. In Proceedings of IEEE INFOCOM. San Francisco, CA, USA, April 2003, pp. 1965–1975.

  17. Araujo, F., Rodrigues, L., Kaiser, J., Liu, C., & Mitidieri, C. (2005). CHR: A distributed hash table for wireless ad hoc networks. In Proceedings of the 25th IEEE international conference on distributed computing systems workshops. Columbus, OH, USA, June 2005, pp. 407–413.

  18. Delmastro, F. (2005). From Pastry to CrossROAD: Cross-layer ring overlay for ad hoc networks. In Proceedings of the third IEEE international conference on pervasive computing and communications workshops (PerCom). Kauai, HI, USA, March 2005, pp. 60–64.

  19. Fiore, M., Casetti, C., & Chiasserini, C.-F. (2007). Efficient retrieval of user contents in MANETs. In Proceedings of IEEE INFOCOM. Anchorage, AK, USA, May 2007, pp. 10–18.

  20. Amis, A. D., Prakash, R., Vuong, T. H. P., & Huynh, D. T. (2000). Max-min d-cluster formatin in wireless ad hoc networks. In Proceedings of IEEE INFOCOM. Tel Aviv, Israel, March 2000, pp. 32–41.

  21. Karger, D., Lehman, E., Leighton, F., Levine, M., Lewin, D., & Panigraphy, R. (1997). Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the 29th annual ACM symposium on theory of computing. El Paso, TX, USA, May 1997, pp. 654–663.

  22. Zhao, M., & Wang, W. (2006). A novel semi-markov smooth mobility model for mobile ad hoc networks. In Proceedings of IEEE GLOBECOM. San Francisco, CA, USA, November 2006, pp. 1–5.

Download references

Acknowledgment

This work was sponsored in part by National Science Council (NSC) under the grant number 98-2221-E-009-187-MY3.

Author information

Authors and Affiliations

  1. Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan

    Jui-Chi Liang

  2. Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan

    Jyh-Cheng Chen

  3. Applied Research, Telcordia Technologies, Piscataway, NJ, 08854, USA

    Tao Zhang

Authors
  1. Jui-Chi Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jyh-Cheng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jyh-Cheng Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, JC., Chen, JC. & Zhang, T. An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks. Wireless Netw 17, 437–452 (2011). https://doi.org/10.1007/s11276-010-0289-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-010-0289-4

Keywords

Search

Navigation