Journal of South China University of Technology (Natural Science Edition) ›› 2011, Vol. 39 ›› Issue (4): 38-43.doi: 10.3969/j.issn.1000-565X.2011.04.007

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Wireless Mesh Gateway Selecting and AP Clustering Algorithm Based on Clustering

Huang Shu-qiang1  Zhou Ji-peng2   

  1. 1. Network and Educational Technology Center,Jinan University,Guangzhou 510632,Guangdong,China;2. College of Information Science and Technology ,Jinan University,Guangzhou 510632,Guangdong,China
  • Received:2010-07-05 Revised:2010-09-18 Online:2011-04-25 Published:2011-03-01
  • Contact: 黄书强(1977-),男,博士,高级工程师,主要从事无线网络及信息安全研究 E-mail:hsq2008@vip.sina.com
  • About author:黄书强(1977-),男,博士,高级工程师,主要从事无线网络及信息安全研究
  • Supported by:

    广东省教育部产学研合作项目(2008B090500051,201013090400164);广东高校优秀青年创新人才培养计划项目(LYM09029);暨南大学中央高校基本科研业务费专项资金资助项目(21610704)

Abstract:

Aiming at the gateway deployment and AP clustering of wireless Mesh networks,a heuristic algorithm based on clustering is proposed.In this algorithm,first,a weight index of the minimum hops is designed to reflect the relationship between the gateway number and the minimum hops,with which a suitable initial solution is obtained by a heuristic algorithm.Then,the initial solution is adjusted and optimized via the k-means clustering to obtain a symmetrically network distribution.Finally,some simulations are carried out to verify the effectiveness of the proposed algorithm.The results show that,with the help of the algorithm,the three optimization objectives,namely,the minimum number of gateways,the minimum average number of hops from AP to gateway and the minimum load-balancing index,reach a good balance after the adjustment with finite times.

Key words: wireless Mesh networks, clustering, gateway deployment, minimum gateway number, minimum average hops, minimum load-balancing index, k-means algorithm