Farej, ZK and Alani, OYK 
ORCID: https://orcid.org/0000-0002-5848-9107
2013,
'Minimizing of scheduling time under fair centralized scheduling and efficient routing algorithms for WiMAX based mesh networks'
, in:
2013 International Conference on Electrical Communication, Computer, Power, and Control Engineering (ICECCPCE)
, IEEE, pp. 141-146.
Abstract
n WiMAX mesh networks (WMN) the interferences among links have high effect on their performance. Therefore, an efficient routing algorithm is needed to choose the less interfered and more balanced links during the construction of the routing tree. Two Routing Tree Construction Algorithms, Paralleled (Par-RTCA) and Balanced-Paralleled (Bal-Par-RTCA) are introduced. The Bal-Par-RTCA, which is based on balancing the data and parallelizing the routes of the data from SS (Subscriber Station) to BS (Base Station), has the feature of Testing the Down-Node Group (TDNG). This feature increases the chance of conversion of Primary Interferences (PI) into Secondary Interferences (SI). The Modified Fair Relay Centralized Scheduling Algorithm (MFRCSA), which make use of spatial reuse efficiently, is also introduced here to avoid SI and increase concurrent transmissions over a certain time slot. As a result, system performance is enhanced in terms of Length of scheduling (L) and Links Concurrency Ratio (LCR). With spatial reuse and relative to the IEEE 802.16 standard Breadth First Tree (BFT) RTCA, the simulation results of the proposed Par-RTCA and Bal-Par-RTCA show LCR enhancement of 11.11% and 14.28%respectively.
| Item Type: | Book Section |
|---|---|
| Schools: | Schools > School of Computing, Science and Engineering |
| Publisher: | IEEE |
| ISBN: | 9781479956333 |
| Depositing User: | USIR Admin |
| Date Deposited: | 23 Nov 2016 12:51 |
| Last Modified: | 23 Apr 2019 11:47 |
| URI: | http://usir.salford.ac.uk/id/eprint/40858 |
Actions (login required)
 |
Edit record (repository staff only) |
Tools
Tools