An Efficient Routing Tree Algorithm for Combined Uplink and Downlink Subframes on Centralized Scheduling in IEEE 802.16 Based Wireless Mesh Networks

HTML  Download Download as PDF (Size: 2389KB)  PP. 219-226  
DOI: 10.4236/ijcns.2011.44026    4,742 Downloads   8,904 Views  Citations

Affiliation(s)

.

ABSTRACT

IEEE 802.16 mesh mode defines routing tree for transmitting data in centralized scheduling but it does not define any explicit proposal for combining uplink and downlink subframes. Deploying combined uplink and downlink subframes on the centralized scheduling scheme can be more flexible and utilization is improved. However, existing interferences among the transmission of neighboring nodes lead to performance reduction of the network. In this paper, an efficient routing tree algorithm is proposed with combined uplink and downlink slot allocation on the centralized scheduling scheme which can abate interferences in the network. This algorithm allows more subscriber stations to transmit concurrently and so improves spatial reuse in the network. Also, the algorithm uses multi-channel and single channel systems and considers relay model, smoothing switching frequently between transmitting and receiving in successive time slots and fairness in the network. Extensive simulation results demonstrate the effectiveness of the proposed method in terms of scheduling length, link concurrency ratio, network throughput and Channel Utilization Ratio (CUR).

Share and Cite:

A. Behfarnia and V. Vakili, "An Efficient Routing Tree Algorithm for Combined Uplink and Downlink Subframes on Centralized Scheduling in IEEE 802.16 Based Wireless Mesh Networks," International Journal of Communications, Network and System Sciences, Vol. 4 No. 4, 2011, pp. 219-226. doi: 10.4236/ijcns.2011.44026.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.