Name
Title | ||
|---|---|---|
On the tightness of the generalized network sharing bound for the two-unicast-Z network |
Abstract | ||
|---|---|---|
We study two-unicast-Z networks1 - two-source two-destination (two-unicast) wireline networks over directed acyclic graphs, where one of the two destinations (say the second destination) is apriori aware of the interfering (first) source's message. For certain classes of two-unicast-Z networks, we show that the rate-tuple (N, 1) is achievable as long as the individual source-destination cuts for the two source-destination pairs are respectively at least as large as N and 1, and the generalized network sharing cut - a bound previously defined by Kamath et. al. - is at least as large as N +1. We show this through a novel achievable scheme which is based on random linear coding at all the edges in the network, except at the GNS-cut set edges, where the linear coding co-efficients are chosen in a structured manner to cancel interference at the receiver first destination. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISIT.2013.6620793 | ISIT |
Keywords | Field | DocType |
random linear coding,linear codes,generalized network sharing,receiver,two-unicast-z network,gns-cut set edges,directed graphs,radio receivers,wireline networks,interference suppression,interference cancellation,directed acyclic graphs,interference,unicast,encoding,network coding,vectors | Linear network coding,Discrete mathematics,Combinatorics,Wireline,Network sharing,Computer science,A priori and a posteriori,Directed graph,Directed acyclic graph,Interference (wave propagation),Unicast | Conference |
ISSN | Citations | PageRank |
2157-8095 | 3 | 0.46 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifei Zeng | 1 | 39 | 3.13 |
| Viveck R. Cadambe | 2 | 1287 | 103.82 |
| Muriel Médard | 3 | 6828 | 599.31 |