By Topic

An Efficient and Interference-Aware Centralized Routing Tree Algorithm for the Routing and Packet Scheduling Problem in IEEE 802.16 Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Pi-Rong Sheu ; Dept. of Electr. Eng., Nat. Yunlin Univ. of Sci. & Technol., Douliou, Taiwan ; Chuan-Fu Hu ; Chi-Chiuan Liou ; Fang-Chen Chuang
more authors

IEEE 802.16 mesh network allows a subscriber station (SS) to use the hop-by-hop method to transmit packets to the base station. However, there exist interferences among the transmissions of SSs. Therefore, the routing and packet scheduling problem becomes an important research issues in IEEE 802.16 mesh net-work. In this paper, we design an efficient and interference-aware centralized routing tree algorithm which takes the number of interferences associated with a SS into consideration in an IEEE 802.16 mesh network. Our routing tree algorithm enables more SSs to con-duct simultaneous transmissions, which efficiently shortens the scheduling length, and increases both the channel utilization ratio and the system throughput. In other words, our routing tree algorithm is capable of enhancing the overall network performance. Simulation results show that our routing tree algorithm out-performs the IEEE 802.16 standard and the two routing tree algorithms proposed by Hemyari et al.

Published in:

Communications and Mobile Computing (CMC), 2010 International Conference on  (Volume:3 )

Date of Conference:

12-14 April 2010