Resource Allocation Algorithm Research In LTE-A Relay System

Today, with the rapid development of the information society, wireless network has convenient us access to information. We wish wireless network is everywhere, we are eager to have amazing speed and good stability of the wireless network. From analog communications to digital communications, from2G to3G, to today’s4G, but not at all, we need faster and larger, more stable network. In order to meet the needs of wireless communication in2020, the ITU is proposed next-generation mobile communication technology goals. One of the key technologies of LTE-A system is relay technology, and proper allocation of resources is the key step in wireless network. It is the issue how to allocate resource in LTE-A system with relay.It is relay that can improve edge users’ QoS, enhance the overall throughput of the system. Of course, introducing the relay, the time slot structure of the system will become more complicated. In a multi-hop network, we have to proper allocate resource between base station and relay station, while minimizing intra-cell and inter-cell interference.Firstly, we build a multi-objective problem which takes throughput and fairness as the goals. And we improved the traditional simulated annealing algorithm which is designed to solve the multi-objective problem. Finally we reach the limitation of the theoretical optimal system resource allocation scheme.It is consuming to settle problem of resource allocation through the new simulated annealing algorithm and it is not applicable in practice. This paper presents a dynamic frequency allocation algorithm based on sector factor. The algorithm ignores the disadvantage of the static soft frequency which reuse frequency in fixed partition. We can flexibly match users over the entire frequency band. The concept of sector factors is introduced to further guarantee the users’fairness. Simulation shows that the new algorithm achieves better result both in throughput and fairness.