RAWNET 2012, 8th International Workshop on Resource Allocation and Cooperation in Wireless Networks 2012, May 18, 2012, Paderborn, Germany
In this paper, we investigate user grouping for cooperative scheduling in a two-cell network. When the number of transmitters grows large, the complexity of the Hungarian algorithm optimum for user pairing becomes unaffordable in real-time systems. We consider user grouping algorithms maximizing the network sum rate in cells with a massive number of
terminals and/or sensors. We provide a suboptimal user grouping algorithm which substantially reduces complexity compared to the optimum Hungarian algorithm with negligible capacity degradation. Surprisingly, the proposed algorithm outperforms
the greedy algorithm with a considerable lower complexity.
Type:
Conférence
City:
Paderborn
Date:
2012-05-18
Department:
Systèmes de Communication
Eurecom Ref:
3679
Copyright:
© 2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
