Journal of South China University of Technology (Natural Science Edition) ›› 2009, Vol. 37 ›› Issue (1): 119-123,129.

• Computer Science & Technology • Previous Articles     Next Articles

Ant Colony Algorithm-Based Fair Routing Algorithm for Wireless Mesh Networks

Liu Yong-guang1  Ye Wu1  Feng Sui-li1  Zhuang Hong-cheng2   

  1. 1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, Guangdong, China; 2. Huawei Technologies Co., Ltd, Shenzhen 518129, Guangdong, China
  • Received:2007-11-20 Revised:2008-03-07 Online:2009-01-25 Published:2009-01-25
  • Contact: 刘永广（1972-），男，博士，广东轻工职业技术学院高级工程师，主要从事QoS路由和流量控制研究． E-mail:liu．yongguang@gmail．com
  • About author:刘永广（1972-），男，博士，广东轻工职业技术学院高级工程师，主要从事QoS路由和流量控制研究．
  • Supported by:

    粤港关键领域重点突破项目（20060104-2）

PDF

1037

Abstract:

As the centralized management architecture adopted by wireless Mesh networks often results in unbalanced bandwidth and load allocation, this paper proposes a fair bandwidth-allocation routing algorithm based on the ant colony algorithm by introducing a fair routing evaluation standard named minimum per-user average bandwidth. In the proposed algorithm, the traffic load is balanced and the bandwidth is fairly allocated for each user by maximizing the minimum per-user average bandwidth with the aid of optimization function of ants＇ travelling. Simulated resuits indicate that, as compared with the existing algorithms, the proposed algorithm may result in fairer bandwidth allocation though both the complexity and the average path length increase.

Key words: Mesh network, ants algorithm, fair routing

CLC Number: