Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed data clustering can be efficient and exact
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
A Microeconomic View of Data Mining
Data Mining and Knowledge Discovery
Scalable Parallel Clustering for Data Mining on Multicomputers
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Data-Clustering Algorithm on Distributed Memory Multiprocessors
Revised Papers from Large-Scale Parallel Data Mining, Workshop on Large-Scale Parallel KDD Systems, SIGKDD
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Association Rule Mining in Peer-to-Peer Systems
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
The capacity of wireless networks
IEEE Transactions on Information Theory
Distributed Data Mining in Peer-to-Peer Networks
IEEE Internet Computing
Want scalable computing?: speculate!
ACM SIGACT News
Distributed facility location algorithms for flexible configuration of wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Efficient robot-based energy maintenance in wireless sensor networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Ubiquitous knowledge discovery
Ubiquitous knowledge discovery
| Hi-index | 0.00 |
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.