An Achievable Region for Double-Unicast Networks With Linear Network Coding

被引:8
作者
Xu, Xiaoli [1 ]
Zeng, Yong [2 ]
Guan, Yong Liang [1 ]
Ho, Tracey [3 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[2] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117583, Singapore
[3] CALTECH, Dept Elect Engn, Pasadena, CA 91125 USA
关键词
Network coding; achievable rate region; double-unicast networks; linear precoding; deterministic interference channels;
D O I
10.1109/TCOMM.2014.2350982
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we present an achievable rate region for double-unicast networks by assuming that the intermediate nodes perform random linear network coding, and the source and sink nodes optimize their strategies to maximize the achievable region. Such a setup can be modeled as a deterministic interference channel, whose capacity region is known. For the particular class of linear deterministic interference channels of our interest, in which the outputs and interference are linear deterministic functions of the inputs, we show that the known capacity region can be achieved by linear strategies. As a result, for a given set of network coding coefficients chosen by the intermediate nodes, the proposed linear precoding and decoding for the source and sink nodes will give the maximum achievable rate region for double-unicast networks. We further derive a suboptimal but easy-to-compute rate region that is independent of the network coding coefficients used at the intermediate nodes, and is instead specified by the min-cuts of the network. It is found that even this suboptimal region is strictly larger than the existing achievable rate regions in the literature.
引用
收藏
页码:3621 / 3630
页数:10
相关论文
共 26 条
  • [1] Agarwal A, 2004, 2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, P247
  • [2] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [3] [Anonymous], 2010, P SIGCHI C HUM FACT
  • [4] [Anonymous], P 45 ANN ALL C COMM
  • [5] [Anonymous], DETAILED STEPS FOURI
  • [6] [Anonymous], 2004, P ALL C COMM
  • [7] [Anonymous], SOLVABILITY 2 PAIR U
  • [8] Bernstein D. S., 2009, MATRIX MATH THEORY F
  • [9] Chekuri C, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P1593
  • [10] Insufficiency of linear coding in network information flow
    Dougherty, R
    Freiling, C
    Zeger, K
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (08) : 2745 - 2759