检索结果-内蒙古大学图书馆

1st International Conference on Intelligent Green Building and Smart Grid (IGBSG)

作者： Rosyidi, Lukman Pradityo, Hening Pram Gunawan, Dedi Sari, Riri Fitri Univ Indonesia Dept Elect Engn Depok Indonesia

ISBN: (纸本)9781467361217

This paper reviews dijkstra algorithm implementation in finding the shortest path for route planning. The regular shortest path algorithms do not consider the timebase dynamic traffic condition of road network, i.e the hourly changing of traffic density. Timebase dynamic weight for dijkstra algorithm compute the most efficient time and minimum fuel consumption based on the real condition of the traffic profiles of the road network. The traffic profiles describe the time needed to pass the road based on time which also differs for workdays and weekend. Simulation shows the implementation of Timebase Dynamic Weight for dijkstra algorithm can give better cost efficiency compared with the common Shortest Distance calculation and Traffic Avoidance calculation.

关键词： route planning shortest path timebase base dynamic traffic dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Path Optimization Study for Vehicles Evacuation Based on dijkstra algorithm

Path Optimization Study for Vehicles Evacuation Based on Dij...

引用

International Conference on Performance-Based Fire and Fire Protection Engineering (ICPFFPE)

作者： Chen, Yi-zhou Shen, Shi-fei Chen, Tao Yang, Rui Tsinghua Univ Dept Engn Phys Beijing 100084 Peoples R China

Emergency events, such as earthquakes, hurricanes, fires, chemical accidents, nuclear accidents, terror attacks and other events may led to injured or endanger the life and the health of human beings, and the large scale crowds have to evacuate from a danger area to a safe area by vehicles. In this paper, through observing real-time road network and analyzing three different emergency evacuation cases and the nodes, intersections delay and velocity of vehicles evacuation in the morning peak, common and evening peak. A dynamic road network model is built for vehicles evacuation based on dijkstra algorithm. The optimal evacuation path is proposed in three different cases. The obtained outcomes provide well predictive method and theoretical basis for optimal emergency evacuation path selection and emergency rescue decision in public places, especially for those with high population density. So it seems very meaningful for us to cope with emergency situation or to prevent and mitigate disasters from the crisis events. (C) 2014 Published by Elsevier Ltd.

关键词： dijkstra algorithm emergency event evacuation path optimization

来源：评论

学校读者我要写书评

暂无评论

A dijkstra algorithm Based Multi-layer Satellite Network Routing Mechanism 11th

A Dijkstra Algorithm Based Multi-layer Satellite Network Rou...

引用

11th International Conference on Intelligent Computing (ICIC)

作者： Sun, Yinchu Wang, Xingwei Li, Fuliang Huang, Min Northeastern Univ Coll Informat Sci & Engn Shenyang Peoples R China

ISBN: (纸本)9783319220536;9783319220529

As the basis of satellite communication network, routing mechanism is a hot topic in satellite network. However, due to the dynamic network topology, high propagation delay and limited resource of satellite network, many great challenges have emerged in designing routing mechanism for it. In this paper, we propose a satellite network routing mechanism based on dijkstra algorithm for multi-layer satellite network. By considering QoS requirements, service pricing, life cycle and load balance together, we first design an evaluation index, which is used to evaluate the effectiveness of the alternative route. Then we utilize the dijkstra algorithm to select the best path for satellite network. Finally, we evaluate the proposed mechanism on the model of multi-layer satellite network and verify it from many aspects. Evaluation results show that our routing mechanism is feasible and effective.

关键词： Multi-layer satellite network dijkstra algorithm Routing mechanism

来源：评论

学校读者我要写书评

暂无评论

Multihop Transmission Strategy Using dijkstra algorithm to Improve Energy Efficiency in WSNs 4th

Multihop Transmission Strategy Using Dijkstra Algorithm to I...

引用

4th International Symposium on Ubiquitous Networking (UNet)

作者： Abderrahim, Maha Hakim, Hela Boujemaa, Hatem Touati, Farid Carthage Univ COSIM LAB SUPCOM Tunis Tunisia Univ Sfax Digital Res Ctr Sfax Tunisia Qatar Univ Dept Elect Engn Doha Qatar

ISBN: (纸本)9783030028497;9783030028480

