In future cellular networks, self-organizing relaying terminals (RTs) are expected to play a crucial role in assisting the communication between base stations and wireless terminals (WTs), which include, not only active user terminals, but also machine-type communication devices. In the absence of channel quality indicators, the effective utilization of RTs requires a mechanism by which these RTs can assign available resource blocks (RBs) to a potentially large number of WTs with minimal conflicts. This requires optimizing RB assignments over a large set of lengthy sequences, which is computationally prohibitive for networks with large numbers of RTs. To alleviate the difficulty in designing such sequences, we develop a greedy algorithm, whereby pairs of RB assignment sequences are selected in an efficient sequential manner. The performance of the sequences generated by this algorithm is comparable to that of the sequences generated by exhaustive search, but with a significantly less computational cost.

Additional Metadata
Persistent URL dx.doi.org/10.1109/SPAWC.2014.6941671
Conference 2014 15th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2014
Citation
Fouad, Y.M.M. (Yaser M. M.), Gohary, R, & Yanikömeroǧlu, H. (2014). An efficient greedy-based autonomous resource block assignment scheme for 5G cellular networks with self-organizing relaying terminals. In IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC (pp. 304–308). doi:10.1109/SPAWC.2014.6941671