Research On Campus DTN Routing And Forwarding Algorithm Based On Node Social Attributes

Delay-tolerant network(DTN)is a kind of extreme environment-oriented communication network based on the store carry forward paradigm,which is used to solve the problem of high delay and intermittent transmission.Campus DTN is different from some networks which are affected by the delay,bandwidth,and error code.Electronic devices(nodes)on campus are usually carried by people and have the same social attributes as people;The campus has a high population density and a high degree of network congestion;The campus activity area is limited and the planning is reasonable;Node mobility is periodic and time-varying.Traditional DTN routing algorithm can not be directly applied to campus,so a routing algorithm suitable for campus DTN is designed.Aiming at the relay node selection problem and routing long message path planning problem in the campus DTN routing process,this paper does the following work:Firstly,to solve the problems of low data delivery rate,high delay,and high routing overhead caused by the dynamic change of campus delay-tolerant network topology,a campus DTN routing algorithm based on students' Society(CNS)is proposed.The contact plan is used to determine the quality of node connection;This paper analyzes the characteristics of campus DTN node movement,and uses the Markov model to predict the node position according to the regular movement trajectory of students;By calculating the social similarity of nodes,the community is divided,and the best relay node is determined.In the buffer of the relay node,the message with high delivery probability is selected to transmit to ensure the efficiency of data transmission.Compared with the traditional multi-copy routing algorithm,CNS has some advantages in message delivery rate,average delay,and routing overhead.Secondly,due to the limitation of node cache and contact time,the traditional DTN routing protocol has a short duration after contact,and the long message cannot be forwarded in one contact.This paper aims at the transmission of a long message in campus DTN,A campus DTN routing algorithm CLSF(campus DTN routing based on long message segment forwarding)is proposed.Firstly,the algorithm creates the node contact diagram and stores the node information;The node path sampling is carried out by node2vec method;Considering the random moving state,social properties,and transmission energy consumption,the link weight of the nodes is determined;The log transformation is introduced,and Dijkstra algorithm is used to find the best transmission path to ensure the delivery rate of messages.The experiment shows that the CLSF algorithm has a high delivery success rate when routing long messages.