Cross-Layer Designs in Coded Wireless Fading Networks With Multicast

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.

[1]  Tracey Ho,et al.  Energy Efficient Opportunistic Network Coding for Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[2]  K. Jain,et al.  Practical Network Coding , 2003 .

[3]  Yunnan Wu,et al.  Distributed utility maximization for network coding based multicasting: a shortest path approach , 2006, IEEE Journal on Selected Areas in Communications.

[4]  Yunnan Wu,et al.  Distributed Utility Maximization for Network Coding Based Multicasting: A Critical Cut Approach , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[5]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[6]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

[7]  A. Banerjee Convex Analysis and Optimization , 2006 .

[8]  A. P. Robertson,et al.  On a Theorem of Lyapunov , 1968 .

[9]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[10]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[11]  Asuman E. Ozdaglar,et al.  Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods , 2008, SIAM J. Optim..

[12]  K. Kiwiel,et al.  Parallel Subgradient Methods for Convex Optimization , 2001 .

[13]  Zongpeng Li,et al.  Efficient and distributed computation of maximum multicast rates , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[15]  R. Yeung,et al.  Network coding theory , 2006 .

[16]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[17]  Dimitri P. Bertsekas,et al.  The effect of deterministic noise in subgradient methods , 2010, Math. Program..

[18]  Muriel Medard,et al.  Scheduling for Network Coded Multicast: A Distributed Approach , 2009, 2009 IEEE Globecom Workshops.

[19]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[20]  R. Koetter,et al.  Scheduling for Network Coded Multicast: A Conflict Graph Formulation , 2008, 2008 IEEE Globecom Workshops.

[21]  Shuo-Yen Robert Li,et al.  Network Coding Theory - Part I: Single Source , 2005, Found. Trends Commun. Inf. Theory.

[22]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

[23]  Babak Hossein Khalaj,et al.  A Distributed Cross-Layer Optimization Method for Multicast in Interference-Limited Multihop Wireless Networks , 2008, EURASIP J. Wirel. Commun. Netw..

[24]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[25]  Alejandro Ribeiro,et al.  A class of convergent algorithms for resource allocation in wireless fading networks , 2010, IEEE Transactions on Wireless Communications.

[26]  Zhi-Quan Luo,et al.  Dynamic Spectrum Management: Complexity and Duality , 2008, IEEE Journal of Selected Topics in Signal Processing.

[27]  Leandros Tassiulas,et al.  Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1) , 2006 .

[28]  Alejandro Ribeiro,et al.  Separation Principles in Wireless Networking , 2010, IEEE Transactions on Information Theory.

[29]  Jiaru Lin,et al.  Rate control for network coding based multicast: a hierarchical decomposition approach , 2009, IWCMC.

[30]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[31]  Zhen Zhang,et al.  Multicasting in Time-varying Wireless Networks: Cross-layer Dynamic Resource Allocation , 2007, 2007 IEEE International Symposium on Information Theory.

[32]  N. Dinculeanu,et al.  CHAPTER I – VECTOR MEASURES , 1967 .

[33]  Yufang Xi,et al.  Distributed Algorithms for Minimum Cost Multicast With Network Coding , 2010, IEEE/ACM Transactions on Networking.

[34]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.