When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
Wireless information networks
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Information Theory
Lower bounds on the maximum energy benefit of network coding for wireless multiple unicast
EURASIP Journal on Wireless Communications and Networking - Special issue on network coding for wireless networks
| Hi-index | 0.00 |
Multicast is a fundamental communication operation in wireless sensor networks whereby a source sensor transmits its information to a relevant subset of sensors in the network. Motivated by this, we study the advantage of network coding for minimizing the total power needed for multicast in wireless networks. We show that there is an absolute constant, depending only on the power gradient and the dimension of the underlying Euclidean space, that bounds the maximum advantage of network coding. An interesting aspect of our result is that it shows that the advantage of coding remains bounded by a constant even when compared to a multicast scheme without coding that is restricted to do only point-to-point transmissions.