Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 2014 | public
Journal Article

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

Abstract

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.

Additional Information

© 2014 IEEE. Manuscript received December 2, 2013; revised April 14, 2014, July 1, 2014, and August 4, 2014; accepted August 17, 2014. Date of publication August 22, 2014; date of current version October 17, 2014. This work was supported by the Advanced Communications Research Program DSOCL06271, a research grant from the Directorate of Research and Technology (DRTech), Ministry of Defence, Singapore. The associate editor coordinating the review of this paper and approving it for publication was P. Popovski.

Additional details

Created:
August 22, 2023
Modified:
October 18, 2023