Abstract
KNN queries, which retrieve the k nearest data items associated with a location (location-dependent data) from the location of the query issuer, are available for location-based services (LBSs) in mobile environments. Key challenges in designing system protocols for MANETs include low-overhead adaptability to network topology changes due to node mobility, and query processing that achieves high accuracy of the query result without a centralized server. In this paper, we propose the Filling Area (FA) method to process a kNN query in MANETs. To achieve a small search area, data items remain at nodes near the locations with which the items are associated, and nodes cache data items whose locations are near their own. When a node issues a query, neighboring nodes send back their copies, which will likely include the query result.
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
Camp, T., Boleng, J., Davies, V.: A Survey of Mobility Models for Ad Hoc Networks Research. In: Wireless Communications and Mobile Computing (WCMC 2002), vol. 2(5), pp. 483–502 (2002)
Chatzimilioudis, G., Zeinalipour-Yazti, D., Lee, W.-C., Dikaiakos, M.D.: Continuous All k-Nearest Neighbor Querying in Smartphone Networks. In: Proc. of MDM 2012, pp. 79–88 (2012)
Hamida, E.B., Chelius, G.: A Line-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sink. In: Proc. of ICC 2008, pp. 2201–2205 (2008)
Heissenbüttel, M., Brtnoulli, T., Walchli, M.: BLR: Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks. Computer Communications 27(11), 1076–1086 (2004)
Komai, Y., Sasaki, Y., Hara, T., Nishio, S.: A kNN Query Processing Method in Mobile Ad Hoc Networks. In: Proc. of MDM 2011, pp. 287–288 (2011)
Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)
Nghiem, T.P., Waluyo, A.B., Taniar, D.: A Pure Peer-to-Peer Approach for kNN Query Processing in Mobile Ad Hoc Networks. In: Personal and Ubiquitous Computing (2012)
Padmanabhan, P., Gruenwald, L., Vallur, A., Atiquzzaman, M.: A Survery of Data Replication Techniques for Mobile Ad Hoc Network Databases. VLDB Journal 17(5), 1143–1164 (2008)
Scalable Network Technologies: “Qualnet,” http://www.scalable-networks.com/
Song, Z., Roussopoulos, N.: K-Nearest Neighbor Search for Moving Query Point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)
Tsuchida, G., Ishihara, S.: Replica Arrangement for Location Dependent Data in Consideration of Network Partition in Ad Hoc Networks. International Journal of Communication Networks and Distributed Systems 2(4), 401–423 (2009)
Yao, Y., Tang, X., Lim, E.-P.: Continuous monitoring of kNN queries in wireless sensor networks. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds.) MSN 2006. LNCS, vol. 4325, pp. 662–673. Springer, Heidelberg (2006)
Yashiro, T., Porta, T.F.L.: Nomadic Agent System: Infrastructureless location based service system. IPSJ Journal 46(12), 2952–2962 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Komai, Y., Sasaki, Y., Hara, T., Nishio, S. (2013). Processing k Nearest Neighbor Queries for Location-Dependent Data in MANETs. In: Decker, H., Lhotská, L., Link, S., Basl, J., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 2013. Lecture Notes in Computer Science, vol 8056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40173-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-40173-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40172-5
Online ISBN: 978-3-642-40173-2
eBook Packages: Computer ScienceComputer Science (R0)