A potential game approach to distributed power control and scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed subchannel assignment in an OFDMA relay
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Distributed subchannel assignment in a two-hop network
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The paper studies a relay network that comprises multiple source nodes, one common multi-antenna relay node and multiple destination nodes. The transmitting nodes (source and relay) have access to channel information and to some interference-related information. A noncooperative game model is used to address the distributed resource allocation problem among different source nodes. Quality-of-Service-aware source nodes opportunistically select their transmission resources while a multi-antenna channel-aware relay node assigns the resources at the relay in a way that maximizes the sum of utilities at the destination nodes. The beam allocation game is a potential game for which the implicit joint objective (potential) of the source nodes formalizes a trade-off between the sum of individual utilities and the sum of congestion costs. Numerical examples illustrate the performance of opportunistic channel allocation.