Adaptive Stable Clustering Method and System for Load Balancing in High Dynamic Wireless Networks

Abstract

The present invention discloses an adaptive and stable clustering method and system suitable for load balancing of highly dynamic wireless networks, wherein the method includes the following steps: S1. Calculate the cluster head competence of nodes according to the stable neighbor nodes, and thus Elect the optimal cluster head to form the initial cluster structure; S2. Adaptively maintain the cluster structure, including the maintenance of stable neighbor nodes, the storage and update of the standby follower node table, the change of cluster type, cluster fusion, cluster dissolution and multiple Maintenance of gateway node pairs. The present invention provides an adaptive and stable clustering method suitable for load balancing of highly dynamic wireless networks. Considering the impact of the clustering method on the three factors of clustering network connectivity, stability, and load balance, it can Density establishes a general and stable clustering structure in which multiple types of clusters coexist, making the clustering method applicable to various scenarios of large-scale traffic densities with uneven distribution of nodes.

Description

technical field [0001] The invention relates to a highly dynamic wireless ad hoc network, in particular to an adaptive and stable clustering method and system suitable for load balancing of a highly dynamic wireless network. Background technique [0002] Typical high dynamic wireless ad hoc networks mainly include vehicle ad hoc networks and UAV ad hoc networks, which are special ad hoc networks. Among them, VANETs (Vehicular ad hoc networks) is referred to as the Internet of Vehicles, which is the application of mobile ad hoc networks (MANET, Mobile ad hoc network) in the field of transportation. As an important part of the intelligent transportation system, VANETs provide vehicles with many applications for road safety, traffic management, and infotainment through communication between vehicles and between vehicles and infrastructure. [0003] In mobile ad hoc networks, there are two types of network structures: planar structure and layered structure. In the planar struc...

AI Technical Summary

Problems solved by technology

Among them, single-hop clusters are not common in actual traffic scenarios. For the clustering algorithm that forms two-hop clusters, when the vehicle density in the network is high, it is easy to cause cluster overlap due to the limited range of clustering. The number of vehicles is too large; when the vehicle density in the network is small, the small number of members in the cluster will lead to the waste of the cluster structure and reduce the communication efficiency. Therefore, this traditional clustering algorithm can easily cause an imbalance between the cluster size and the number of clusters.

Although a clustering algorithm based on multi-hops has also been proposed, for the K-hop cluster structure, if the value of K is too large, the cluster range will increase and there will be too many nodes in the cluster, which is not convenient for the management of many mobile nodes. In addition, the increase in the number of hops is also It will lead to a decrease in communication reliability; if the K value is small, due to the limited transmission range of nodes and the rapid movement of nodes, the number of members in the cluster and the cluster topology will change frequently, reducing the stability of the cluster

In addition, most of these multi-hop clustering algorithms are based on a single cluster structure, and cannot adjust the cluster type as the local density of the network changes, and are not suitable for complex scenarios where the traffic density in the network varies widely.

Images