Mapping Model Research For Routing Metrics And Networking Scenarios In Delay/Disruption-Tolerant Network

Delay/Disruption Tolerant Network(DTN) is a special network model abstracted from Ad Hoc Network and Wireless Sensor Network. The features of delay, disruption and tolerance are the most important Characteristics in DTN. The characteristics about mobility, self-organization and limited energy of nodes make DTN contacts intermittently, result in high delay and low bandwidth in DTN. Currently, the DTN has been widely used under a variety of scenarios, such as mobile information exchange, battlefield communication, space exploration, intelligent transportation, wildlife tracking, and Internet access in remote areas. As one of the hotspots researches about new type of challenged networks, the DTN has attracted domestic and foreign research groups’ special attention.The network scenarios of DTN vary with time. The majority of current DTNs use single-router strategy, which lacks adaptability about dynamic network scenarios, leading to low accessibility in long-time running. This thesis investigated the background and current situation of DTN, and analyzed characteristic parameters, classified network scenarios, designed routing metrics sets, established the mapping model of optimum accessible path between network scenarios and routing metrics.This thesis combined the static network with time characteristic, analyzed the common characteristic parameters of DTN, and reached the definition and calculating method of Network Centralization, Structural Cohesion, Network dynamic Density and dynamic Clustering Coefficient. Based on above characteristic parameters, we used K-means clustering algorithm to classify the scenarios of DTN, and get different network scenarios in the running network. Then we utilized the Temporal Graph and Floyd algorithm to obtain the accessible paths of each network scenario. Any more, we designed routing metrics sets, investigated the influence of different routing metrics on the accessible paths of network scenarios with the Destructiveness Method, chose the routing metric which made the accessible paths changed biggest as the optimal one of this scenario and established the mapping model between dynamic network scenarios and routing metrics. Finally we used the ONE simulator to simulation the model above, get the choice of routing metric of biggest accessibility, the results were corresponded to the model above, finished the research work of this thesis. Eventually the research of this thesis lays the foundation for routing optimization algorithm under the dynamic network scenarios.