Routing Strategies On Weighted Network Which Clustering Coefficient Can Be Adjusted

Complex network are related to daily life. Constructing model of complex network is very important for exploring the actual network. Routing strategies can describe the process of exchanging information on complex network, many scholars pay attention to network congestion in the process of exchanging information. In this paper, establishing an optimized complex network model and find the efficient routing strategy for the purpose, The main studies as follows:First: Improving the classical BBV network model getting a new model which degree distribution, clustering coefficient can be adjusted. This method is to introduce exponent coefficient in priority algorithm and triangle connection of HK model in the process of expanding network, adjusting connection method on the base of the previous study. The clustering coefficient of the current node is taken into account, it accurate to each node. Simulation results show that this algorithm is can not only adjust degree distribution, but also can change the size and the distribution of clustering coefficient With a great flexibility and adaptability.Second: Two routing methods are proposed focus on congestion problem, they are improved local routing strategy and hybrid routing strategy. The local routing strategy is add the degree of the node to the ability of the node as the weight, the weight is the basis for the selection of the next node. The transmission ability of nodes is consist of node's degree and queue length. This strategy only need to know local information of neighbor nodes. Therefore, this strategy is simple and be suitable for large network which is difficult to know the information of all nodes. The hybrid routing strategy can increase network throughput, it make full use of the advantage of the traditional shortest path routing strategy, Sharing data flow by calculate the weight of the surrounding nodes when the node's load is too large. This method can avoid congestion. The weight of the node is based on clustering coefficient and the shortest distance.Simulation results show that throughput of the first strategy is 120, the throughput of the second strategy is 955 based on the new model,the size of the network is 1000. Higher efficiency can be acquired by these two routing strategies, they offer new methods for data transmission in networks.