Energy-efficient relay selection for multicast traffic

We consider the problem of multicasting from a single source to a set of destinations. We assume that the source cannot reach the destinations directly, but must forward its traffic through a set of relays. Under the performance objective of maximizing the common amount of information (number of bits) that the source sends to all destinations per Joule of the total energy spent, we wish to obtain a policy that identifies: a) which subset of the relays should be activated, b) for how long, and c) the respective destinations that each relay has to serve. We consider centralized policies with exact knowledge of the channel conditions. In the special case of a network with two relays we show that for any fixed assignment of destinations to relays the problem of maximizing the number of bits per Joule by choosing the duration that each relay should be activated can be formulated as a convex optimization problem. However, since the problem of assigning destinations to relays remains combinatorially complex, we then present an algorithm with reduced complexity that exploits the knowledge of the underlying channel conditions. Finally, we provide a set of numerical results to illustrate the optimal relay selection and assignment of destinations to relays corresponding to different channel conditions.

[1]  Giuseppe Thadeu Freitas de Abreu,et al.  Mutual information of amplify-and-forward DSTBCs over the random set relay channel , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[2]  Geoffrey Ye Li,et al.  Energy Efficient Design in Wireless OFDMA , 2008, 2008 IEEE International Conference on Communications.

[3]  Teresa H. Y. Meng,et al.  Bits-per-Joule Capacity of Energy-Limited Wireless Networks , 2007, IEEE Transactions on Wireless Communications.

[4]  Andreas F. Molisch,et al.  Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection , 2008, IEEE Transactions on Wireless Communications.

[5]  Neelesh B. Mehta,et al.  Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[6]  H. Vincent Poor,et al.  An energy-efficient approach to power control and receiver design in wireless data networks , 2005, IEEE Transactions on Communications.

[7]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[9]  S. Verdu,et al.  Minimum energy per bit for Gaussian broadcast channels with common message and cooperating receivers , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Hyundong Shin,et al.  Cooperative Communications with Outage-Optimal Opportunistic Relaying , 2007, IEEE Transactions on Wireless Communications.

[11]  Raviraj S. Adve,et al.  Symbol error rate of selection amplify-and-forward relay systems , 2006, IEEE Communications Letters.

[12]  Andrea J. Goldsmith,et al.  A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA Networks with Delay Constraints , 2007, 2007 IEEE Radio and Wireless Symposium.

[13]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..