TY - GEN
T1 - Network coded wireless multicast with advanced receiver capabilities
AU - Riemensberger, Maximilian
AU - Wiese, Thomas
AU - Utschick, Wolfgang
N1 - Publisher Copyright:
© 9th International ITG Conference on Systems, Commun. and Coding, SCC 2013. All rights reserved.
PY - 2013
Y1 - 2013
N2 - We consider wireless multihop networks with intrasession network coding and advanced physical layer techniques. In particular, we study the influence of multiuser decoding at receivers on the network utility maximization problem. To this end, we combine the polymatroid broadcast function model with the Gaussian compound multiple access channel (MAC) to model the information flow when multiple receivers decode messages from multiple transmitters. For this model, we formulate a network utility maximization problem and use a dual decomposition approach to separate the polymatroid flow subproblem, the scheduling and decoding assignment subproblem, and the compound MAC physical layer subproblem. The polymatroid flow and the compound MAC subproblems can be significantly simplified by exploiting their inherent polymatroid structure. For the scheduling and decoding assignment problem, we discuss the optimal solution, which results in an exhaustive search, and a simple greedy heuristic. In numerical simulations, we show a significant gain in network utility due to the advanced receiver capabilities compared to simple receivers.
AB - We consider wireless multihop networks with intrasession network coding and advanced physical layer techniques. In particular, we study the influence of multiuser decoding at receivers on the network utility maximization problem. To this end, we combine the polymatroid broadcast function model with the Gaussian compound multiple access channel (MAC) to model the information flow when multiple receivers decode messages from multiple transmitters. For this model, we formulate a network utility maximization problem and use a dual decomposition approach to separate the polymatroid flow subproblem, the scheduling and decoding assignment subproblem, and the compound MAC physical layer subproblem. The polymatroid flow and the compound MAC subproblems can be significantly simplified by exploiting their inherent polymatroid structure. For the scheduling and decoding assignment problem, we discuss the optimal solution, which results in an exhaustive search, and a simple greedy heuristic. In numerical simulations, we show a significant gain in network utility due to the advanced receiver capabilities compared to simple receivers.
UR - http://www.scopus.com/inward/record.url?scp=85091805685&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85091805685
T3 - 9th International ITG Conference on Systems, Communications and Coding, SCC 2013
BT - 9th International ITG Conference on Systems, Communications and Coding, SCC 2013
PB - VDE VERLAG GMBH
T2 - 9th International ITG Conference on Systems, Communications and Coding, SCC 2013
Y2 - 21 January 2013 through 24 January 2013
ER -