Abstract
We propose a proximity-based overlay routing algorithm for accelerating the service discovery using the distributed hash table (DHT)-based peer-to-peer (P2P) overlay in mobile ad hoc networks (MANET). DHT systems are useful for resource restrained MANET devices due to the relatively low communication overhead. However, the overlay routing for service discovery is very inefficient, since overlay structure is independent of physical network topology. Our proximity-based overlay routing utilizes the wireless characteristics of MANETs. The physically closer node to destination is preferred to the logical neighbors, using information collected by 1-hop broadcast between a node and its physical neighbors. More enhancement is achieved by the shortcut generated from the service description duplication. In a detailed ns-2 simulation study, we show that the proposed scheme achieves approximately shortest physical path without additional communication overhead, and also find that it works well in the mobile environment.
This research was supported by University IT Research Center Project and Brain Korea 21 Project, The school of information technology, KAIST in 2004.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. Tech. Rep., MSR-TR-2002-82, Microsoft Research (2002)
Motegi, S., Yoshihara, K., Horiuchi, H.: Service discovery for wireless ad hoc networks. In: Int. Symp. on Wireless Pers. Multimedia Comm. (2002)
Koubaa, H., Fleury, E.: Service location protocol overhead in the random graph model for ad hoc networks. In: 7th Int. Symp. on Comp. and Comm. (2002)
Klein, M., Konig-Ries, B., Obreiter, P.: Lanes - A lightweight overlay for service discovery in mobile ad hoc networks. In: 3rd Workshop on Applications and Services in Wireless Networks (2003)
Chakraborty, D., Joshi, A., Yesha, Y., Finin, T.: GSD: A novel group-based service discovery protocol for manet. In: IEEE Conf. on Mobile and Wireless Comm. and Net. (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: ACM SIGCOMM 2001 (2001)
Datta, A.: MobiGrid: P2P overlay and MANET rendezvous - A data management perspective. In: CAiSE 2003 Doc. Symp. (2003)
Klemm, A., Lindemann, C., Waldhorst, O.P.: A Special-purpose peer-to-peer file sharing system for mobile ad hoc networks. In: IEEE VTC2003-Fall (2003)
Hu, Y.C., Das, S.M., Pucha, H.: Exploiting the synergy between peer-to-peer and mobile ad hoc networks. In: HotOS-IX: Ninth Workshop on Hot Topics in Op. Sys. (2003)
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (AODV) routing. IETF RFC 3561 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoon, HJ., Lee, EJ., Jeong, H., Kim, JS. (2004). Proximity-Based Overlay Routing for Service Discovery in Mobile Ad Hoc Networks. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive