Research SINR Wireless Link Based Scheduling Problems

Wireless Sensor Networks (WSNs) integrated micro-electronics, embedded computing,modern network and Wireless communication, distributed information processing and otheradvanced technology, is able to real-time monitoring, collaborative perception and gatheringnetwork coverage of various environmental or monitoring object information, and carry on theprocessing, after processing the information is sent via Wireless way, and to the observer withthe group multiple hops networks.Scheduling problem is a very important problem in wireless sensor networks. Wireless linkscheduling plays a more and more important role in WSNs, because it is closely related tonetwork life time and the capacity of wireless networks, wireless link scheduling optimizationproblem has many versions, for maximizing the throughput capacity of link scheduling has twoversions: Maximum Multiflow and Maximum Concurrent Multiflow. For minimum delay linkscheduling version is the Shortest Fractional Link Scheduling. One-Slot Link Scheduling andOne-Slot Weighted Link Scheduling are two questions closely related to the wireless linkscheduling. In this paper, the link scheduling of these two problems in WSNs is carried on thedetailed research and analysis.In this paper, we describe all kinds of interference model for link scheduling problem based onthe large amount of work for the existing research scheduling problem in WSNs, and the existingresults are analyzed and summarized for the SINR interference model. Both heuristic algorithmsand approximation algorithms for One-Slot Link Scheduling and One-Slot Weighted LinkScheduling problems are proposed under the SINR interference model. Theoretical analysisshows the correctness and simulation results show the effectiveness for the proposed algorithms.This paper includes five parts. The first chapter classifies network models of link schedulingproblems in WSNs. The second chapter gives a survey of the wireless link scheduling problemsunder the SINR interference model. In the chapter3we propose heuristic algorithms for theOne-Slot Link Scheduling and One-Slot Weighted Link Scheduling problems under the SINRinterference model, and carry on the theoretical analysis and simulation verification, the resultsshow that our algorithms have better performanc compared with the existing algorithms. In thechapter4we propose approximation algorithms for One-Slot Link Scheduling and One-SlotWeighted Link Scheduling problems under the SINR interference model, and carry on thetheoretical analysis and simulation verification, and we get a better result. In the chapter5, weconclude the One-Slot Link Scheduling and One-Slot Weighted Link Scheduling problems underthe SINR interference model in this paper, and look ahead the wireless link scheduling problemunder the SINR interference model in the future.