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

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.

[1]  Muriel Médard,et al.  On Optimizing Low SNR Wireless Networks Using Network Coding , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[2]  Ibrahim C. Abou-Faycal,et al.  On the performance of peaky capacity-achieving signaling on multipath fading channels , 2004, IEEE Transactions on Communications.

[3]  A. El Gamal,et al.  Multiple user information theory , 1980, Proceedings of the IEEE.

[4]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[5]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[6]  Duan Li,et al.  Zero duality gap in integer programming: P-norm surrogate constraint method , 1999, Oper. Res. Lett..

[7]  Lizhong Zheng,et al.  Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel , 2002, IEEE Trans. Inf. Theory.

[8]  Sergio Verdú,et al.  Spectral efficiency in the wideband regime , 2002, IEEE Trans. Inf. Theory.

[9]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[10]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[11]  Muriel Médard,et al.  On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability , 2006, IEEE Transactions on Information Theory.

[12]  Stefan Parkvall,et al.  LTE: the evolution of mobile broadband , 2009, IEEE Communications Magazine.

[13]  Emre Telatar,et al.  Capacity and mutual information of wideband multipath fading channels , 1998, IEEE Trans. Inf. Theory.

[14]  Robert Spayde Kennedy,et al.  Fading dispersive communication channels , 1969 .

[15]  A. Sridharan.  Broadcast Channels , 2022 .

[16]  Robert J. McEliece,et al.  A Note on the Wide-Band Gaussian Broadcast Channel , 1987, IEEE Trans. Commun..

[17]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[18]  Yi-Chung Hu,et al.  On generalized geometric programming problems with non-positive variables , 2007, Eur. J. Oper. Res..

[19]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[20]  Bruce E. Hajek,et al.  Broad-band fading channels: Signal burstiness and capacity , 2002, IEEE Trans. Inf. Theory.

[21]  Muriel Médard,et al.  Bandwidth scaling for fading multipath channels , 2002, IEEE Trans. Inf. Theory.

[22]  Joakim Westerlund,et al.  Some transformation techniques with applications in global optimization , 2009, J. Glob. Optim..

[23]  Muriel Médard,et al.  On the non-coherent wideband multipath fading relay channel , 2010, 2010 IEEE International Symposium on Information Theory.

[24]  Yang Yang,et al.  Relay technologies for WiMax and LTE-advanced mobile systems , 2009, IEEE Communications Magazine.

[25]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.