The Research Of Mobile Agents Path Scheduling In Most-Static Nodes DTN

DTN(Delay Tolerant Network)is recently proposed,it belongs to self-organization networks.The network has many different characters with tradition network,for instance,it has weak link between nodes and it has more delay than other tradition network.However,DTN is more practical in the society,and it has raised many specialists’ attention.There exists a special type network in the DTN set,which is called most-still nodes DTN.This network has classic characters of tradition DTN,and it has its unique characters,like most nodes in the network are ―still‖,and a few nodes can be mobile to service the whole network,for example,those mobile nodes collect information,distribute data,supply energy for those still nodes.We call those mobile nodes mobile agent.Mobile agents path planning problem aims at find proper algorithm for the mobile node in the network,it contains the classic travelling salesman problem,in many network application,mobile nodes path planning problem is NP hard.This paper connects special DTN with NSP(Node Scheduling Problem)and mainly makes two aspects about information collection and data distribution.The primary content as follows:(1)To the question of collecting information from sea by scheduling ship,this paper makes use of two-hop greedy algorithm to schedule ship routing.The proposed two-hop greedy algorithm has greater improvement than one-hop or random-select algorithm,and it can collect more and well-distributed information from different automatic divers.(2)To the question of sending different type patients to different hospital,this paper uses the improved Hungarian algorithm with practice to propose an novel algorithm called HAEP to solve the problem of sending patients to hospital in big city.The proposed algorithm can efficiently send different type patients to higher or lower hospitals,and save quality time to save patients.