Social Attributes Based Routing Strategy In DTN

Delay Tolerant Network(DTN),without a stable structure,is a kind of wireless self-organizing network.Because the nodes move randomly,most of the time,net-work is in the off state so that there are no stable end-to-end paths.It is mainly used in the extreme networks where the communication infrastructure is imperfect and the end-to-end connection and node resources are limited.In order to meet that the delivery of random asynchronous messages is reliable,it is used in interstellar war,rural network,etc.Mainly by adding redundant copies of the data packets,the routing protocols are used to increase the transmission efficiency and reduce delay and overhead in DTN.But the traditional DTN routing protocols are often unable to control the number of packet copies effectively,eventually they led to the decrease of the routing performance.Nowadays,more and more people begin to use mobile communication equipments in daily social activities(social contact network)and wireless communication technology is widely used in our life,so a mobile node in DTN is becoming more and more affected by the activities of people and human activities are with a certain stability and regularity.Of the DTN routing protocol research,this paper applies social attributes to DTN routing protocols and designs DTN optimal routing algorithms based on the social attributes.It is used to solve the problem of low transmission efficiency and it also can reduce the transmission delay when the environment in DTN is complex.In this paper,the specific research and work includes the following aspects:1.This paper comprehensively analyzes the social relations between the DTN nodes,proposes a DTN routing protocol based on a binary chart,gives the algo-rithm of the construction of the network model and routing algorithm based on a binary chart in DTN.Simulation experiments show that under the same condi-tions of network,this algorithm is better than the traditional routing algorithms on the delivery rate and the average end-to-end delay.2.In DTN routing algorithms,how to accurately predict the likelihood of future links between nodes is an important problem which people have been constantly exported.This paper proposes a DTN routing strategy based on Poisson dis-tribution,to quantify the possibility of node links.Compared to other routing protocols,this algorithm has more advantages in transmission efficiency and time delay.