Research On Routing Algorithm Of Opportunistic Network

With the popularity of mobile devices such as smart phones,mobile network technology is rapidly developing.A new network ar-chitecture called the Mobile Opportunistic Network has attracted widespread attention in recent years.The mobile opportunity network is a kind of delay tolerant network.The main feature is that communication can be realized without infrastructure such as a base station.Compared with the Ad-hoc network which is also infrastructure-free,the nodes in the mobile opportunity network are relatively sparse,so there is often no stable communication path between the two endpoints.Therefore,the mobile oppotunity network generally adopts "store-carry-pass" routing policy.How to design an efficient routing algorithm under this strategy has always been a hot issue in mobile opportunity networks.Currently,the research of mobile opportunistic network routing algorithms mainly focuses on the use of social information of nodes to assist the algorithm.This thesis mainly studies the routing algorithm in the mobile oppotunity network,which mainly includes the following two parts:1.I propose a routing algorithm that utilizes the social attributes of nodes.In reality,devices are often held by people,and people have social attributes,so the trajectory of devices held by people has the same attributes.The algorithm first collects the historical contact information of the nodes,then maps the nodes into the vector space,and uses the vector representation of the nodes to achieve community partition and contact probability estimation.The simulation based on real trajectory shows that the algorithm has higher delivery success rate and lower overhead than another algorithm.2.I propose an energy-limited routing algorithm.In practical scenarios,the energy of mobile devices is often limited,so it is important to save energy and improve the lifetime of nodes.Traditional algorithms rarely consider energy consumption.This algorithm considers the residual energy of the relay node as one of the considerations when transmitting the message,and avoids the link failure due to the excessive energy consumption of the individual nodes in the traditional algorithm.The simulation based on real traj ectory and simulated traj ectory shows that the algorithm is superior to another energy efficient routing algorithm in terms of transmission success rate,overhead and node survival rate.Finally,the research results of this thesis are summarized,and the shortcomings in the research and the research directions of future are put forward.