多静态节点DTN中移动Agent路径规划研究

发布时间：2018-11-07 20:47

【摘要】：延迟容忍网络(DTN)是近年来兴起的自组织网络,该网络具有不同于传统网络的特征,例如网络连接易断裂,延迟大等,但由于其本身的实用性,引起了众多学者的研究。在DTN中存在着一种特殊形态的网络,称为多静态节点DTN,这种网络具备了传统DTN的一般特征,同时具备一些独特的特征,例如网络中大多数的节点处于“静止”状态,有少数的节点可以移动,这些移动的节点为整个网络提供服务,例如信息收集、数据分发、能量供给等,这类节点被称为移动Agent。移动Agent路径规划问题主要是为网络中的移动节点寻找路径调度方法,它包含了经典的旅行商问题,在很多网络应用当中,移动节点的路径规划问题在求解方面是NP组合优化难题。本文围绕多静态节点DTN中移动Agent的路径规划问题进行研究,分别针对信息收集和数据分发场景进行算法研究,文章的主要内容如下:(1)针对船舶收集海洋潜水器周期发送信息的情况,提出了启发式二跳贪心算法对船舶路径进行规划以达到尽可能多而且快地收集信息的目的。(2)针对不同患病程度病人的情况,派遣救护车将其运送到不同等级的医院的案例,阐述了使用改进的匈牙利算法并结合实际的紧急病人运送情况所提出的新颖的算法HAEP。该算法可以高效地将大城市中各类患病程度的病人运送到不同等级的医院,减少救护车的运送时间,并极大地争取了危急病人的救治时间。
[Abstract]:Delay tolerance network (DTN) is a self-organized network which has emerged in recent years. The network is different from the traditional network, such as the network connection is easy to break, the delay is large, and so on. However, because of its practicability, it has aroused many scholars' research. There is a special form of network in DTN, called multi-static node DTN, which has the general characteristics of traditional DTN and some unique features, for example, most of the nodes in the network are in "static" state. There are a few mobile nodes that serve the entire network, such as information collection, data distribution, energy supply, and so on. These nodes are called mobile Agent. The path planning problem of mobile Agent is mainly to find a path scheduling method for mobile nodes in the network. It includes the classical traveling salesman problem, which is used in many network applications. The path planning problem of mobile nodes is a NP combinatorial optimization problem. In this paper, the path planning problem of mobile Agent in multi-static node DTN is studied, and the algorithms of information collection and data distribution are studied respectively. The main contents of this paper are as follows: (1) the information of marine submersible cycle is collected. A heuristic two-hop greedy algorithm is proposed for ship routing planning to collect as much information as possible and quickly. (2) aiming at patients with different severity of illness, a heuristic two-hop greedy algorithm is proposed. In the case of sending an ambulance to transport it to different levels of hospital, a novel algorithm, HAEP., using the improved Hungarian algorithm and taking into account the actual case of emergency patient transportation, is described. The algorithm can efficiently transport all kinds of patients in big cities to hospitals of different levels, reduce the time of ambulance delivery, and strive for the treatment time of emergency patients.
【学位授予单位】：杭州电子科技大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TN929.5

【相似文献】