Heterogeneous Network Resource Scheduling Algorithm Based On Green Station

With the rapid development of Mobile Communication Technology, Mobile Internet and Consumer Electronics, the amount of mobile terminals grows exponentially.The problems of QoS(Quality of Service), transmission delay and cellular coverage are more and more prominent. Let alone the huge energy consumption and carbon emissions. It is urgent to design an e?cient resource scheduling strategy. LTE-A provides a more effective communication standard to solve these problems. And we focus on studying the resource allocation in heterogeneous relay network with the LTE-A system.This paper considers the following three situations: 1. The VMO(Virtual Mobile Operator) provides software services and asks hardware support from the WSP(Wireless Service Providers) while the WSP rents FBS(Femto Base Station) to enhance its coverage; 2. The heterogeneous relay network consists of one BS(Base Station)and several relays(usually portable green stations). The BS can choose serving users directly or through relays; 3. The BS should consider both ?ow control and energy management while allocating its resources. According to the above three scenes, this paper has done the following works:Study the relationship among FBS, WSP and VMO in communication market.In this paper, all of them will be divided into two different roles: leader or follower according to the decision-making stage. We use a four stage Stackelberg model to describe the problem and solve the model by backward induction. After the derivation,we solve the competition problem among FBSs, the allocation problem of spectrum resource, pricing problem and purchasing problem of throughput. In this paper, we design a incentive rules to urge FBSs help the WSP and that leads to a Nash equilibrium among FBS’s strategies. At last,the simulation proves the feasibility of the theory.We study the resource allocation problem for energy consumption minimum in a heterogeneous relay network. We first study the system model with relay and battery.However, the optimization problem is a mixed integer programming problem which makes it di?cult to solve. We solve this non-convex optimization problem in the Lagrange dual domain, showing that it has zero duality gap, and that a primal optimum can be obtained. In addition, we puts forward a suboptimal online algorithm to avoid the causal paradoxes in the o?ine algorithm. The performance comparison of two algorithms is given in the simulation part.Moreover, we propose another dynamic optimization algorithm for the joint allocation of subframes, resource blocks, and power in the Type 1 inband relaying system in the LTE-A standard. Following the general framework of Lyapunov optimization,we decompose the original problem into three sub-problems: the ?ow control problem,the subframe allocation, resource block allocation problem and the energy management problem. Then we prove that the proposed algorithm accommodates both instantaneous and average constraints. Simulation results demonstrate the stability of the system.