Research On Routing Algorithms Based On Community Aware In Opportunistic Networks

With the development of computer science technology,clients have put forward the requirements of high efficiency,wide range and large amount of data for communication equipment and communication technology.Nowadays,due to the rapid proliferation of smart wireless devices,the rapid development of mobile communication technology has promoted the emergence of a tolerable wireless ad hoc network with delays and splits,which is known as opportunistic networks.Because of some severe challenges such as low data transmission rate,high network latency,long data queue waiting time,and unstable communication connections,routing algorithm can be regarded as the primary issue in opportunistic networks.Research on routing algorithm of opportunistic networks is beneficial for improving the data transmission environment of traditional wireless multi-hop self-organizing networks.Opportunistic networks can be applied to many scenarios where the communication network is unstable and lacks of fixed communication infrastructure,which has great practical significance in wireless communication.This paper will focus on the design of opportunistic network routing algorithm based on community awareness,which is as follows:(1)This paper proposes a community-aware routing algorithm based on a type of compound similarity between nodes(social behavior and mobile behavior similarities),which is known as NSCA.NSCA routing algorithm first evaluates the communication ability and communication state of neighbor nodes,and then excludes those nodes with insufficient communication ability or unstable communication state from relay nodes.Moreover,the proposed algorithm determines the optimization process of the community by evaluating the composite similarity between each neighbor node and the destination,divides the nodes whose composite similarity is higher than the average similarity from the networks into the same community,and delivery messages to the neighbor nodes belonging to the community.In different periods of time,the algorithm continuously evaluates the composite similarity between these neighbor nodes and the destination in different communication domains,gradually updates and optimizes the community structure,and finally transmits data packets to the destination.NSCA improves the delivery ratio and average end-to-end delay in opportunistic networks to a certain extent.(2)A novel community-aware routing scheme based on community optimization and trajectory prediction is proposed in this paper,which is named as NPLP.This algorithm is based on the analysis and evaluation of the clients' mobile trajectory,and utilizes the large data transmission opportunities between two nodes with a high similar mobile trajectory to implement the data transmission process.According to the theory of Markov chain,the proposed routing strategy includes three interlocking steps: network state information collecting and updating,community detection and optimization,trajectory prediction and data transmission.Simulation results show that compared with the other four routing strategies of opportunistic networks,NPLP strategy improves delivery ratio and effectively reduces overhead and end-to-end delay.