Title
Linear network coding for multiple groupcast sessions: An interference alignment approach.
Abstract
We consider the problem of linear network coding over communication networks, representable by directed acyclic graphs, with multiple groupcast sessions: the network comprises of multiple destination nodes, each desiring messages from multiple sources. We adopt an interference alignment perspective, providing new insights into designing practical network coding schemes as well as the impact of network topology on the complexity of the alignment scheme. In particular, we show that under certain (polynomial-time checkable) constraints on networks with $K$ sources, it is possible to achieve a rate of $1/(L+d+1)$ per source using linear network coding coupled with interference alignment, where each destination receives messages from $L$ sources ($L < K$), and $d$ is a parameter, solely dependent on the network topology, that satisfies $0 \leq d < K-L$.
Year
DOI
Venue
2014
10.1109/ITW.2013.6691268
Information Theory Workshop
Keywords
DocType
Volume
computational complexity,directed graphs,interference (signal),linear codes,network coding,network theory (graphs),telecommunication network topology,communication networks,directed acyclic graphs,interference alignment approach,linear network coding scheme,multiple destination nodes,multiple groupcast sessions,network topology,polynomial-time checkable constraints,alignment,groupcast,linear network coding
Journal
abs/1402.0648
Citations 
PageRank 
References 
0
0.34
9
Authors
3
Name
Order
Citations
PageRank
Abhik Das1336.51
Siddhartha Banerjee218522.85
Sriram Vishwanath34185445.45