Abstract
This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By exploiting a multi-hop clustering topology, we avoid the empty region problem of grid system and eliminate the need of costly and energy-consuming GPS device. First, we introduce a new size-based hash function, rather than the uniform hash function which is used by most of previous home region based lookup services. Then, we allow multiple bindings between one node and lookup servers, namely anchor cluster-heads which are scattered evenly in the networks by the multiple anchor cluster distribution algorithm. Our extensive performance evaluation confirms that these procedures result in an extremely low communication overhead and a significant reduction of querying delay time. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios.
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
Pham, N.D., Choo, H.: Energy Efficient Expanding Ring Search for Route Discovery in MANETs. In: Proceedings of the IEEE International Conference on Communications, pp. 3002–3006 (2008)
Erikson, J., Faloutsos, M., Krishnamurthy, S.V.: DART: Dynamic Address Routing for Scalable Ad Hoc and Mesh Networks. IEEE/ACM Transactions on Networking 15(1), 119–132 (2007)
Woo, S.C., Singh, S.: Scalable routing protocol for ad hoc networks. Wireless Networks 7, 513–529 (2001)
Cheng, H., Cao, J., Chen, H.H.: GRLS: Group-based Location Service in Mobile Ad hoc Networks. In: Proceedings of the IEEE International Conference on Communications, pp. 4734–4740 (2007)
Camp, T., Boleng, J., Wilcox, L.: Location Information Services in Mobile Ad hoc Networks. In: Proceedings of the IEEE International Conference on Communications, pp. 3318–3324 (2002)
Kasemann, M., et al.: A reactive location service for mobile ad hoc networks. NEC Network Laboratories NL-E Heidelberg. Tech. Rep. TR-02-014 (November 2002)
Leng, S., Zhang, L., Fu, H., Yang, J.: A Novel Location-Service Protocol Based on k-Hop Clustering for Mobile Ad Hoc Networks. IEEE Transactions on Vehicular Technology 56(2), 810–817 (2007)
Yu, J.Y., Chong, P.H.J.: A survey of Clustering schemes for Mobile Ad hoc Networks. IEEE Communication Surveys and Tutorials 7(1), 32–48 (2005)
Yu, J.Y., Chong, P.H.J.: 3hBAC(3-hop between adjacent cluster-heads): A novel Non-overlapping Clustering Algorithm for Mobile Ad hoc networks. In: IEEE Pacific Rim Conference on Communication, Computers and Signal Processing, August 2003, pp. 318–321 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeong, J. (2011). Hashing-Based Lookup Service with Multiple Anchor Cluster Distribution System in MANETs. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21898-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-21898-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21897-2
Online ISBN: 978-3-642-21898-9
eBook Packages: Computer ScienceComputer Science (R0)