Title :
Resource allocation for multicast in an OFDMA network with Random Network Coding
Author :
Zhang, Dan ; Mandayam, Narayan
Author_Institution :
WINLAB, Rutgers Univ., North Brunswick, NJ, USA
Abstract :
In this paper, we consider multicast with Random Network Coding (RNC) over a wireless network using Orthogonal Frequency Division Multiple Access (OFDMA). Specifically, we propose a cross-layer resource allocation mechanism to minimize the total transmit power in the network to achieve a target throughput. The problem in its original form is a NP-hard mixed integer program. We alleviate this problem with a greedy power and subcarrier allocation algorithm that is combined with a node selection strategy that is enabled by RNC, which we refer to as “min-cut chasing.” We compare it with a reference algorithm that assigns subcarriers independently based on the max-min fairness criterion followed by optimal power allocation. Our results reveal that the proposed greedy algorithm with min-cut chasing, which is of polynomial complexity, yields power savings of 3dB and is within 1dB of a lower bound based on an interference-free assumption.
Keywords :
OFDM modulation; communication complexity; frequency division multiple access; greedy algorithms; integer programming; minimax techniques; multicast communication; network coding; radio networks; resource allocation; NP-hard mixed integer program; OFDMA network; cross-layer resource allocation mechanism; greedy power; interference-free assumption; max-min fairness criterion; min-cut chasing; node selection strategy; optimal power allocation; orthogonal frequency division multiple access; polynomial complexity; random network coding; reference algorithm; subcarrier allocation algorithm; wireless network; Greedy algorithms; Interference; Network coding; OFDM; Resource management; Throughput; Wireless networks;
Conference_Titel :
INFOCOM, 2011 Proceedings IEEE
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-9919-9
DOI :
10.1109/INFCOM.2011.5935189