An achievable region for double-unicast networks with linear network coding
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 inte...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/103462 http://hdl.handle.net/10220/24491 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-103462 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1034622020-03-07T14:00:36Z An achievable region for double-unicast networks with linear network coding Zeng, Yong Ho, Tracey Guan, Yong Liang Xu, Xiaoli School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks 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. Accepted version 2014-12-19T06:34:21Z 2019-12-06T21:13:13Z 2014-12-19T06:34:21Z 2019-12-06T21:13:13Z 2014 2014 Journal Article Xu, X., Zeng, Y., Guan, Y. L. & Ho, T. (2014). An achievable region for double-unicast networks with linear network coding. IEEE transactions on communications, 62(10), 3621 - 3630. 0090-6778 https://hdl.handle.net/10356/103462 http://hdl.handle.net/10220/24491 10.1109/TCOMM.2014.2350982 en IEEE transactions on communications © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TCOMM.2014.2350982]. 10 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks Zeng, Yong Ho, Tracey Guan, Yong Liang Xu, Xiaoli An achievable region for double-unicast networks with linear network coding |
description |
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. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Zeng, Yong Ho, Tracey Guan, Yong Liang Xu, Xiaoli |
format |
Article |
author |
Zeng, Yong Ho, Tracey Guan, Yong Liang Xu, Xiaoli |
author_sort |
Zeng, Yong |
title |
An achievable region for double-unicast networks with linear network coding |
title_short |
An achievable region for double-unicast networks with linear network coding |
title_full |
An achievable region for double-unicast networks with linear network coding |
title_fullStr |
An achievable region for double-unicast networks with linear network coding |
title_full_unstemmed |
An achievable region for double-unicast networks with linear network coding |
title_sort |
achievable region for double-unicast networks with linear network coding |
publishDate |
2014 |
url |
https://hdl.handle.net/10356/103462 http://hdl.handle.net/10220/24491 |
_version_ |
1681048330486939648 |