Optimal relay location and power allocation for low SNR broadcast relay channels

被引:0
|
作者
Thakur, Mohit [1 ]
Fawaz, Nadia [2 ]
Medard, Muriel [2 ]
机构
[1] Tech Univ Munich, Inst Commun Engn, D-80290 Munich, Germany
[2] MIT, Elect Res Lab, Cambridge, MA 02139 USA
关键词
Low SNR; computational geometry; network optimization; MULTIPATH-FADING CHANNELS; WIDE-BAND REGIME; CAPACITY;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the broadcast relay channel (BRC), where a single source transmits to multiple destinations with the help of a relay, in the limit of a large bandwidth. We address the problem of optimal relay positioning and power allocations at source and relay, to maximize the multicast rate from source to all destinations. To solve such a network planning problem, we develop a three-faceted approach based on an underlying information theoretic model, computational geometric aspects, and network optimization tools. Firstly, assuming superposition coding and frequency division between the source and the relay, the information theoretic framework yields a hypergraph model of the wideband BRC, which captures the dependency of achievable rate-tuples on the network topology. As the relay position varies, so does the set of hyperarcs constituting the hypergraph, rendering the combinatorial nature of optimization problem. We show that the convex hull C of all nodes in the 2-D plane can be divided into disjoint regions corresponding to distinct hyperarcs sets. These sets are obtained by superimposing all k-th order Voronoi tessellation of C. We propose an easy and efficient algorithm to compute all hyperarc sets, and prove they are polynomially bounded. Then, we circumvent the combinatorial nature of the problem by introducing continuous switch functions, that allows adapting the network hypergraph in a continuous manner. Using this switched hypergraph approach, we model the original problem as a continuous yet non-convex network optimization program. Ultimately, availing on the techniques of geometric programming and p-norm surrogate approximation, we derive a good convex approximation. We provide a detailed characterization of the problem for collinearly located destinations, and then give a generalization for arbitrarily located destinations. Finally, we show strong gains for the optimal relay positioning compared to seemingly interesting positions.
引用
收藏
页码:2822 / 2830
页数:9
相关论文
共 50 条
  • [21] Optimal relay functionality for SNR maximization in memoryless relay networks
    Gomadam, Krishna Srikanth
    Jafar, Syed Ali
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (02) : 390 - 401
  • [22] Optimal power allocation and relay selection in amplify-and-forward relay systems
    Wang S.
    Ji H.
    Wen B.
    Gaojishu Tongxin/Chinese High Technology Letters, 2010, 20 (10): : 1001 - 1005
  • [23] Ergodic capacity and power allocation in wireless relay channels
    Host-Madsen, A
    Zhang, JS
    GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 26 - 30
  • [24] Capacity bounds and power allocation for wireless relay channels
    Host-Madsen, A
    Zhang, JS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (06) : 2020 - 2040
  • [25] Optimal Power Allocation and Relay Location for DF Energy Harvesting Relaying Sensor Networks
    Yang, Shizhao
    Lu, Guangyue
    Ren, Yuan
    SENSORS, 2019, 19 (10)
  • [26] Secrecy in Cooperative Relay Broadcast Channels
    Ekrem, Ersen
    Ulukus, Sennur
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (01) : 137 - 155
  • [27] Secrecy in Cooperative Relay Broadcast Channels
    Ekrem, Ersen
    Ulukus, Sennur
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2217 - 2221
  • [28] Capacity of a Class of Broadcast Relay Channels
    Behboodi, Arash
    Piantanida, Pablo
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 590 - 594
  • [29] Cooperation with an Untrusted Relay in Broadcast Channels
    Chen, Liang
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2785 - 2789
  • [30] Rate regions for relay broadcast channels
    Liang, Yingbin
    Kramer, Gerhard
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (10) : 3517 - 3535