Improved Search Algorithm Based on Probability of Node´s Degree on Complex Networks

As a hot research topic recently, complex networks have important practical significance and research value in studying of the search strategy and finding the specified files or data and determining the shortest path between nodes. Since the nodes with the highest degree are very susceptible to network congestion, we present an improved algorithm based on breadth-first search algorithm and high degree seeking algorithm. The current nodes transmit the query message to the neighbor nodes with the higher degree depending on their probability P of the nodes´ degree. Our strategy can redistribute traffic load in central nodes to non-central nodes. The simulations are made on classical networks models and real networks. Our results indicate that the proposed search algorithm has better search results.