Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Wireless information networks
Computers and Operations Research
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Improved Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 2003 ACM symposium on Applied computing
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
On alarm protocol in wireless sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
| Hi-index | 0.00 |
Given a set S of points (stations) located in the d-dim. Euclidean space and a rootb ∈S, the h-hops Convergecast problem asks to find for a minimal energy-cost range assignment which allows to perform the converge-cast primitive (i.e. node accumulation) towards b in at most h hops. For this problem no polynomial time algorithm is known even for h = 2. The main goal of this work is the design of an efficient distributed heuristic (i.e. protocol) and the analysis (both theoretical and experimental) of its expected solution cost. In particular, we introduce an efficient parameterized randomized protocol for h-hops Convergecast and we analyze it on random instances created by placing n points uniformly at random in a d-cube of side length L. We prove that for h = 2, its expected approximation ratio is bounded by some constant factor. Finally, for h = 3,..., 8, we provide a wide experimental study showing that our protocol has very good performances when compared with previously introduced (centralized) heuristics.