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...
详细信息
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 clusteringalgorithm 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.
The multi-hopclusteringalgorithms like Max-Min heuristic improve the scalability of mobile ad hoc networks compared to single-hopclusteringalgorithms. However, few papers focus on maintaining the stabilities of th...
详细信息
ISBN:
(纸本)9781424462520
The multi-hopclusteringalgorithms like Max-Min heuristic improve the scalability of mobile ad hoc networks compared to single-hopclusteringalgorithms. However, few papers focus on maintaining the stabilities of the multi-hop clusters. And multi-hop clusters without maintenance are prone to disruption due to mobility and large size against routing performance. We propose a k-hop cluster maintaining mechanism for mobile ad hoc networks (kCMM) based on Max-Min heuristic algorithm to increase the stability of multi-hop clusters for large-scale and dense scenarios. It uses the shortest paths from members to cluster heads and the local information stored in nodes to manipulate link failures and malfunction nodes after cluster formation. The simulation results demonstrate that the kCMM algorithm decreases number of cluster heads, prolongs clusters existing time and requires less control messages compared to kCMBC algorithm.
暂无评论