Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Power consumption in packet radio networks
Theoretical Computer Science
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Improved approximation results for the minimum energy broadcasting problem
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The min-power multicast problems in wireless ad hoc networks: a parameterized view
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Theoretical Computer Science
| Hi-index | 0.00 |
Broadcasting a message from a given source node to all other nodes is a fundamental task during the operation of a wireless network. In many application scenarios the network nodes have only a limited energy supply, hence minimizing the energy consumption of any communication task prolongs the lifetime of the network. During a broadcast operation using intermediate nodes to relay messages within the network might decrease the overall energy consumption since the cost of transmitting a message grows super-linearly with the distance. On the other hand using too many intermediate nodes during a broadcast operation increases both latency as well as the chances that some transmission could not properly received (e.g. due to interference). In this paper we consider a constrained broadcast operation, where a source node wants to send a message to all other nodes in the network but at most k nodes are allowed to participate actively, i.e. transmit the message. Restricting the number of transmitting nodes helps in reducing interference, latency and increasing reliability of the broadcast operation, of course at the cost of a slightly higher energy consumption. For the case of network nodes embedded in the Euclidean plane we provide a (1+Ɛ)- approximation algorithm which runs in time linear in n and polynomial in 1/Ɛ but with an exponential dependence on k. As an alternative we therefore also provide an O(1)-approximation whose running time is linear in n and polynomial in k. The existence of a (1 + Ɛ)-approximation algorithm is in stark contrast to the unconstrained broadcast problem where even in the Euclidean plane no algorithm with approximation factor better than 6 is known so far.