Abstract
Service discovery in MANET suffers from frequent service unavailability due to failures of service providers or directory nodes. Ensuring network-wide service availability by replication requires minimizing costs associated with storage, update and discovery. Existing works in MANET have not addressed these challenging issues adequately. In this paper, we propose a distributed directory-based service discovery protocol (SDP) for MANET. Our protocol works by electing top K nodes with rich resources as directories, which are then divided into multiple quorums. Services registered with a directory are replicated among its quorum members. This approach reduces replication and update costs, and guarantees network-wide service availability using the quorum intersection property. An incremental election policy is adopted to cope with directory failures. We have carried out extensive simulations and also developed a prototype system. Our performance evaluation results show that, compared with similar work, our protocol significantly reduces message cost and improves system robustness.
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.
References
Kozat, U.C., Tassiulas, L.: Service discovery in mobile ad hoc networks: an overall perspective on architectural choices and network layer support issues. Ad Hoc Networks 2(1), 23–44 (2004)
Tyan, J., Mahmoud, Q.H.: A Comprehensive Service Discovery Solution for Mobile Ad Hoc Networks. ACM/Kluwer Journal of Mobile Networks and Applications (MONET) 10(8), 423–434 (2005)
Sailhan, F., Issarny, V.: Scalable Service Discovery for MANET. In: Proc. IEEE PerCom, pp. 235–246 (2005)
Kim, M.J., Kumar, M., Shirazi, B.A.: Service Discovery Using Volunteer Nodes in Heterogeneous Pervasive Computing Environments. J. Pervasive and Mobile Computing 2, 313–343 (2006)
Pucha, H., Das, S., Hu, Y.: Ekta: An efficient DHT substrate for distributed applications in mobile ad hoc networks. In: Proc. 6th IEEE Workshop on Mobile Computing Systems and Applications, WMCSA (2004)
Zahn, T., Schiller, J.: MADPastry: A DHT substrate for practicably sized MANETs. In: Proc. 5th Workshop on Applications and Services in Wireless Networks, ASWN (2005)
Delmastro, F.: From Pastry to CrossROAD: Cross-layer ring overlay for ad hoc networks. In: Proc. 3rd IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 60–64 (2005)
Helal, S., Desai, N., Verma, V., Lee, C.: Konark—A Service Discovery and Delivery Protocol for Ad Hoc Networks. In: Proc. IEEE WCNC, pp. 2107–2113 (2003)
Chakraborty, D., Joshi, A., Finin, T., Yesha, Y.: Towards Distributed Service Discovery in Pervasive Computing Environments. IEEE Transactions on Mobile Computing (July 2004)
Raychoudhury, V., Cao, J., Wu, W.: Top K-leader Election in Wireless Ad Hoc Networks. In: ICCCN 2008 (2008)
Dijkstra, E.W., Scholten, C.S.: Termination Detection for Diffusing Computations. Info. Proc. Lett 11(1) (1980)
Lin, C.M., Chiu, G.M., Cho, C.H.: A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems. IEEE Trans. Computers 51(12), 1442–1447 (2002)
Crossbow Technology, http://www.xbow.com/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raychoudhury, V., Cao, J., Wu, W., Lai, Y., Chen, C., Ma, J. (2010). K-Directory Community: Reliable Service Discovery in MANET. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)