A Novel Multi-Path Routing Algorithm Based on Clustering for Wireless Mesh Networks

作者：Liu Chun Xiao^*; Zhang Yan; Xu E; Yang Yu Qiang; Zhao Xu Hui

来源：KSII Transactions on Internet and Information Systems, 2014, 8(4): 1256-1275.

DOI：10.3837/tiis.2014.04.006

• Wireless Mesh Networks (WMN)
• clustering algorithm
• k-hop clustering algorithm
• multi-path routing algorithm
• Virtual disjoint multi-path model (Vdmp)

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• 出版日期2014-4-29
• 单位渤海大学