| 摘要: |
| 相继干扰消除(successive interference cancellation,简称SIC)是一种多包接收技术,它从冲突信号中解码报文.SIC 可有效减轻无线网络中的干扰. SIC 的顺序解码特性给链路调度带来了新的挑战.提出并发图以刻画SIC 导致的链路相关性.基于并发图,定义链路的干扰数并据此设计有效的调度机制.证明了基于并发图的链路调度是NP-hard 的,而最大干扰数提供了极大贪婪算法的性能下界.在讨论了一类基于独立集的贪婪算法之后,结合干扰数对链路排序,给出了一种理论上性能更好的算法.仿真结果表明,仅需略高于现有模型的开销,与IEEE 802.11 相比,新调度算法的性能提高可达110%. |
| 关键词: 多包接收 相继干扰消除 链路调度 干扰数 近似算法 |
| DOI：10.3724/SP.J.1001.2012.04035 |
| 分类号: |
| 基金项目:国家自然科学基金(61070203) |
|
| Scheduling Schemes in Wireless Networks with Successive Interference Cancellation |
|
Lü Shao-He, WANG Xiao-Dong, ZHOU Xing-Ming
|
|
National Laboratory of Parallel and Distributed Processing, National University of Defense Technology, Changsha, 410073, China
|
| Abstract: |
| Successive interference cancellation (SIC) is an effective way of multipacket reception (MPR) to combat interference at the physical layer. The fact that the links decoded sequentially by SIC are correlated at the receiver poses key technical challenges. The study characterizes the link dependence and proposes simultaneity graph (SG) to capture the effect of SIC. Then, the interference number is defined to measure the interference of a link and facilitate the design of scheduling scheme. The study shows that link scheduling over SG is NP-hard, and the maximum interference number bounds the performance of maximal greedy schemes. An independent set based greedy scheme is explored to efficiently construct maximal feasible schedule. Moreover, with careful selection of link ordering, the study presents a scheduling scheme that achieves a better bound. Simulations evaluate the performance. The throughput gain is up to 110% over IEEE 802.11, while the complexity of SG is comparable with that of the conflict graph. |
| Key words: multipacket reception successive interference cancellation link scheduling interference number approximation algorithm |
