Whether and Where to Code in the Wireless Packet Erasure Relay Channel

被引:19
作者
Shi, Xiaomeng [1 ]
Medard, Muriel [1 ]
Lucani, Daniel E. [2 ]
机构
[1] MIT, Elect Res Lab, Cambridge, MA 02139 USA
[2] Aalborg Univ, Dept Elect Syst, DK-9220 Aalborg, Denmark
基金
加拿大自然科学与工程研究理事会;
关键词
Random linear network coding; wireless relay channel; packet delivery energy; NETWORK CODING APPROACH; CAPACITY THEOREMS;
D O I
10.1109/JSAC.2013.130803
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations. In energy-constrained systems, however, coding subgraphs should be chosen to control the number of coding nodes while maintaining throughput. In this paper, we explore the strategic use of network coding in the wireless packet erasure relay channel according to both throughput and energy metrics. In the relay channel, a single source communicates to a single sink through the aid of a half-duplex relay. The fluid flow model is used to describe the case where both the source and the relay are coding, and Markov chain models are proposed to describe packet evolution if only the source or only the relay is coding. In addition to transmission energy, we take into account coding and reception energies. We show that coding at the relay alone while operating in a rateless fashion is neither throughput nor energy efficient. Given a set of system parameters, our analysis determines the optimal amount of time the relay should participate in the transmission, and where coding should be performed.
引用
收藏
页码:1379 / 1389
页数:11
相关论文
共 30 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
Angelopoulos G, 2011, LECT NOTES COMPUT SC, V6827, P137, DOI 10.1007/978-3-642-23041-7_14
[3]  
[Anonymous], 1985, Matrix Analysis
[4]  
[Anonymous], 2010, document TR 36
[5]   Trading structure for randomness in wireless opportunistic routing [J].
Chachulski, Szymon ;
Jennings, Michael ;
Katti, Sachin ;
Katabi, Dina .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :169-180
[6]  
Chou P.A., 2003, Proc. Annual Allerton Conference on Communication control and Computing, V41, P40
[7]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[8]   Capacity of wireless erasure networks [J].
Dana, ATF ;
Gowaikar, R ;
Palanki, R ;
Hassibi, B ;
Effros, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (03) :789-804
[9]   Reliable Relay Assisted Wireless Multicast Using Network Coding [J].
Fan, Pingyi ;
Zhi, Chen ;
Wei, Chen ;
Ben Letaief, Khaled .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (05) :749-762
[10]  
Hausl C, 2006, IEEE ICC, P1568