By Topic

Efficient link scheduling for TDMA based WMN using multi-objective genetic algorithm

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
$33 $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)
Chen Jian ; School of Information Science and Engineering, Northeastern university, Shenyang, China ; Jia Jie ; Wen Ying-you ; Zhao Da-zhe
more authors

Link Scheduling plays an important role for the performance of TDMA based wireless mesh networks. Traditional algorithms merely aim at maximizing the overall network throughput, which may introduce the scheduling delay. Theoretically the model of relationship between link scheduling with the network throughput and end to end scheduling delay is analyzed. Then, a heuristic algorithm to solve the near optimal scheduling period and scheduling delay for link list with fixed schedule order is proposed. Furthermore, as the performance is much more effected by the scheduling sequence, the link scheduling scheme to sort the overall network link list based on NSGA-II is proposed. By choosing the optimal scheduling sequence, the ratio of the slot spatial reuse is enhanced, thus to increase the network throughput with the overall network scheduling delay is minimized. Simulation results are presented to verify these approaches.

Published in:

Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on

Date of Conference:

23-26 Sept. 2010