Abstract
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (possibly) very large number of clients. We show that a variation of the problem can be solved using a local algorithm. Local algorithms are extremely useful in a sensor network scenario. This is because they allow the communication range of the sensor to be restricted to the minimum, they can operate in routerless networks, and they allow complex problems to be solved on the basis of very little information, gathered from nearby sensors. The local facility location algorithm we describe is entirely asynchronous, seamlessly supports failures and changes in the data during calculation, poses modest memory and computational requirements, and can provide an anytime solution which is guaranteed to converge to the exact same one that would be computed by a centralized algorithm given the entire data.
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
Arya, V., Garg, N., Khandekar, R., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: STOC, pp. 21–29 (2001)
Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. 21st ACM STOC (May 1989)
Birk, Y., Liss, L., Schuster, A., Wolff, R.: A local algorithm for ad hoc majority voting via charge fusion. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 275–289. Springer, Heidelberg (2004)
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: FOCS, pp. 378–388 (1999)
Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Large-Scale Parallel Data Mining, pp. 245–260 (1999)
Forman, G., Zhang, B.: Distributed data clustering can be efficient and exact. SIGKDD Explor. Newsl. 2(2), 34–38 (2000)
Foti, D., Lipari, D., Pizzuti, C., Talia, D.: Scalable Parallel Clustering for Data Mining on Multicomputers. In: IPDPS 2000, Cancun, Mexico (May 2000)
Guha, Khuller: Greedy strikes back: Improved facility location algorithms. In: SODA: ACM-SIAM (1998)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Jaffe, J.M., Moss, F.H.: A responsive routing algorithm for computer networks. IEEE Transactions on Communications, 1758–1762 (July 1982)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems
Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k-median problems. In: FOCS, pp. 2–13 (1999)
Kleinberg, J., Papadimitriou, C., Raghavan, P.: A microeconomic view of data mining. Data Mining and Knowledge Discovery (1998)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proc. ACM-SIAM, pp. 1–10 (1998)
Kutten, S., Patt-Shamir, B.: Time-adaptive self-stabilization. In: Proc. PODC, August 1997, pp. 149–158 (1997)
Kutten, S., Peleg, D.: Fault-local distributed mending. In: Proc. PODC (August 1995)
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comp. 21, 193–201 (1992)
Naor, M., Stockmeyer, L.: What can be computed locally? In: STOC, pp. 184–193 (1993)
Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem (2002)
Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. In: Proc. ICDM, Melbourne, Florida (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krivitski, D., Schuster, A., Wolff, R. (2005). A Local Facility Location Algorithm for Sensor Networks. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds) Distributed Computing in Sensor Systems. DCOSS 2005. Lecture Notes in Computer Science, vol 3560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11502593_28
Download citation
DOI: https://doi.org/10.1007/11502593_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26422-4
Online ISBN: 978-3-540-31671-8
eBook Packages: Computer ScienceComputer Science (R0)