Research On Opportunity Network Routing Protocol Based On Community Structure

Opportunistic Networks is a novel self-organizing network model with the general characteristics of the Delay Tolerant Network and it utilizes the encounter opportunities arising from node movement to implement communications and aims at resolving the data communication problem for the frequent interruption network. In Opportunistic Networks, nodes usually form a disconnected network due to nodal mobility, low density, limited energy and storage, etc. The source node and destination node being located in different connectivity domains leads to the result that conventional communication protocol of wireless ad hoc networks can not be effectively run in Opportunistic Networks.Both at home and abroad doing a lot of work for researching of the opportunity network routing technology recently. In addition, they put forward various ideas of routing algorithm multi-copy. In this paper, we present background and theory of the project, then show merit and demerit, classification about routing protocol of wireless network and DTN. Because the nature of the opportunity network community structure is ignored by the routing Algorithm in being, It is difficult to solve the problem of network transmission delay and Message traffic. Hence the paper gives an algorithm of opportunity routing Algorithm based on community structure divided, This algorithm according to the frequent degree to network nodes contacting to divide community structure. The community internal use Epidemic algorithms to transfer messages, meanwhile Comprehensive characteristic value concept can be used to make message with directions in high traffic. Between the community using bridge node(Often between trip in communities) to transfer message between on communities. Realize the goal of reducing messages copy number and improve message transfer efficiencyFinally, our research chooses ONE as simulation platform. This thesis simulates and analyses our proposed routing algorithm by setting different parameter value for network simulation scenarios, to estimate the routing Algorithm performance of the opportunity network based on Community structure. Results show that the routing algorithm can control the number of message copy and forwarding conditions, realizing a high-performance method of the data transform, decreasing the copy and process of data。...