Research Article
Collision-free Routing Centralized Scheduling Using EbMR-CS Algorithm for IEEE 802.16 Mesh Networks
@INPROCEEDINGS{10.1007/978-3-642-17994-5_16, author={Yaaqob Qasem and Ali Alhemyari and Chee Ng and Nor Noordin and Omar. Ceesay}, title={Collision-free Routing Centralized Scheduling Using EbMR-CS Algorithm for IEEE 802.16 Mesh Networks}, proceedings={Ad Hoc Networks. Second International Conference, ADHOCNETS 2010, Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={5}, keywords={WiMAX mesh networks fairness CUR EbM routing centralized scheduling}, doi={10.1007/978-3-642-17994-5_16} }- Yaaqob Qasem
Ali Alhemyari
Chee Ng
Nor Noordin
Omar. Ceesay
Year: 2012
Collision-free Routing Centralized Scheduling Using EbMR-CS Algorithm for IEEE 802.16 Mesh Networks
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-17994-5_16
Abstract
Being an emerging wireless broadband technology with numerous prospects, Worldwide Interoperability for Microwave Access (WiMAX) not only provides high data rate but also the last mile solution for broadband wireless access (BWA). WiMAX enables both point to multi-point (PMP) and mesh topologies solution. In centrally controlled WiMAX mesh mode, all data packets are routed to the subscriber stations (SSs) via base station (BS). Thus, the BS link may be constantly congested with data traffic which impacts the performance of the system. The goal of this paper is to create an efficient multi-hops routing with suitable scheduling algorithm in WiMAX mesh networks (WMN). This algorithm is called energy/bit minimization routing and centralized scheduling (EbMR-CS) algorithm. Here, a routing tree is constructed based on the energy/bit minimization (EbM). This algorithm looks for a short path from the current node to BS, while the optimal path is achieved when the whole path has the lowest EbM. After the route is fixed, and the traffic demanded at each node is known, the total traffic arriving at a node is centrally scheduled such that the transmission interferences can be avoided. The proposed algorithm has considered some important design metrics such as fairness, reuse timeslot, balanced load, concurrent transmissions and hop count. The result shows that the proposed EbMR-CS algorithm has reduced the length of scheduling up to 43%. The system throughput and channel utilization ratio (CUR) have been enhanced up to 68% and 45%, respectively.
