Cross-Layer Designs in Coded Wireless Fading Networks With Multicast

被引:27
作者
Rajawat, Ketan [1 ]
Gatsis, Nikolaos [1 ]
Giannakis, Georgios B. [1 ]
机构
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
基金
美国国家科学基金会;
关键词
Asynchronous subgradient methods; cross-layer designs; multihop; network coding; optimization methods; OPTIMIZATION; ALGORITHMS;
D O I
10.1109/TNET.2011.2109010
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1276 / 1289
页数:14
相关论文
共 32 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
Amerimehr M. H., 2008, J WIRELESS COMMUN NE, V2008, P1
[3]  
[Anonymous], 1999, Athena scientific Belmont
[4]  
[Anonymous], 2005, Foundation and Trends in Communications and Information Theory
[5]  
Bertsekas D., 2003, Convex Analysis and Optimization
[6]   ROUTING TO MULTIPLE DESTINATIONS IN COMPUTER-NETWORKS [J].
BHARATHKUMAR, K ;
JAFFE, JM .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (03) :343-351
[7]   ON A THEOREM OF LYAPUNOV [J].
BLACKWELL, D .
ANNALS OF MATHEMATICAL STATISTICS, 1951, 22 (01) :112-118
[8]   Optimization based rate control for multicast with network coding [J].
Chen, Lijun ;
Ho, Tracey ;
Low, Steven H. ;
Chiang, Mung ;
Doyle, John C. .
INFOCOM 2007, VOLS 1-5, 2007, :1163-+
[9]   Layering as optimization decomposition: A mathematical theory of network architectures [J].
Chiang, Mung ;
Low, Steven H. ;
Calderbank, A. Robert ;
Doyle, John C. .
PROCEEDINGS OF THE IEEE, 2007, 95 (01) :255-312
[10]  
Chou P.A., 2003, Proc. Annual Allerton Conference on Communication control and Computing, V41, P40