机构地区:[1]State Key Laboratory of Integrated Service Networks, Xidian University
出 处:《Science China(Information Sciences)》2014年第4期120-129,共10页中国科学(信息科学)(英文版)
基 金:supported by National Basic Research Program of China(973 Program)(Grant No.2012CB316-100);"111"Project of China(Grant No.B08038);National Natural Science Foundation of China(Grant Nos.61101144,61101145);Fundamental Research Funds for the Central Universities(Grant No.K50510010017)
摘 要:Power allocation promises significant benefits in wireless networks. However, these benefits depend on knowledge of the channel state information (CSI), which is hardly perfect. Therefore, robust algorithms that take into account such CSI uncertainties play an important role in the design of practical systems. In this paper, we formulate the power allocation problem as the maximum individual outage probability minimization subject to total power consumption for analog network coding (ANC) protocol of a two-way relay system. We show that these problems can be cast as convex optimization problems. Non-robust power allocation algorithm is first developed under the ideal assumption of perfect CSI. Then we introduce robust optimization methodology that accounts for the imperfect CSI. We show that ignoring CSI uncertainties in our designs can lead to drastic performance degradation. On the other hand, the proposed robust power allocation provides significant performance gain over non-robust power allocation and uniform power allocation in terms of overall system outage probability over a wide range of channel estimation errors. This work highlights the importance of the proposed robust algorithm in realistic two-way relaying networks.Power allocation promises significant benefits in wireless networks. However, these benefits depend on knowledge of the channel state information (CSI), which is hardly perfect. Therefore, robust algorithms that take into account such CSI uncertainties play an important role in the design of practical systems. In this paper, we formulate the power allocation problem as the maximum individual outage probability minimization subject to total power consumption for analog network coding (ANC) protocol of a two-way relay system. We show that these problems can be cast as convex optimization problems. Non-robust power allocation algorithm is first developed under the ideal assumption of perfect CSI. Then we introduce robust optimization methodology that accounts for the imperfect CSI. We show that ignoring CSI uncertainties in our designs can lead to drastic performance degradation. On the other hand, the proposed robust power allocation provides significant performance gain over non-robust power allocation and uniform power allocation in terms of overall system outage probability over a wide range of channel estimation errors. This work highlights the importance of the proposed robust algorithm in realistic two-way relaying networks.
关 键 词:analog network coding (ANC) outage probability two-way relay robust power allocation imper-fect channel state information (CSI)
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...