A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and dijkstra (CAKD) in topology partitioning. The routing information of...
详细信息
ISBN:
(纸本)9780769549354
A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and dijkstra (CAKD) in topology partitioning. The routing information of each node can be computed during the clustering process, and CAKD reduces the time cost in routing computation and the storage in storing routing information. Experiments showed that, compared with using dijkstra to cluster, CAKD cost less time. Meanwhile, compared with the strategy of global shortest path, the routing computation strategy based on improved clustering algorithm costs less storage in storing routing information.
In this paper it is propose a routing algorithm using PSO (Particle Swarm Optimization). The PSO outperforms the classical dijkstra algorithm in that PSO could handle multi-objective routing problems while the Dijkstr...
详细信息
ISBN:
(纸本)9781467311762
In this paper it is propose a routing algorithm using PSO (Particle Swarm Optimization). The PSO outperforms the classical dijkstra algorithm in that PSO could handle multi-objective routing problems while the dijkstra cannot. A simulation model was build where PSO is distributed implemented and the optimum route is calculated on each node until destination is reached. This distributed approach gives the proposed algorithm extra avails in that no centralized arbiter is needed. The optimization also considers supporting Quality-of-Service (QoS) to routing in CRNs. It has been shown that algorithm would adapt multi-hop routing according to different QoS requirements, which makes it achievable in future CRNs.
The dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of Petri Net, it is used t...
详细信息
The dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of Petri Net, it is used to solve the shortest path problem, and according to the thought of directed Petri Net and transition enabled rules, Petri Net algorithm of solving the shortest path problem is designed. Compared to the dijkstra algorithm, this algorithm which omits the P, T tabs and λ, S functions of the dijkstra algorithm, can make the solution of the shortest path simpler and more convenient, improve the solution efficiency, and at the same time provide convenience for achieving algorithm objectively using computer.
The shortest path problem based on the data structure has become one of the hot research topics in graph *** the basic theory of solving this problem,dijkstra algorithm has been widely used in engineering *** at the s...
详细信息
The shortest path problem based on the data structure has become one of the hot research topics in graph *** the basic theory of solving this problem,dijkstra algorithm has been widely used in engineering *** at the shortcomings of traditional dijkstra algorithm,this paper has proposed an optimization method which has mainly improved the nodes selection of the shortest path and data storage structure and *** comparison and analysis,the improved algorithm has been obtained,which has reduced the storage space,improved the operational efficiency and has a better applicability in the shortest path calculation.
Real-valued data are quantized according to the magnitude of their fluctuations around regional mean values or around a given, real-valued signal. Quantization does not require any parameter or threshold value except ...
详细信息
Real-valued data are quantized according to the magnitude of their fluctuations around regional mean values or around a given, real-valued signal. Quantization does not require any parameter or threshold value except the desired number of regions. By the introduction of suitable fluctuation measures and a so-called change point graph, the determination of a minimum quantization is transformed to the computation of the shortest path with a prescribed number of intermediate nodes. Such shortest paths are shown to be computable by dynamic programming and by a variation of the dijkstra algorithm. Evaluations and extensions of the approach are included. Copyright (C) 2011 John Wiley & Sons, Ltd.
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution ...
详细信息
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it investigates solutions to the a-shortest path and the most shortest path in an uncertain network. It points out that there exists an equivalence relation between the alpha-shortest path in an uncertain network and the shortest path in a corresponding deterministic network, which leads to an effective algorithm to find the alpha-shortest path and the most shortest path. Roughly speaking, this algorithm can be broken down into two parts: constructing a deterministic network and then invoking the dijkstra algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
Proposed is a method based on the dijkstra's algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulation...
详细信息
Proposed is a method based on the dijkstra's algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulations show that a gain of three decades and a half in the error floor is obtained for short block sizes.
Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has b...
详细信息
ISBN:
(纸本)9783642211522
Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has been proposed in this paper to find an alternative and disjoint path with primary one by creating a new backup routine table based on adjacent nodes for each node connected with the primary one. The results showing that loss packets, reroute and end to end delay times have been improved between source and destination with avoid loops on the network. The result obtained showed that new schema does not degrade from the network performance by sending an additional messages to create a new backup routing table. The Simulation results (using NS2 simulator) show a comparison between existing link state protocol and the proposed algorithm.
The current work deals with the problem of growing population in the cities and the associated mobility problems. For this problem it is proposed a Multi-Modal Transportation Advisor system, based on the integration f...
详细信息
individual ambulance velocity and response time to a single incident. Existing lane based models have been modified by formulating mathematically emergency vehicle capability and behavior in the UK. The model is appli...
详细信息
ISBN:
(纸本)9781457721977
individual ambulance velocity and response time to a single incident. Existing lane based models have been modified by formulating mathematically emergency vehicle capability and behavior in the UK. The model is applied to calculate travel time. The velocity is simulated for different scenario of city environments. The response time of the ambulance is then calculated using a dijkstra algorithm. The model is shown to provide the means to differentiate ambulance travel time compared to non emergency road users.
暂无评论