Abstract | ||
---|---|---|
We consider the joint allocation of receiver, bit, and power to subcarriers in the downlink of multicell orthogonal frequency-division multiple-access (OFDMA) networks. Assuming that the cells share the entire bandwidth and that the rates are discrete, we formulate the joint allocation problem as a nonlinear mixed integer program (MIP), which however has exponential worst-case complexity. We capitalize on the capability of the receivers to measure the interference-plus-noise on every subcarrier and decompose the joint problem into a set of smaller-scale linear MIPs solved by individual base stations. Accordingly, we propose a distributed algorithm with linear complexity, in which the base stations participate in the problem solution in a round-robin manner. Simulation results demonstrate the effectiveness of the proposed algorithm in comparison with the iterative waterfilling algorithm and the successive optimal solution, by means of standard branch-and-cut solvers, of the individual MIPs. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/WCNC.2012.6213982 | 2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) |
Keywords | Field | DocType |
ofdm modulation,optimization,receiver,distributed algorithms,resource management,integer programming,nonlinear programming,branch and cut,ofdm,communication complexity,radio receivers,downlink,interference,distributed algorithm,base station,iterative methods,communication systems,resource manager,subcarrier | Subcarrier,Mathematical optimization,Iterative method,Computer science,Nonlinear programming,Communication complexity,Distributed algorithm,Integer programming,Frequency-division multiple access,Orthogonal frequency-division multiplexing | Conference |
ISSN | Citations | PageRank |
1525-3511 | 4 | 0.42 |
References | Authors | |
11 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mohammad Fathi | 1 | 11 | 3.99 |
Eleftherios Karipidis | 2 | 429 | 34.53 |