Design And Analysis Of Wireless Network Transmission Scheduling Algorithm Based On

The rapid development and the increasing maturity of the distributed information processing technology, wireless LAN technology and GPRS/3 G wireless internet technology as the representative of other communications technology promote the development of wireless networks. Wireless networks have been attracted more and more attention because of its potential applications in many fields.Scheduling is a fundamental problem in wireless networks. Various scheduling strategies can achieve different objectives, such as maximize the throughput of networks, capacity maximization, minimize delay and obtaining some fairness of networks. From the view of transmission forms, transmission scheduling in wireless networks can be roughly divided into link scheduling and mobile stations scheduling. Compared with the wired networks, wireless networks have the characteristic of sharing channel, then simultaneous transmissions of multiple links will inevitably cause interference between these links, or even hinder destination signals received correctly, which in turns reduces the performance of networks. As a significant problem in wireless networks, link scheduling is particularly a key point on improving the performance of wireless networks in the case that with strict quality of service constraints.Link scheduling problem in wireless networks can be classified into two categories, one-slot link scheduling, also known as maximize link scheduling and the shortest link scheduling, also known as the shortest time-slot scheduling. The goal of the former is to find the maximum number links that can be transmitted simultaneously. And the objective of the latter is to schedule all links in networks using the shortest time. Considering the mobile stations scheduling in wireless networks, the main achievement is scheduling mobile stations under the rate control in order that the number of mobile stations that can be transmitted simultaneously is the largest and correctly decoded at the base station. In this paper, we conduct extensively research and analysis of these above problems.Based on the analysis of existing scheduling algorithms, firstly, we propose the improved shortest link scheduling algorithm IAASLS* and the shortest multicast transmission scheduling algorithm SMTS-SIC under the SINR (Signal-to-Interference-plus-Noise-Ratio) model with SIC (successive interference cancellation), where SINR interference model is closer to the situation of wireless networks and owns the characteristic of cumulative interference. SIC is a typical multi-packet reception technology, which allows the presence of interference and can decode multiple signals at a receiver successively. Secondly, we develop the centralized link scheduling algorithms based on ISR under different powers. Finally, we develop transmission scheduling algorithms under the SINR model combined with rate control.The whole text contains six chapters in total. The first chapter overviews the research background, significance and status of domestic and foreign of the transmission scheduling problems in wireless networks. In chapter 2, we classify and summarize these transmission scheduling algorithms under different interference models. In chapter 3, we propose two improved shortest link scheduling algorithms under the SINR combined with SIC, and the common point of these algorithms is that they have improved the throughput of networks. In chapter 4, the SINR model is simplified as the ISR and we develop centralized link scheduling algorithms based on ISR. According to the mutual relationship between SIC mechanism and rate control, then we design the transmission scheduling algorithm combined with SIC and rate control in chapter 5. Finally, we conclude the shortest link scheduling problem with SIC and the transmission scheduling problem combined with SIC and rate control that we study in this paper and have a prospect for the future work in chapter 6.