Abstract
Given a set of \(m\) mobile objects in a sensor network, we consider the problem of finding the nearest object among them from any node in the network at any time. These mobile objects are tracked by nearby sensors called proxy nodes. This problem requires an object tracking mechanism which typically relies on two basic operations: query and update. A query is invoked by a node each time when there is a need to find the closest object from it in the network. Updates of an object’s location are initiated when the object moves from one location (proxy node) to another. We present a scalable distributed algorithm for tracking these mobile objects such that both the query cost and the update cost is minimized. The main idea is that given a set of mobile objects our algorithm maintains a virtual tree of downward paths pointing to the objects. Our algorithm guarantees an \(\mathcal{O}(1)\) approximation for query cost and an \(\mathcal{O}(\min \{\log n,\log D\})\) approximation for update cost in the constant-doubling graph model, where \(n\) and \(D\), respectively, are the number of nodes and the diameter of the network. We also give polylogarithmic approximations for both query and update cost in the general graph model. Our bounds are deterministic and hold in the worst-case. Moreover, our algorithm requires only polylogarithmic bits of memory per node. To our best knowledge, this is the first algorithm that is asymptotically optimal in handling nearest neighbor queries with low update cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abraham, I., Dolev, D., Malkhi, D.: Lls: a locality aware location service for mobile ad hoc networks. In: DIALM-POMC, pp. 75–84 (2004)
Alon, N., Kalai, G., Ricklin, M., Stockmeyer, L.: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theor. Comput. Sci. 130(1), 175–201 (1994)
Aslam, J., Butler, Z., Constantin, F., Crespi, V., Cybenko, G., Rus, D.: Tracking a moving object with a binary sensor network. In: SenSys, pp. 150–161 (2003)
Awerbuch, B., Peleg, D.: Sparse partitions. In: FOCS, vol. 2, pp. 503–513 (1990)
Awerbuch, B., Peleg, D.: Online tracking of mobile users. J. ACM 42(5), 1021–1058 (1995)
Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: FOCS, pp. 184–193 (1996)
Can, Z., Demirbas, M.: A survey on in-network querying and tracking services for wireless sensor networks. Ad Hoc Netw. 11(1), 596–610 (2013)
Chen, W.P., Hou, J.C., Sha, L.: Dynamic clustering for acoustic target tracking in wireless sensor networks. In: ICNP, pp. 284– 294 (2003)
Demirbas, M., Arora, A., Kulathumani, V.: Glance: a lightweight querying service for wireless sensor networks. Theor. Comput. Sci. 410(6–7), 500–513 (2009)
Demirbas, M., Arora, A., Nolte, T., Lynch, N.A.: A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 299–315. Springer, Heidelberg (2005)
Demirbas, M., Ferhatosmanoglu, H.: Peer-to-peer spatial queries in sensor networks. In: P2P, pp. 32–39 (2003)
Demirbas, M., Lu, X., Singla, P.: An in-network querying framework for wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 20(8), 1202–1215 (2009)
Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119–133. Springer, Heidelberg (1998)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485–497 (2004)
Flury, R., Wattenhofer, R.: Mls: an efficient location service for mobile ad hoc networks. In: MobiHoc, pp. 226–237 (2006)
Funke, S., Guibas, L.J., Nguyen, A., Wang, Y.: Distance-sensitive information brokerage in sensor networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 234–251. Springer, Heidelberg (2006)
Gao, J., Guibas, L., Milosavljevic, N., Zhou, D.: Distributed resource management and matching in sensor networks. In: IPSN, pp. 97–108 (2009)
Gupta, H., Chowdhary, V.: Communication-efficient implementation of join in sensor networks. Ad Hoc Netw. 5(6), 929–942 (2007)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14(2), 47–57 (1984)
Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195–208 (2007)
Jia, L., Lin, G., Noubir, G., Rajaraman, R., Sundaram, R.: Universal approximations for tsp, steiner tree, and set cover. In: STOC, pp. 386–395 (2005)
Kulathumani, V., Arora, A., Sridharan, M., Demirbas, M.: Trail: A distance-sensitive sensor network service for distributed object tracking. ACM Trans. Sen. Netw. 5(2), 15:1–15:40 (2009)
Kung, H.T., Vlah, D.: Efficient location tracking using sensor networks. In: WCNC, vol. 3, pp. 1954–1961 (2003)
Li, J., Jannotti, J., De Couto, D.S.J., Karger, D.R., Morris, R.: A scalable location service for geographic ad hoc routing. In: MobiCom, pp. 120–130 (2000)
Lin, C.Y., Peng, W.C., Tseng, Y.C.: Efficient in-network moving object tracking in wireless sensor networks. IEEE Trans. Mob. Comput. 5(8), 1044–1056 (2006)
Liu, B.H., Ke, W.C., Tsai, C.H., Tsai, M.J.: Constructing a message-pruning tree with minimum cost for tracking moving objects in wireless sensor networks is np-complete and an enhanced data aggregation structure. IEEE Trans. Comput. 57(6), 849–863 (2008)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: STOC, pp. 1–10 (1985)
Mechitov, K., Sundresh, S., Kwon, Y., Agha, G.: Poster abstract: cooperative tracking with binary-detection sensor networks. In: SenSys, pp. 332–333 (2003)
Motskin, A., Downes, I., Kusy, B., Gnawali, O., Guibas, L.J.: Network warehouses: efficient information distribution to mobile users. In: INFOCOM, pp. 2069–2077 (2011)
Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys, pp. 250–262 (2004)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. SIGMOD Rec. 24(2), 71–79 (1995)
Sarkar, R., Gao, J.: Differential forms for target tracking and aggregate queries in distributed networks. IEEE/ACM Trans. Netw. 21(4), 1159–1172 (2013)
Sharma, G., Busch, C.: Towards load balanced distributed transactional memory. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds.) Euro-Par 2012. LNCS, vol. 7484, pp. 403–414. Springer, Heidelberg (2012)
Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 378–392. Springer, Heidelberg (2013)
Sharma, G., Busch, C., Srinivasagopalan, S.: Distributed transactional memory for general networks. In: IPDPS, pp. 1045–1056 (2012)
Winter, J., Lee, W.C.: Kpt: a dynamic knn query processing algorithm for location-aware sensor networks. In: DMSN, pp. 119–124 (2004)
Yao, Y., Tang, X., Lim, E.-P.: In-Network processing of nearest neighbor queries for wireless sensor networks. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 35–49. Springer, Heidelberg (2006)
Yen, L.H., Wu, B.Y., Yang, C.C.: Tree-based object tracking without mobility statistics in wireless sensor networks. Wirel. Netw. 16(5), 1263–1276 (2010)
Zhang, W., Cao, G.: Dctc: Dynamic convoy tree-based collaboration for target tracking in sensor networks. IEEE Trans. Wirel. Commun. 3(5), 1689–1701 (2004)
Zhou, D., Gao, J.: Maintaining approximate minimum steiner tree and k-center for mobile agents in a sensor network. In: INFOCOM, pp. 511–515 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharma, G., Busch, C. (2014). Optimal Nearest Neighbor Queries in Sensor Networks. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2013. Lecture Notes in Computer Science(), vol 8243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45346-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-45346-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45345-8
Online ISBN: 978-3-642-45346-5
eBook Packages: Computer ScienceComputer Science (R0)