A location aided controlled spraying routing algorithm for Delay Tolerant Networks

Delay Tolerant Networks (DTNs) often suffer from intermittent disruption and variable long delay due to factors such as mobility and energy. In this paper, a Location Aided Controlled Spraying (LACS) routing algorithm is proposed to deal with the challenging issues in DTN routing. Only the routing information carried by the contacted nodes is needed in this algorithm, and there is no need for global networks knowledge and hardware support. The routing process is divided into two stages, i.e., controlled spraying routing stage and single-copy routing stage. The maximum transfer throughput of the contact is checked before each message is forwarded. During the controlled spraying stage, the current node adjusts spraying strategy according to the encounter angle of the contact nodes. During the single-copy stage, a location prediction model based on the semi-Markov process (SMP) is introduced, and the node's behaviors can be captured both in the temporal and spatial domains with this model. The current node predicts the destination node's location, and then decides whether to forward the message to target node based on the time used for meeting the destination node. Simulation results show that the proposed algorithm can achieve better performance than the traditional routing schemes of DTNs in terms of delivery ratio, network overhead and transmission delay under both random node movement model and realistic trace scenario

Determination of Router Location for Optimizing Computer Network Using Dominating Set Methods

The aims of this research is to develop a system to determine an optimal router location in a computer network. The router location is optimal if the computer network need the minimal number of router without losing the network connectivity. The methods used in order to optimize the router location are dominating set and Greedy algorithm. The data is the router location of computer network in University of Jember. The result showed that the optimal router needed in the networks is 4. These routers were found by using the determination system that implement Greedy algorithm to find the minimum number of dominating set

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words