Abstract
An interesting and useful application in ad hoc wireless mobile community is searching and locating information in a distributed and decentralized manner. Locating and collecting information in a highly dynamic network while minimizing the consumption of scarce resources such as bandwidth and energy is the main challenge in this domain. In this paper we present a radically new location aided content searching mechanism that can determine the location and the content as well of the information searched that incurs minimum overhead. Here we have used a stable geographically clustered network that enables us to distribute the search message in a location-aided manner. In disastrous scenarios the access of emergency information, services or resources is considered to be of special interest to the user groups. Mobile terminals are there to gather information from sensors and other sources. The location-Aided content searching mechanism discussed here is concerned with efficiently delivering this information together with the geographical location of the information to the person in the field on need basis. The mobility tolerant clusters structures are used to lower the proactive traffic while minimizing the query cost. We present results from detailed simulations that demonstrate the efficiency of our mechanism and discuss the scalability of this model to larger networks.
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
Bhaumik, P., Bandhopadhyay, S.: A Mobility Tolerant Cluster Management Protocol with Dynamic Surrogate Cluster-heads for A Large Ad Hoc Network. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, Springer, Heidelberg (2006)
Alan, D., Amis Ravi Prakash Thai, H.P., Huynh, V.D.T.: Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In: IEEE INFOCOM (March 2000)
Basagni, S., Chlamtac, I., Syrotiuk, V.R., Woodward, B.A.: A distance routing effect algorithm for mobility (DREAM). In: Proc. MOBICOM, pp. 76–84 (1998)
Chen, H., Joshi, A., Finin, T.W.: Dynamic service discovery for mobile computing: intelegellent agents meet jinni in the aether. Cluster Computing 4(4), 343–354 (2001)
Gribble, S.D., Welsh, M., von Behren, J.R., Brewer, E.A., Culler, D.E., Borisov, N., Czerwinski, S.E., Gummadi, R., Hill, J.R., Joseph, A.D., Katz, R.H., Mao, Z.M., Ross, S., Zhao, B.W.: The ninja architecture for robust internet- scale systems and services. Computer Networks 35(4), 473–497 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, Springer, Heidelberg (2001)
Hildrum, K., Kubiatowicz, J.D., rao, S., Zhao, B.Y.: Distributed object location in a dynamic network, Tech. Rep. UCB? CSD-02-1178 (April 2002)
Doval, D., O’Mahony, D.: Nom: Resource location and discovery for ad hoc mobile networks. In: Med-hoc-Net 2002, Sardegna, Italy (September 2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhaumik, P., Bandyopadhyay, S. (2007). A Location-Aided Content Searching Mechanism for Large Mobile Ad Hoc Network Using Geographic Clusters. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-77444-0_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77443-3
Online ISBN: 978-3-540-77444-0
eBook Packages: Computer ScienceComputer Science (R0)