On Fairness Call Admission Control In Next Generation Wireless Networks

Along with the development of mobile communications, as well as the types of user needs and the increase in demand, the number of users accessing wireless network is also increase substantially. Unlike wired networks, wireless networks have their inherent characteristics, such as the scarcity of bandwidth resources, and the users' mobility. Therefore, how to use the limited wireless resource to provide services to wireless users as much as possible, i.e., improve the wireless utilization of wireless resources while guarantee the users' quality of service (QoS), becomes an important issue for radio resource management (RRM). Being important parts of RRM, call admission control (CAC) and the scheduling algorithm play an important role in the wireless communication networks.Based on the fruitful results of previous studies, and aiming at user's QoS guarantee, this thesis proposes fairness call admission control schemes in wireless multimedia communication networks.On the basis of the definition of 3GPP basic traffic model, a pricing based fair admission control strategy is proposed. i.e., by constructing a price function, which restricts the access of video traffic when the load is heavy so as to release some resource for other traffic, the fairness of resource utilization in different load condition can be achieved while guaranteeing the resource utilization.By introducing the game theory which has been maturely developed in the field of economics into the admission control strategy, a reasonable allocation of resources to coordinate the effectiveness and fairness can also be achieved. Hence, this thesis proposes a CAC strategy which is based on price theory and game theory. The analysis and simulation results show that: by using this pricing function and game approach, the fairness of resource utilization is well achieved while the resource utilization is maximized, and the resource utilization obviously increased at the cost of small packet lose rate and delay.Along with rapid development of broadband data and the multimedia traffic, future mobile communication systems will provide a packet-level traffic. Hence, the wireless packet scheduling algorithm, which plays an important role in the radio resource management, is gradually becoming the focus of the RRM study. Considering the finite buffer size and variable packet length, a novel practical scheduling algorithm is proposed to meet various delay constrains. In the algorithm, a time utility function which shows a packet's grade of urgency is proposed with the assumption of finite buffer size and variable packet length. With the time utility function, packets of each type of traffic can be absolutely served within a maximum bearable delay, thus time critical requirement of different type of traffic is meet. Simulations results prove that the algorithm proposed in this thesis not only ensures the delay characteristics of all kinds of traffic, but also ensures a certain amount of throughput.