Research On Wireless Network Link Scheduling Based On SINR And SIC

The problem of wireless network link scheduling mainly includes two sub-problems: First,Maximum Link Scheduling problem.That is,maximizing the number of links that can be transmitted concurrently in a single time slot;Second,Shortest Link Scheduling.The problem is to ensure that all links are successfully transmitted in the smallest time slot.As the link scheduling problem is one of the basic issues of the wireless network,and the solution to this problem is closely related to the network performance such as capacity and throughput of the wireless network.Therefore,how to design an efficient link scheduling algorithm to solve this problem is worth our in-depth study.In addition,in the process of solving the link scheduling,an unavoidable problem is link interference,which is usually caused by the concurrent transmission of multiple links.The presence of interference affects the wireless network's transmission capacity and increases the network transmission delay.Therefore,it is very important to study the link scheduling problem and solve the link interference problem.First of all,there are two common methods of solving interference: one is interference avoidance.Through the TDMA,FDMA and other scheduling methods,The links are divided by certain scheduling methods into independent channels that are relatively different,or treat the interference as environmental noise;the other is to Interference Cancellation.The nodes jointly decode composite signals,thus the interference can be eliminated and higher network capacity can be achieved.For example,Successive Interference Cancellation is a type of Multiple Packet Reception technology.The SIC uses the receiver to iteratively decode the strongest signal in the received composite signal until all signals are decoded or decoded incorrectly.Based on the existing research results of scholars at home and abroad at this stage,This thesis is based on a Signal-to-Interference plus Noise Ratio(SINR)model that is closer to the real-world scenario and a wireless network with SIC capabilities.We studied Single Slot Scheduling and Shortest Link Scheduling problem.In the first chapter of this thesis,we introduce the related fundamental knowledge of wireless networks,state the research background and significance of the subject,analyze and illustrate the research status and trends of the topic,and finally summarize the research content of the subject.In the second chapter,we mainly introduce SINR model and SIC technology,as well as other related fundamental knowledge of wireless networks.In the third chapter,we study the shortest link scheduling problem in the first part.For this problem,we use the SIC-enabled wireless network in the SINR model and propose a High Interference Factor(HIF)to study the interference of concurrent transmission links in the scheduling set.According to HIF,we propose Distributed Link Scheduling Algorithm Based on High Interference Factor(DLSHIF),and analyze the performance and simulation results of the algorithm.In the fourth chapter,we propose the optimal rate selection problem based on data packet demands in the first part,and propose a fast rate selection algorithm to solve the problem.In the second part,the maximum link scheduling problem is studies.We propose a Maximum Link Scheduling Algorithm Based on Vertex Effect(MLS-VE),and analyze the performance of the algorithm by simulation.In chapter five,the solution of link scheduling problem proposed in this paper is summarized,and the next work and prospect are put forward.