A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
Algorithms for generic role assignment in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
A distributed O(1)-approximation algorithm for the uniform facility location problem
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The Tenet architecture for tiered sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
A local facility location algorithm for sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Efficient social-aware content placement in opportunistic networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Self-organization methodologies for services placement in future mobile communication networks
Proceedings of the 7th International Conference on Frontiers of Information Technology
Efficient robot-based energy maintenance in wireless sensor networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
A survey of services placement mechanisms for future mobile communication networks
Proceedings of the 8th International Conference on Frontiers of Information Technology
The filter-placement problem and its application to minimizing information multiplicity
Proceedings of the VLDB Endowment
Dynamic service placement in shared service hosting infrastructures
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
QoS-aware placement of stream processing service
The Journal of Supercomputing
Hi-index | 0.00 |
Many self-configuration problems that occur in sensor networks, such as clustering or operator placement for in-network data aggregation, can be modeled as facility location problems. Unfortunately, existing distributed facility location algorithms are hardly applicable to multi-hop sensor networks. Based on an existing centralized algorithm, we therefore devise equivalent distributed versions which, to our knowledge, represent the first distributed approximations of the facility location problem that can be practicably implemented in multihop sensor networks with local communication. Through simulation studies, we demonstrate that, for typical instances derived from sensor-network configuration problems, the algorithms terminate in only few communication rounds, the runtime does not increase with the network size, and, finally, that our implementation requires only local communication confined to small network neighborhoods. In addition, we propose simple extensions to our algorithms to support dynamic networks with varying link qualities and node additions and deletions. Using link quality traces collected from a real sensor network deployment, we demonstrate the effectiveness of our algorithms in realistic multi-hop sensor networks.