Abstract:

The capacity of modern wireless communication systems is limited by interference. Successive Interference Cancellation (SIC) is an effective way of multipacket reception to combat interference at the physical layer. This paper focuses on link scheduling under the SINR (Signal to Interference Noise Ratio) model in an Ad Hoc network with SIC. The facts that interference is accumulated and that the links decoded sequentially by SIC are bring about key technical challenges. To characterize the accumulative effect, for a given link,  conflict set is defined as a set of links that can interfere with the detection at the link. And then, we propose a conflict set graph (CSG) to characterize the interference and define interference degree to measure the link interference. As scheduling over CSG is NPhard, an independentsetbased greedy scheme is explored to efficiently construct a maximal feasible schedule. The performance is evaluated by simulations. As compared to the simple greedy method ［1］, the throughput gain is on average 30% and up to 60%.

Key words: link scheduling;successive interference cancellation;SINRbased interference model