Routing Research Based On Region Partition And Node Activity In DTN

The traditional Interconnection network(called Internet)is based on the TCP/IP.TCP/IP has been able to develop rapidly,because it is adapted to the needs of worldwide data communications.The smooth operation of the TCP/IP requires a continuous,bi-directional,end-to-end path,and the physical link it relies on requires a short delay,symmetrical data rate,and low bit error rate.But as the network continues to evolve,some of the physical links of the network do not have one or more of these features.In this case,in 2002,Kevin Fall et al.proposed the concept of Delay Tolerant Network(DTN)at the ICIR conference,which is message-oriented overlay system network architecture.Since then,the researchers have carried out research on various aspects of DTN,including DTN routing,congestion control,security and so on.DTN was originally developed by interstellar communication network.It has the characteristics of low transmission rate,intermittent connection,frequent node movement,delay tolerance,error tolerance,limited storage and poor communication environment,which can adapt to the link instability between nodes and nodes caused by sparse distribution of nodes,irregular movement and limited resources.In such a network environment,it is decided that DTN should adopt its unique routing strategy.Researchers have done a lot of work in the routing,proposed a series of effective routing algorithm,mainly the two categories,including a single copy and multiple copies.Because DTN’s unique network environment,how quickly and reliably transfer data to the destination,researchers need to design a reasonable data transmission program.This thesis first introduces the research background and characteristics of DTN,and then introduces the DTN architecture,the mobile model of nodes and the comparison of classical routing protocols.Finally,we study the Spray and Wait routing,and on the basis of Spray and Wait routing we propose the routing algorithm.The main contents of this thesis are as follows:Firstly,according to the concept of network area,the scheme of dividing the network area is proposed,and the relay node and the ferry node are set up in the area.Considering the density of nodes in each region,the distance between regions and the mobility of nodes,the concept of node activity is proposed.And then dynamically allocates the number of copies of the message according to the node activity.Secondly,a Spray and Wait routing algorithm is proposed based on the characteristics of network area partitioning and node activity.By region division,a large network area can be divided into multiple small network areas,and the relay nodes and ferry nodes are set on these areas.Through the node activity,the node can dynamically allocate the number of copies of the message,but also can choose the most suitable next hop node according to the activity.Thirdly,in this thesis,we use THE ONE simulator to simulate,the Binary Spray and Wait(BSW)routing,Message Residual Value aided Binary Spray and Wait(MRV-BSW),and Adaptive Spray and Wait Routing Algorithm based on Capability of Node(CoN-ASW)and the results are analyzed and compared.