Context-aware Greedy Scheduling Algorithm in Wireless Network

Abstract

In order to measure the link’s interference in static heterogeneous wireless networks, we need to know its context information, but the context information can not be informed before the link allocates the time slot. Because of the highly inadequate collection and the use of traditional scheduling algorithms for link interference information, which severely limits their performance, this paper proposes the context-aware greedy scheduling algorithm. This paper analyses the cumulative effect of interference and the sequence detection feature of the serial interference cancellation (SIC, successive interference cancellation). The algorithm researches the strategy of choosing time slot, defines tolerance to measure the saturation of the link set and gives two kinds of new heuristic time slot selection mechanism. Finally, network simulator (NS 2) conducts simulation experiments which adopt performance evaluation as throughput to assess the performance of scheduling algorithm of this paper in the case of a single multi-hop. The experiments show that: the scheduling performance of context-aware greedy scheduling algorithm in heterogeneous static wireless network has been improved.