Matching Theory In Heterogeneous Wareless Networks

As wireless communications technology matures, the wireless communications network is gradually developing into Heterogeneous Wireless Network. So the resource allocation problem in Heterogeneous Wireless Networks becomes a hot issue to be solved. This paper is mainly to use the matching theory to solve the matching problems in Heterogeneous Wireless Networks. At present, there is little literature in which matching game theory is applied to Heterogeneous Wireless Networks, and the few articles related to the base station cache problem. Therefore, in Heterogeneous Wireless Network this article proposes a matching algorithm between the users and the base stations and at the same time introduces a content matching algorithm between the base station caches and the content of users. The main content is as follows.Firstly, for Heterogeneous Wireless Networks we propose a matching algorithm between the users and the base stations, i.e., PA(Proposed Allocation) algorithm. PA matching algorithm is based on the university admissions policy in the matching theory. When establishing the preference lists with two sides, we consider the backhaul link power loss and the backhaul delay. Through an iterative process of PA algorithm we finally get a stable optimal matching of the Heterogeneous Wireless Network systems to maximize energy efficiency.Secondly, for Heterogeneous Wireless Networks, we introduce the concept of the cache. We add an internal cache in every small base station. Then we propose a matching algorithm between the content and the base station caches, i.e., CA(Cache Allocation) algorithm. CA algorithm is also based on the college admissions bilateral matching strategy. When establishing the preference lists, we consider the data in the data epidemic, backhaul delay and other factors. By CA algorithm, we minimize the delay in the Heterogeneous Wireless Network systems and improve the user experience.Finally, We make two simulation experiments for the two algorithms. In the PA algorithm simulation, we considered two scenarios. One is when the users are evenly distributed in the network system, and the other is when the users gather around some small base stations. The simulation results show the superiority of PA algorithm. In the CA algorithm simulations, We are also taking into account the above two simulation scenarios. By comparing it with the other two algorithms, We have proven CA algorithm can effectively reduce the overall service latency in Heterogeneous Wireless Network.