Pareto efficient resource matching for LTE-A system

Carrier Aggregation (CA) is one of the main technologies used in Long Term Evolution Advanced (LTE-A) networks. It helps to increase bandwidth up to 100 MHz and downlink speed up to 3Gbps. Research work for CA based LTE-A network have focused on component carrier (CC) selection and packet scheduling. Most of the earlier work on resource scheduling has considered CC selection, resource allocation and link adaption as separate problems. In this paper we model the problem as a matching game and propose a Game theory based sub-optimal solution. This paper introduces concept of using two sided matching game for resource matching in CA based LTE-A 4G networks to find a Pareto optimal stable matching. Simulation result shows that the proposed scheme performs better than existing method.