Thanks to the development in the wireless communication technologies and the microelectronics domain, Wireless Sensor Networks (WSNs) are more and more omnipresent. The most important challenge of WSN is how to extend its lifetime. For long distance communication, using one hop transmission causes the dissipation of a lot of energy. To avoid this dissipation, an energy-efficient multihop transmission strategy based on dijkstra algorithm is proposed in this paper. We consider a WSN organized into clusters, each cluster is composed of N sensor nodes classified as follows: source node, cluster head (CH) node as the destination, group of active nodes and group of sleeping nodes. The selection of CH node is based on the position of nodes within the cluster and their residual energy. Then, the CH groups the remaining nodes into active or sleeping nodes according to a reference distance. We suppose that the transmitting symbol is correctly received only if the Signal-to-Noise Ratio (SNR) at the receiver is above a threshold gamma(th). Our main objective is to define a new transmission technique minimizing the power consumption using multihop communication. The selected relays which cooperate to aid the source-destination communication are those offering the least transmit power while maintaining SNR equal to the threshold gamma(th). We use dijkstra algorithm to select the reliable relays. Simulations results demonstrate that the proposed transmission technique can reduce enormously the power consumption.

关键词： Wireless Sensor Network Multihop transmission dijkstra algorithm Energy saving

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization of Distribution Network Power Supply Capacity Based on Improved dijkstra algorithm 24

Research on Optimization of Distribution Network Power Suppl...

引用

International Conference on Power Electronics and Artificial Intelligence (PEAI)

作者： Cai, Ruojun Yang, Jiachen Chen, Ying Li, Tianci Xie, Demin Hainan Power Grid Ltd Liabil Co Haikou Power Supply Bur Haikou 570102 Hainan Peoples R China

ISBN: (纸本)9798400716638

The distribution network is an important component of the power system, and its power supply capacity directly affects the stability and reliability of the entire power system. This article aims to improve the power supply capacity and proposes a dijkstra algorithm with improved weight design based on several typical measures to improve the power supply capacity of distribution networks, in order to find an economic solution for optimizing the load rate of distribution networks. This algorithm comprehensively considers the effect of reducing load rate and construction cost, which helps to find the most economical solution to improve power supply capacity in line with the actual situation, and has a strong reference effect on improving the power supply capacity of urban distribution networks.

关键词： Power supply capacity Distribution network dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improvement of the Shortest Path algorithm Based on dijkstra algorithm

An Improvement of the Shortest Path Algorithm Based on Dijks...

引用

2nd International Conference on Computer and Automation Engineering (ICCAE)

作者： Xiao, Ji-Xian Lu, Fang-Ling Hebei Polytech Univ Coll Sci Tangshan Peoples R China

ISBN: (纸本)9781424455690

In this paper, based on the dijkstra algorithm and its past improvements, a new improvement is proposed by considering the case of the nodes, reforming the feature matrix of precursor node, and adding a shortest path tree. The algorithm has its adantages on both reducing the number of repeated operations and reading the shortest path and the path length from the startpoint to all the other nodes by the shortest path tree or by the feature matrix.

关键词： shortest path dijkstra algorithm feature matrix shortest path tree

来源：评论

学校读者我要写书评

暂无评论

Research and Design of a SpaceWire Network Dynamic Reconfiguration Method Based on dijkstra algorithm 9

Research and Design of a SpaceWire Network Dynamic Reconfigu...

引用

9th International Symposium on Computational Intelligence and Design (ISCID)

作者： Du, Rui Fei, Haidong Zhang, Weigong Wang, Xingyou Beijing Microelect Technol Inst SOC Dept Beijing Peoples R China Capital Normal Univ Beijing Engn Res Ctr High Reliable Embedded Syst Beijing Peoples R China

ISBN: (纸本)9781509035588

