The Research On The Opportunity Network Routing Algorithm And Cache Management Based On The Link State

Since the new century, with the development of information technology especially the development of wireless communication technology, a unique network named opportunity network come into people’s vision. With the gradually expanded application of wireless network, the wireless network is found not very suitable in many applications in the traditional wireless network architecture, routing and other aspects, so the opportunity network attracted the attention of the people. The routing problem is the core of the opportunity network. At present, the research of opportunistic network routing problem is most concentrated in the study of routing algorithm, and most of the routing algorithm has its limitations and its performance differences under different mobile model. The current research on routing problems are concentrated in the study of routing algorithms, but there are little research on the management of the cache for opportunistic networks. Buffer management has a great effect on the performance of the routing algorithm. Simple cache management strategies, such as FIFO, often exhibit poor performance.This paper firstly introduces the background and significance of the opportunity network, and introduces several classic opportunistic network routing algorithm and make a comparative analysis, and also introduces the basic knowledge of mobile model in the simulation and buffer management. Secondly, integrating the shortcomings of existing opportunistic routing algorithm, we propose a routing algorithm based on node link state algorithm, we try to solve the performance differences of the same algorithm in different node mobile models, we simulate our algorithm in mobile model under different simulation experiments, and the verified the effectiveness of the the algorithm. Thirdly, combining the routing algorithm based on link state, put forward a kind of buffer management algorithm based on link state, the simulation experiment is undet two mobile model. Finally, the routing and buffer management algorithm we are summarized.