| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 694494 | Acta Automatica Sinica | 2012 | 8 Pages |
The k-hop interference model is widely used in link scheduling problem because of its simplicity. However, the model is an unrealistic abstraction of the wireless interference, and inevitably results in limited throughput performance for any link scheduling algorithm based on it. In this paper, we define the k-hop hidden link and the k-hop exposed link, and then propose the k-hop directed interference model, which excludes the possible wireless collision caused by the k-hop hidden link. Theoretical analysis reveals that the k-hop directed interference model is closer to reality than the k-hop interference model if k is not more than IR+1, where IR is the ratio of carrier-sensing range to transmission range. Furthermore, valid range of k for the k-hop directed interference model is also deduced.
