A low complexity matching game approach for LTE-Unlicensed

This paper analyzes the resource allocation problem in the LTE-Unlicensed spectrum to increase performance of the unlicensed systems. The problem is modeled with a matching game approach and the proposed resource allocation algorithm consists of a heuristic based on the usage of preference lists, one for each user equipment (UE) and on unlicensed bands, to determine a many-to-many matching between UEs and component carriers (CCs), aiming at maximizing the unlicensed overall network sum rate. Thus the proposed algorithm realizes a mapping between user equipments and unlicensed channels, also considering the carrier aggregation (CA) mechanism, which is typical of LTE-U. In the simulation evaluation, we compare the proposed algorithm with the Hungarian algorithm w.r.t. the system throughput and the robustness to perturbed input data. Both algorithms have almost equivalent performances, but the Hungarian algorithm presents much higher computational complexity than the proposed one.