Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
EURASIP Journal on Wireless Communications and Networking
Rate control for network coding based multicast: a hierarchical decomposition approach
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
SIAM Journal on Optimization
Dynamic algorithms for multicast with intra-session network coding
IEEE Transactions on Information Theory
Distributed algorithms for minimum cost multicast with network coding
IEEE/ACM Transactions on Networking (TON)
A class of convergent algorithms for resource allocation in wireless fading networks
IEEE Transactions on Wireless Communications
The effect of deterministic noise in subgradient methods
Mathematical Programming: Series A and B
Separation principles in wireless networking
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
Distributed utility maximization for network coding based multicasting: a shortest path approach
IEEE Journal on Selected Areas in Communications
Optimal self-adaptive QoS resource management in interference-affected multicast wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport-layer rates, network code design variables, broadcast link flows, link capacities, average power consumption, and short-term power allocation policies. As in the routing paradigm where nodes simply forward packets, the cross-layer optimization problem with network coding is nonconvex in general. It is proved, however, that with network coding, dual decomposition for multicast is optimal so long as the fading at each wireless link is a continuous random variable. This lends itself to provably convergent subgradient algorithms, which not only admit a layered-architecture interpretation, but also optimally integrate network coding in the protocol stack. The dual algorithm is also paired with a scheme that yields near-optimal network design variables, namely multicast end-to-end rates, network code design quantities, flows over the broadcast links, link capacities, and average power consumption. Finally, an asynchronous subgradient method is developed, whereby the dual updates at the physical layer can be affordably performed with a certain delay with respect to the resource allocation tasks in upper layers. This attractive feature is motivated by the complexity of the physical-layer subproblem and is an adaptation of the subgradient method suitable for network control.