Research On Routing Algorithm Based On Node Attributes In Opportunistic Networks

With the continuous progress and development of wireless communication technology,the number of various intelligent mobile terminals is growing rapidly.The traditional end-to-end transmission mechanism of base station network has been difficult to achieve a large amount of data communication between mobile devices.Therefore,the research on how to carry out effective data transmission between intelligent mobile terminals becomes very important.The data transmission mechanism of mobile opportunistic network can make multiple devices form a real-time data sharing network,which is a good solution to this problem.In view of the above problems,a routing protocol based on cooperation degree and movement direction of nodes(Bompa)is proposed.Firstly,the difference in the direction of motion between nodes is determined by calculating cosine vector angle between neighbors,and the neighbor nodes are divided into different sectors according to the different calculated values.At the same time,the paper takes the cooperation trend of nodes as an important forwarding utility value,and calculates the single cooperation trend of nodes to nodes and the overall cooperation trend of nodes to the whole network.Finally,select the nodes with high cooperation trend as relay nodes of data forwarding in each sector.The algorithm not only avoids the blindness of data copy distribution,but also makes the distribution of data copies more uniform in the network,and can effectively improve the data delivery rate.Secondly,considering that the duration of each encounter of nodes in the network is limited and the duration is not fixed,if the amount of interactive data is large,the communication bandwidth is small and the time to establish communication links is short,it can not guarantee the success of each transmission when a large amount of data transmission is needed.In this paper,a routing protocol based on node encounter strength(message forwarding mechanism based on node encounter strength in operational networks(ESON)is proposed.When quantifying the data forwarding capability of nodes,the protocol discusses the probability of node encounter and the average duration of each encounter.Finally,the concept of average meeting intensity of nodes is proposed in combination with these two attributes,which is the condition of data forwarding between nodes.The simulation results show that the two routing protocols proposed in this paper have better performance improvement in data delivery rate,end-to-end average transmission delay and average network overhead compared with the classical algorithms epidemic,bubble rap,preophet and spark and wait and ETNS algorithms proposed in recent years.In addition,this paper analyzes the research status of opportunistic networks,and summarizes the architecture and main application scenarios of opportunistic networks.The design principle and algorithm classification of opportunistic network routing mechanism are described.Finally,this paper summarizes the research results,and makes a prospect for the future work.