A DTN Routing Based On Historical Area And Neighbor Relation

DTN completes data transmission by means of storage and forwarding. Map information, historical track and neighbor meeting information are easy to be obtained in DTN network. The existing routing algorithms usually use only one or two kinds of information to make routing decisions, and lack of comprehensive utilization. In addition, the survival time of the data packet in DTN network is different with the requirement of application layer, and changeful. There is no corresponding solution to the existing routing algorithm.In view of the above problems, this paper proposes a HANR routing algorithm. HANR in accordance with the administrative region will map the region, the historical trajectory of the simplified representation of the various regions to reach the behavior of information. By maintaining a variety of time scales to measure the frequency of the node to reach the various regions of the law and the law of the neighbors meet. HANR uses hybrid routing, the routing process is divided into the area approach phase and the spray-and-waiting phase. According to the moving rule, the next hop can be close to the target node in the effective time. The number of the Bundle’s copies are decided by the neighbor meeting rule.HANR is implemented based on bytewalla, and ultimately run in the Android system. In order to facilitate the test and experiment in the real system, the network layer simulator is implemented in Android, and the interface program based on OSM open source map and SUMO custom map is implemented. The indoor and outdoor positioning interface program based on GPS sensor, gyroscope and acceleration sensor is implemented. In the practical system, the HANR and Epidemic are compared. The experimental results show that, even in the actual system of the cache is not limited, with the increase of the amount of data in the network, the delivery rate of HANR is significantly higher than that of Epidemic. In the actual system, the bandwidth resource of the limited meeting time is extremely valuable, and the utilization efficiency of HANR is obviously higher than that of Epidemic.