Scheduling Schemes in Wireless Networks with Successive Interference Cancellation
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

吕绍和,王晓东,周兴铭.相继干扰消除的无线网络中的调度算法.软件学报,2012,23(4):941-951

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 14,2010
  • Revised:January 31,2011
  • Adopted:
  • Online: March 28,2012
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063