Searching for Resources in MANETs – A Cluster Based Flooding Approach

  • Rodolfo Oliveira
  • Luis Bernardo
  • Paulo Pinto
Part of the Communications in Computer and Information Science book series (CCIS, volume 3)

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.

Keywords

Performance analysis of wireless ad hoc networks searching service clustering protocol 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernardo, L., Pinto, P.: A Scalable Location Service with Fast Update Responses. In: Proc. ICETE’04, vol. 1, pp. 39–47 (2004)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. JXTA Project, 2004. JXTA v2.0 Protocols Specification. Retrieved September 2004 from http://spec.jxta.org/nonav/v1.0/docbook/JXTAProtocols.html
  4. Ge, Z., Figueiredo, D., Jaiswal, S., Kurose, J., Towsley, B.: Modeling Peer-Peer File Systems. In: IEEE INFOCOM’2003 (2003)Google Scholar
  5. 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)Google Scholar
  6. Klingber, T., Manfredi, R.: RFC Draft of Gnutella v0.6. (2002) Retreived from http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
  7. 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)CrossRefGoogle Scholar
  8. Network simulator - ns-2. Retrieved from http://www.isi.edu/nsnam/ns/
  9. 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)Google Scholar
  10. Toh, C.-K.: Associativity-Based Routing for Ad-hoc Mobile Networks. Journal of Wireless Personal Communications 4, 103–139 (1997)CrossRefGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 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)Google Scholar
  13. Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing 3, 155–173 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Rodolfo Oliveira
    • 1
  • Luis Bernardo
    • 1
  • Paulo Pinto
    • 1
  1. 1.Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, P-2829-516 CaparicaPortugal

Personalised recommendations