Efficient broadcasting using network coding

被引:132
作者
Fragouli, Christina [1 ]
Widmer, Joerg [2 ]
Le Boudec, Jean-Yves [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
[2] DoCoMo Euro Labs, Munich, Germany
关键词
network coding; wireless broadcast;
D O I
10.1109/TNET.2007.901080
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 log n, where n 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.
引用
收藏
页码:450 / 463
页数:14
相关论文
共 35 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
Alon N., 1989, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, P274, DOI 10.1145/73007.73033
[3]  
Blomer J, 1997, RANDOM STRUCT ALGOR, V10, P407, DOI 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO
[4]  
2-Y
[5]  
CHEN B, 2002, ACM WIRELESS NETWORK, P85
[6]  
CHOU PA, 2003, P ALL C ALL IL OCT
[7]  
DEB S, 2004, ANN ALL C COMM CONTR
[8]  
Demers A., 1988, Operating Systems Review, V22, P8, DOI 10.1145/43921.43922
[9]  
DIOT C, 2004, IRCTR04016
[10]   Logarithmic inapproximability of the radio broadcast problem [J].
Elkin, M ;
Kortsarz, G .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 52 (01) :8-25