Abstract
It is crucial to improve the fairness among flows in wireless mesh networks. Modern Radios have the characteristic of frequency agility, and enable dynamic reconfiguring their center frequencies and spectral widths. That offers rich possibilities for increasing the fairness in wireless mesh networks. Despite considering channel combining, existing spectrum allocation algorithms are still limited in the channelization framework. They insufficiently take the advantage of frequency agility and restrict the elevation of the fairness. In order to further improve the fairness in wireless mesh networks, the authors utilize the characteristic that both the spectral widths and time-slot lengths of links are continuously variable, and propose a new optimization algorithm. The algorithm schedules radio links using as few time slots as possible, and then jointly allocates the lengths of time slots as well as the spectral widths and center frequencies of radio links in each time slot to obtain a better feasible solution. Results indicate that compared to the existing algorithm, the new algorithm increases the fairness by 46% to 91% under various interference models.
Translated title of the contribution | A fairness optimization algorithm of variable spectral widths and time-slot lengths in wireless mesh networks |
---|---|
Original language | Chinese |
Pages (from-to) | 65-75 |
Number of pages | 11 |
Journal | Jisuanji Xuebao/Chinese Journal of Computers |
Volume | 34 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2011 |
Externally published | Yes |
Keywords
- Link scheduling
- Multi-path routing
- Spectrum allocation
- Variable spectral widths
- Variable time-slot lengths