Name
Abstract | ||
|---|---|---|
We investigate the problem of multi-user radio resource allocation for orthogonal frequency division multiple access (OFDMA) amplify-and-forward (AF) relays. In the single-user case, the problem reduces to the well know assignment problem, which maximizes the user rate. For the multi-user case we devise a resource allocation algorithm to achieve max-min fairness. We find max-min fairness since it can provide almost flat ubiquitous coverage. We start by formulating a convex optimization, which takes a parameter that asymptotically makes the optimization produce max-min fair rates. Since the optimization is a convex problem, we are able to devise a suboptimal gradient-based algorithm to solve it quickly. Simulations show that the algorithm achieves results very close to the optimum solutions due to its gradient origins. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/VETECF.2010.5594345 | 2010 IEEE 72ND VEHICULAR TECHNOLOGY CONFERENCE FALL |
Keywords | Field | DocType |
Max-Min Fairness, Amplify-and-Forward Relays, Resource Allocation, Scheduling, Sub-Channel Pairing | Resource management,Mathematical optimization,Computer science,Orthogonal frequency-division multiple access,Assignment problem,Resource allocation,Frequency-division multiple access,Convex optimization,Relay,Orthogonal frequency-division multiplexing | Conference |
Volume | Issue | ISSN |
null | null | 1550-2252 |
Citations | PageRank | References |
2 | 0.38 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alireza Sharifian | 1 | 9 | 1.68 |
| Petar Djukic | 2 | 288 | 17.91 |
| Halim Yanikomeroglu | 3 | 4413 | 367.42 |
| Jietao Zhang | 4 | 76 | 12.76 |