Abstract
In this paper, we propose a searching service optimized for highly dynamic mobile ad-hoc networks based on a flooding approach. MANETs unreliability and routing costs prevent the use of central servers or global infra-structured services on top of a priori defined virtual overlay networks. A flooding approach over a virtual overlay network created on-demand performs better. Flooding is supported by a light-weight clustering algorithm. The paper compares the relative efficiency of two clustering approaches using 1.5-hop and 2.5-hop neighborhood information, and of a non-clustered approach. It presents a set of simulation results on the clustering efficiency and on searching efficiency for low and high mobility patterns, showing that the 1.5-hop algorithm is more resilient to load and to node movement than the 2.5-hop algorithm.
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
Bernardo, L., Pinto, P.: A Scalable Location Service with Fast Update Responses. In: Proc. ICETE’04, vol. 1, pp. 39–47 (2004)
Choi, Y., Park, D.: Associativity based clustering and query stride for on-demand routing protocol. Journal of Communications and Networks 4(1), 4–13 (2002) Korean Institute of Communications Sciences (KICS)
JXTA Project, 2004. JXTA v2.0 Protocols Specification. Retrieved September 2004 from http://spec.jxta.org/nonav/v1.0/docbook/JXTAProtocols.html
Ge, Z., Figueiredo, D., Jaiswal, S., Kurose, J., Towsley, B.: Modeling Peer-Peer File Systems. In: IEEE INFOCOM’2003 (2003)
Jacquet, P., Mülethaler, P., Clausen, T., Laouitit, A., Qayyum, A., Viennot, L.: Optimized Link State Routing Protocol for Ad Hoc Networks. In: IEEE INMIC’01, pp. 63–68. IEEE Press, Los Alamitos (2001)
Klingber, T., Manfredi, R.: RFC Draft of Gnutella v0.6. (2002) Retreived from http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
McDonald, A.B., Znati, T.F.: A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc Networks. IEEE Journal on Selected Areas in Communications 17(8), 1466–1487 (1999)
Network simulator - ns-2. Retrieved from http://www.isi.edu/nsnam/ns/
Peng, W., Lu, X.: On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks. In: MobiHoc’00, pp. 129–130. ACM Press, New York (2000)
Toh, C.-K.: Associativity-Based Routing for Ad-hoc Mobile Networks. Journal of Wireless Personal Communications 4, 103–139 (1997)
Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., Sheu, J.-P.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. Wireless Networks 8(2/3), 153–167 (2002)
Tsumochi, J., Masayama, K., Uehara, H., Yokoyama, M.: Impact of Mobility Metric on Routing Protocols for Mobile Ad Hoc Networks. In: IEEE Pacific Rim Conf. on Communications, Computers and Signal Processing (PACRIM03), pp. 322–325. IEEE Press, Los Alamitos (2003)
Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing 3, 155–173 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, R., Bernardo, L., Pinto, P. (2007). Searching for Resources in MANETs – A Cluster Based Flooding Approach. In: Filipe, J., Coelhas, H., Saramago, M. (eds) E-business and Telecommunication Networks. ICETE 2005. Communications in Computer and Information Science, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75993-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-75993-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75992-8
Online ISBN: 978-3-540-75993-5
eBook Packages: Computer ScienceComputer Science (R0)