Abstract
We investigated performance of localized distance-sensitive service discovery algorithm iMesh, which generates information structure in static network, to store the information about nearby actors (service providers). In a network with grid structure, this is achieved by advertising service provider positions in four geographical directions. The propagation of information about remote service providers is restricted by a blocking rule, to reduce the message overhead and provide distance sensitivity. A node requiring service (service consumer) conducts lookup process to obtain information about nearby service providers from the iMesh structure. We modified iMesh to enable its use in dense networks with topologies other than grid by introducing iMesh areas instead of iMesh edges. Our simulations compare performance of modified iMesh with another localized service discovery scheme (quorum) in dense networks with random topologies. We show that iMesh finds the nearest service provider in >95% of cases. It significantly decreases the message overhead compared to quorum, without compromising quality of service discovery.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Li, X., Santoro, N., Stojmenovic, I.: Localized Distance-Sensitive Service Discovery in Wireless Sensor and Actor Networks. IEEE Transactions on Computers 58(9), 1275–1288 (2009)
Stojmenovic, I., Liu, D., Jia, X.: A scalable quorum based location service in ad hoc and sensor networks. International Journal of Communication Networks and Distributed Systems 1(1) (2008) (invited paper)
Nayak, A., Stojmenovic, I.: Wireless Sensor and Actuator Networks - Algorithms and Protocols for Scalable Coordination and Data Communication. John Wiley & Sons, ISBN-13: 978-0-470-17082-3
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. ACM Wireless Networks 7(6), 609–616 (2001)
Noor Mian, A., Baldoni, R., Beraldi, R.: A Survey of Service Discovery Protocols in Multihop Mobile Ad Hoc Networks. IEEE Pervasive Computing 8(1), 66–74 (2009)
Ververidis, G., Polyzos, C.: Service discovery for mobile Ad Hoc networks: a survey of issues and techniques. IEEE Communications Surveys & Tutorials 10(3), 30–45 (2008)
Aydin, I., Shen, C.C.: Facilitating match-making service in ad hoc and sensor networks using pseudo quorum. In: IEEE ICCCN (2002)
Sarkar, R., Zhu, X., Gao, J.: Double rulings for information brokerage in sensor networks. IEEE/ACM Trans. Netw. 17(6), 1902–1915 (2009)
Funke, S., Guibas, L.J., Nguyen, A., Wang, Y.: Distance-Sensitive Information Brokerage in Sensor Networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 234–251. Springer, Heidelberg (2006)
Li, J., Jannotti, J., Couto, D.S.J.D., Karger, D.R., Morris, R.: A Scalable Location Service for Geographic Ad Hoc Routing. In: Proc. ACM MobiCom, pp. 120–130 (2000)
Ratnasamy, S., Karp, B., Yin, L., Yu, F.: GHT: A Geographic Hash Table for Data-Centric Storage. In: Proc. Intl Workshop on Wireless Sensor Networks and Applications, WSNA, pp. 78–87 (2002)
Tchakarov, J.B., Vaidya, N.H.: Efficient Content Location in Wireless Ad Hoc Networks. In: Proc. IEEE Intl Conf. Mobile Data Management, MDM, pp. 74–85 (2004)
Fang, Q., Gao, J., Guibas, L.J.: Landmark-Based Information Storage and Retrieval in Sensor Networks. In: Proc. IEEE INFOCOM, pp. 286–297 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lukic, M., Mezei, I. (2012). Distributed Distance Sensitive iMesh Based Service Discovery in Dense WSAN. In: Li, XY., Papavassiliou, S., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2012. Lecture Notes in Computer Science, vol 7363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31638-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-31638-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31637-1
Online ISBN: 978-3-642-31638-8
eBook Packages: Computer ScienceComputer Science (R0)