Efficient Broadcasting Using Network Coding
- 8 April 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 16 (2), 450-463
- https://doi.org/10.1109/tnet.2007.901080
Abstract
We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of , where is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose low-complexity distributed algorithms for realistic wireless ad hoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.Keywords
This publication has 26 references indexed in Scilit:
- Information Dissemination via Network CodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Raptor codesIEEE Transactions on Information Theory, 2006
- A Network Coding Approach to Energy Efficient Broadcasting: From Theory to PracticePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Coding schemes for line networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Logarithmic inapproximability of the radio broadcast problemJournal of Algorithms, 2004
- Probabilistic broadcast for flooding in wireless mobile ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Gossip-based ad hoc routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- More Flexible Exponentiation with PrecomputationPublished by Springer Science and Business Media LLC ,2001
- The rank of sparse random matrices over finite fieldsRandom Structures & Algorithms, 1997
- On the complexity of radio communicationPublished by Association for Computing Machinery (ACM) ,1989