A Four-Sided Matching Game for Energy-Efficient Scheduling in Narrowband-IoT Networks

Abstract

This paper studies the uplink resource allocation problem in NB-IoT networks. We aim to maximize the network’s energy efficiency to serve devices in need for long battery lifetime. Also, the network energy efficiency is affected by the associated UEs to candidates, carrying the scheduling information for UEs. For this reason, we investigate the joint resource allocation and Candidate-UE association problem in the uplink (UL) in NB-IoT. The resource allocation problem allocates the UEs with the suitable scheduling delay value and subcarrier indication field. The Candidate-UE association problem selects the appropriate UE for each candidate. The optimization variables involved in the joint problem are divided into binary association variables and binary resource allocation variables. This makes it hard to solve the joint problem since its optimization variables are of combinatorial nature. To this end, we formulate the joint problem as a four-sided matching game that ranks the UEs, candidates, the scheduling delay values and subcarrier indication fields while considering maximizing the energy efficiency as a preference metric. We then describe a four-sided matching game algorithm to solve the problem. The simulation results highlight the proposed algorithm’s effectiveness compared to other algorithms in the obtained network energy efficiency.

Keywords

• Energy efficiency
• matching theory
• NB-IoT
• resource allocation