Context-aware link scheduling in static wireless networks with successive interference cancellation
Greedy link scheduling based on the physical model was studied in a static wireless network with SIC.In general,there were two major stages in a greedy scheduling scheme,link selection,i.e.,to decide which link was scheduled next,and time slot selection,i.e.,to decide which slot was allocated to a g...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)08-0069-08/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Greedy link scheduling based on the physical model was studied in a static wireless network with SIC.In general,there were two major stages in a greedy scheduling scheme,link selection,i.e.,to decide which link was scheduled next,and time slot selection,i.e.,to decide which slot was allocated to a given link.Most available schemes took a first-fit policy in the second stage and became less efficient when SIC was available.For the time slot selection stage,tolerance margin was defined to measure the saturation of a link set and two heuristic policies were presented:one was to schedule a link to a slot such that the resulting set of links had a maximum tolerance margin; the other was to choose a slot such that the decrease of tolerance margin was minimum.Simulation results show that the performance of the proposed schemes is much better than the first-fit policy. |
|---|---|
| ISSN: | 1000-436X |