An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis

Thumbnail Image
Date
2013-07-01
Authors
Huang, Shurui
Ramamoorthy, Aditya
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Research Projects
Organizational Units
Journal Issue
Is Version Of
Versions
Series
Department
Electrical and Computer Engineering
Abstract

We consider the multiple unicast problem under network coding over directed acyclic networks when there are two source-terminal pairs, s1-t1 and s2-t2. The capacity region for this problem is not known; furthermore, the outer bounds on the region have a large number of inequalities which makes them hard to explicitly evaluate. In this work we consider a related problem. We assume that we only know certain minimum cut values for the network, e.g., mincut(Si, Tj), where Si ⊆ {s1, s2} and Tj ⊆ {t1, t2} for different subsets Si and Tj. Based on these values, we propose an achievable rate region for this problem using linear network codes. Towards this end, we begin by defining a multicast region where both sources are multicast to both the terminals. Following this we enlarge the region by appropriately encoding the information at the source nodes, such that terminal ti is only guaranteed to decode information from the intended source si, while decoding a linear function of the other source. The rate region depends upon the relationship of the different cut values in the network.

Comments

This is a manuscript of an article from IEEE Transactions on Communications 61 (2013): 2890, doi: 10.1109/TCOMM.2013.053013.120542. Posted with permission.

Description
Keywords
Citation
DOI
Copyright
Tue Jan 01 00:00:00 UTC 2013
Collections