Study On Routing Algorithm Of DTN Based On Node Location Preference

DTN (Delay Tolerant Network) is a new type of Network, which mainly used in the big Delay, low transfer rate, frequent interruptions and equipment capacity itself is not strong. Such as a dynamic Network in the battlefield, mobile sensor Network, vehicular AD hoc Network, etc. In DTN research work, the routing algorithm research is a hot spot.At present, the DTN routing algorithms have made some achievements. The routing algorithm mainly include two categories: a routing algorithm based on multiple copy control and a single copy of the message routing policy. The epidemic routing algorithms, direct link and two jump mechanism, the earliest delivery algorithm and other algorithms have some shortcomings. Some network load is too large, some choose routing without changing course flexibly according to actual condition. In view of the node has site access preferences is a widespread and stable characteristics, this paper puts forward PLBR DTN routing algorithm based on node location. The author collected the data of access the site number, frequent access, access time length from 60 students and staffs’ mobile devices, and use MIT Reality mobile trajectory and real project provided by the node between the meeting record to experiment. Comparing å†'泡 and Label algorithms with the experiment, which under the condition of changing various parameters by comparing the success rate of data transmission, data retransmission times, and the traffic status of the transmission delay three aspects, finally the experimental results proved that PLBR is more effective than å†'泡 and Label algorithms.