For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon, in the consideration of trust relationship circumstances this paper presents an a...
详细信息
ISBN:
(纸本)9783037850978
For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon, in the consideration of trust relationship circumstances this paper presents an alliance certification scheme based on the lattice combining dijkstra path search algorithm between the domains. Theoretical analysis shows that dual-traction certification mechanism greatly increases system security, also avoids the single point collapse. According to calculating the path weight by dijkstra algorithm to find the shortest path in the weighted graph, the scheme can improve the certification efficiency.
Path planning is applied in a variety of ways, including transportation, telecommunications, etc. Path planning to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the moto...
详细信息
ISBN:
(纸本)9781457706530
Path planning is applied in a variety of ways, including transportation, telecommunications, etc. Path planning to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the motoring time and to ensure and efficient use of available road resources is the main challenge in route guidance system. In this paper we propose a fast path algorithm for finding the best shortest paths in the road network. This is poised to minimize costs between the origin and destination nodes. The proposed algorithm was compared with the dijkstra algorithm in order to find the best and shortest paths using a sample of Tehran city road network. Three cases were tested through simulation using the proposed algorithm. The results show that the efficiency of proposed algorithm and could reduce the cost of vehicle routing on the path planning problems.
A unified tree-search detection scheme based on dijkstra's algorithm is developed for MIMO systems. The proposed framework generalizes the original dijkstra's algorithm by allowing the memory usage, detection ...
详细信息
ISBN:
(纸本)9781424492688
A unified tree-search detection scheme based on dijkstra's algorithm is developed for MIMO systems. The proposed framework generalizes the original dijkstra's algorithm by allowing the memory usage, detection complexity, and sorting dynamic associated with the algorithm to be customized. By tuning different parameters, desired performance-complexity tradeoffs are attained and a fixed-complexity version can be produced to facilitate hardware implementation. Simulation results demonstrate that the proposed algorithm shows abilities to achieve highly favorable performance-complexity tradeoffs.
Best-routing is one of the effective ways to solve the problem of traffic jam in a technical way. Based on the classic dijkstra algorithm, the bidirectional search algorithm is adopted to improve algorithmic efficienc...
详细信息
ISBN:
(纸本)9780819469144
Best-routing is one of the effective ways to solve the problem of traffic jam in a technical way. Based on the classic dijkstra algorithm, the bidirectional search algorithm is adopted to improve algorithmic efficiency in this paper. And section resistance is also adopted in best-routing model in order to indicate not only the condition of road itself, but also the information like traffic flow, which can make the road information more general and efficient. And cross linked list is adopted to reflect topological information of road net, which ensures the weight keep minimum. The feasibility and efficiency are verified by a study case of local area in Beijing.
path-finding is one of the key application problems in Geographical information *** problem can be attributed to essentially the shortest path algorithm of network *** paper proposes an improved model based on Dijkstr...
详细信息
path-finding is one of the key application problems in Geographical information *** problem can be attributed to essentially the shortest path algorithm of network *** paper proposes an improved model based on dijkstra *** method covers the shortage of extremely low efficiency of dijkstra algorithm when processing mass data of the nodes and ***,according to the characteristics of geographical information system on the search optimization,this algorithm model greatly improves the searching success rate and *** testing in a real city road network example,it proved that by given origin and destination,the method in this paper can rapidly,effectively,accurately find the route,highlighted render it and display.
Up until now, the optical cable network has covered many cities of China. However, there are still so many middle or small sized cities which are not connected to the grid backbone optical cable network of the country...
详细信息
ISBN:
(纸本)9780819469144
Up until now, the optical cable network has covered many cities of China. However, there are still so many middle or small sized cities which are not connected to the grid backbone optical cable network of the country. It is urgent to connect these middle or small sized cities into the backbone optical cable network of the country as soon as possible. However, up until now, little work has been done to find a better way for route choice of main optical cables, including those based on GIS methods. This paper proposes a new method for route choice of main optical cables, i.e., the method for route choice of main optical cables based on dijkstra algorithm. In this paper, a model for route choice of main optical cables is built, the influencing factors are chosen and quantified according to the specific situation of Guanyun County, and the route of the main optical cables of Guanyun is chosen and drawn on the map. The result shows that the method proposed by this paper has more potentials than the traditional method used in Guanyun County.
With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account the r...
详细信息
With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account the real-time traffic information. Meanwhile, with the development of the computer technology, communication technology and geographical information technology, intelligent navigation brings more benefits to people. It can save the trave time and reduce energy consumption. On the other hand, using intelligent navigation, people can avoid roadblock, traffic jams, traffic accidents etc. Intelligent navigation can provide a safer and more reassuring environment. Combining with the Internet of Things, this paper proposes an improved routing algorithm for dynamic traffic navigation based on the Internet of Things platform. GPS will download the real- time traffic information by accessing the built Internet of Things platform, calculate the optimal path precisely, and then provide real-time and more intelligent navigation service for people.
For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon,in the consideration of trust relationship circumstances this paper presents an al...
详细信息
For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon,in the consideration of trust relationship circumstances this paper presents an alliance certification scheme based on the lattice combining dijkstra path search algorithm between the domainsTheoretical analysis shows that dual-traction certification mechanism greatly increases system security,also avoids the single point collapseAccording to calculating the path weight by dijkstra algorithm to find the shortest path in the weighted graph,the scheme can improve the certification efficiency
With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account t...
详细信息
With the development of the society and the changes of the traffic information on the urban road, Optimal path is no longer simply the shortest distance on the geographical location, but also taking into account the real-time traffic information. Meanwhile, with the development of the computer technology, communication technology and geographical information technology, intelligent navigation brings more benefits to people. It can save the travel time and reduce energy consumption. On the other hand, using intelligent navigation, people can avoid roadblock, traffic jams, traffic accidents etc. Intelligent navigation can provide a safer and more reassuring environment. Combining with the Internet of Things, this paper proposes an improved routing algorithm for dynamic traffic navigation based on the Internet of Things platform. GPS will download the realtime traffic information by accessing the built Internet of Things platform, calculate the optimal path precisely, and then provide real-time and more intelligent navigation service for people.
dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional dijkstra algorithm,on ...
详细信息
dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved dijkstra algorithm is *** apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.
暂无评论