SpaceWire is a full-duplex, point-to-point, high-speed serial data transfer standard which is intended for use in further on-board spacecraft, space missions and applications. However, space environment is harsh and complex which requires a communication network with high reliability. It is inevitable that SpaceWire network link fault or SpaceWire equipment damage is able to change the SpaceWire network status. Therefore, traditional static routing configuration cannot efficiently solve the network fault recovery problem. In this paper, our research is divided into three parts. First of all, we design a simulation and test platform for SpaceWire network by using 7 SpaceWire communication nodes and 3 SpaceWire routers. This SpaceWire network platform is the foundation for the next work. Secondly, we introduce the SpaceWire routing protocol and dijkstra algorithm principle. Thirdly, in order to improve the reliability of SpaceWire network and restore communication fault, we propose a SpaceWire network dynamic reconfiguration method based on dijkstra algorithm. By analyzing the check information from SpaceWire router ports and communication nodes, it dynamically calculates optimal routing paths and reconfigures the SpaceWire network routers when there is a fault on SpaceWire network. Based on the simulation and test platform for SpaceWire network, we complete the software design and implementation of this method. Verification result demonstrates that the method can perform real-time network reconfiguration and path optimization when a SpaceWire network fault occurs, improve the ability of self-adaptive of SpaceWire network and enhance the reliability and transmit efficiency as well.

关键词： SpaceWire network reconfiguration dijkstra algorithm network fault path optimization

来源：评论

学校读者我要写书评

暂无评论

Optical Ray Tracing Based on dijkstra algorithm in Inhomogeneous Medium 9

Optical Ray Tracing Based on Dijkstra Algorithm in Inhomogen...

引用

International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)

作者： Uchida, Kazunori Fukuoka Inst Technol Dept Commun & Informat Engn Fukuoka 8110295 Japan

ISBN: (纸本)9781479978731

This paper is concerned with proposing a numerical method to predict the wavefront movement of optical rays based on the dijkstra algorithm. Data for refractive index of the medium through which optical rays propagate are assigned to all nodes of rectangular meshes and its values apart from the mesh nodes can be approximated in terms of linear interpolation. The velocity of the wavefront of an optical ray can be calculated by the refractive index assigned to each node and it varies from one node to another due to the medium inhomogeneity. Since the wavefront movement of any waves is governed by the Fermat principle, it can be easily estimated based on the dijkstra algorithm. In this paper we discuss the dijkstra algorithm relevant to optical rays propagating through the inhomogeneous media such as Luneburg lens and Maxwell's fish-eye lens. We also show some numerical examples to demonstrate the effectiveness of the proposed method for analyzing ray front movement and ray tracing.

关键词： dijkstra algorithm Fermat Principle Optical Ray Luneburg Lens Maxwell's Fish-Eye Lens

来源：评论

学校读者我要写书评

暂无评论

An Improved dijkstra algorithm Based on Pairing Heap

An Improved Dijkstra Algorithm Based on Pairing Heap

引用

5th International Symposium on Computational Intelligence and Design (ISCID)

作者： Zhang, Wei Jiang, Chong Ma, Yunxiang Beijing Inst Petrochem Technol Coll Informat Engn Beijing 102617 Peoples R China

In this paper, we presented a method for shortest path computation process using dijkstra algorithm based on Pairing heap. We compared the methods by the Pairing heap method and Fibonacci heap method. With experiment,... 详细信息

ISBN: (纸本)9780769548111

关键词： shortest path algorithm dijkstra algorithm GIS Network Analysis

来源：评论

学校读者我要写书评

暂无评论

dijkstra algorithm interactive training software development for network analysis applications in GIS

引用

ENERGY EDUCATION SCIENCE AND TECHNOLOGY PART A-ENERGY SCIENCE AND RESEARCH 2011年第1期28卷 445-452页

作者： Karas, Ismail Rakip Demir, Sait Karabuk Univ Fac Engn Dept Comp Engn Karabuk Turkey Sirnak Univ Fac Engn Dept Comp Engn Sirnak Turkey

Process of route optimization is one of the basic applications of Network Analyses in Geographic Information Systems. In mathematical background of network analysis applications are graph theory and graph algorithms. Primary graph algorithm employed in process of route optimization is dijkstra's algorithm. dijkstra's algorithm is placed on the top of linear methods which yield exact solutions. Geographic Information Systems analyses such as the shortest route, the shortest duration and route with the least traffic are solved through dijkstra's algorithm. In this study, an interactive training software program, developed for educational use in Geographic Information Systems and Graph Theory classes at postgraduate degree, is introduced. This software provides students with the opportunity to use dijkstra's algorithm on graphs which they have designed by themselves and teaches details of algorithm, its working principles and structure of data to them, step by step, through interactive messages and graphics.

关键词： Geographic information systems Graph theory Interactive learning Network analysis Route optimization dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：