Research On Delay-tolerant Routing Mechanisms For Social Networks

As a new research direction,delay tolerant networks(DTNs)are a type of self-organizing network that uses node movement to realize message transmission.As the main solution to realize the "restricted network" interconnection problem,DTNs greatly expand the application of wireless networks and promote the continuous development of network technology.DTNs do not meet the basic assumptions of the Internet.There is no stable and continuous link from end to end,and the existing "store-and-forward" routing mode cannot be used for message transmission.The "storage-carry-forward" routing mode is used for message transmission.However,with the rapid development of mobile networks,the advancement of wireless communication technologies and the popularity of smart mobile terminal equipment,communication via mobile devices carried by people or vehicles will become an area of interest for the future development of networks,and DTNs will inevitably be applied in social network scenarios.Therefore,researching delay-tolerant routing technology for social network scenarios will have important scientific significance and application value for the development of the mobile Internet in the future.Thus,for DTNs used in the social scene,the problems of node mobility,regularity,selfishness and limited resources are faced in the process of designing the routing mechanism.This paper comprehensively summarizes the research status of DTNs,analyzes their development trends,and proposes some new methods to improve the network performance and user experience.This work provides a reference for the improvement of the routing mechanism for the social network environment.The main research contents of this paper are organized as follows.Firstly,based on the nodes have the regularity of the moving trajectory,to effectively forward the messages in the network,a delay-tolerant routing algorithm based on the regularity of the social network mobility model is proposed.The algorithm establishes a fix station in a node-dense area and acts as a network control center and a message collection center.In addition,the nodes in the network are clustered,and a certain number of tokens are allocated in each cluster such that the node obtains a token before the message can be forwarded.The experimental results show that the algorithm can achieve efficient forwarding of messages and reduce the delay of message and network overhead.Secondly,due to the mobility of the node,messages experience long delays and large numbers of hops during the transmission process.In the social network scenario,a node has a society and usually hopes a relay node with a short delay and few hops forwards messages for itself.A delay-tolerant routing algorithm based on social network delay and hop count evaluation is proposed.The algorithm first evaluates the delay and hop count of the relay node to the destination node and constructs a weight function with respect to delay and hop count.A node with a relatively short delay and a relatively few hop count to the destination node is selected as a relay node according to the weight value of the relay node.The experimental results show that the proposed algorithm can effectively reduce the delay and hop count of messages delivered to the destination node in the network without affecting the delivery ratio of messages in the network.Thirdly,the resources(buffer,power,etc.)carried by the nodes are extremely limited due to the mobility of the nodes.In the social network scenario,there are different levels of negative nodes,and even a malicious node is not willing to consume its own resources to forward messages to other nodes,resulting in the network performance being poor and resources not being effectively utilized.A delay-tolerant routing algorithm based on the social network incentive mechanism is proposed.The algorithm first defines a contribution function for measuring the amount of buffer resources and energy resources consumed by the node.The contribution function value is used to determine the probability that the message is received by the relay node during the request to forward the message.The experimental results show that the algorithm can increase the delivery ratio of messages by encouraging nodes to cooperate in message forwarding while the buffer resources and energy resources are limited.At the same time,the algorithm can effectively reduce the message delay and network overhead.Finally,a multicopy routing algorithm is used for message transmission,it is easy to cause node buffer overflow.A buffer management algorithm for multicopy delay-tolerant routing in social networks is proposed.The algorithm queues the messages in the node according to the message attributes and selects messages in different message queues to discard by determining whether the node is the destination node of the newly received message.The experimental results show that the algorithm not only improves the message delivery ratio but also reduces the delay and network overhead by effectively utilizing the limited buffer resources of the node.