Research On Multiple Backup Routing Algorithms In Mobile Opportunistic Networks

In some practical application scenarios,such as deep space communication,wildlife tracking,and other scenes,there is usually no end-to-end reliable connectivity link,resulting in the traditional network can not operate effectively.Therefore,the research on mobile opportunistic network has attracted wide attention of researchers.Mobile opportunistic networks can realize communication without relying on fixed infrastructure,and has strong adaptability to topology time-varying,node resource limitation,and density sparsity.The opportunistic network uses the mode of store-carry-forward to complete the data transmission task.In the whole process of data transmission,the forwarding path is not determined in advance,and each hop forwarding node is selected dynamically.Usually,after going through multi-hop nodes,the packet is transmitted to the destination.This routing mechanism of side routing and side transmission is called opportunistic routing.Through in-depth research and analysis of the existing opportunistic routing algorithms,it is found that the routing mechanism based on utility and redundancy can further improve the delivery rate of the network and reduce the transmission delay,but it has the problem of high network overhead.In addition,the energy problem is rarely considered in the existing utility and redundancy-based routing mechanisms.However,the energy of nodes in the special network environment is limited,and the excessive participation of high-utility nodes in data transmission will lead to the rapid exhaustion of energy and death,which will aggravate the intermittence of the network.Therefore,this paper carries out research work on the above two problems.The main innovations are as follows:First,in this paper,in order to solve the problem of high network overhead in the routing mechanism based on utility and redundancy,a routing algorithm based on node relationship mining is proposed.The algorithm aims to make full use of the social information of nodes to reduce network overhead.First of all,the social relations of nodes in the network are analyzed.Considering the self-difference and dynamic variation of node relations,the complex social relations are dynamically mapped based on the contact situation of nodes.The contact intensity and contact relationship between nodes are defined,and an opportunistic network model with time attribute is constructed.Secondly,in order to make full use of the relational utility of nodes,a data set of node relations is constructed,and a model is built by combining the Apriori algorithm to mine the potential correlation between nodes.The possibility of establishing a connection between nodes and the destination node is calculated based on conditional probability,which is used as the social forwarding utility of nodes.Finally,the routing is guided according to the social forwarding utility of the node,so that the data packets always flow to the intermediate nodes with more potential association with the destination node,so as to reduce the network overhead on the premise of higher delivery rate and transmission rate.Second,in this paper,in order to solve the problem of uneven energy consumption of nodes in the routing mechanism based on utility and redundancy,a routing algorithm based on node utility and energy is proposed.The routing algorithm aims to optimize the performance of multi-copy routing and balance the energy consumption of nodes under given energy constraints,and prolong the survival time of nodes in the network.First of all,the grey GM(1,1)model is used to analyze the change of the contact intensity of the node in a short time in the past,and predict the contact intensity of the node in the future.Secondly,the social forwarding utility of the node is calculated based on the predicted contact intensity to guide the routing work more pertinently.Finally,according to the remaining energy of the node to decide whether to participate in the data forwarding work,when it is greater than the set threshold,and then synthesize the social forwarding utility of the node to determine the forwarding capability of the node,in order to achieve the purpose of balancing the energy consumption of the node.This paper starts with the routing direction of mobile opportunistic network,studies the multi-copy routing algorithm,makes full use of the node utility to further reduce the network overhead and balance the node energy consumption,and verifies the effectiveness of the proposed method through simulation.