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

3D path planning, routing algorithms and routing protocols for unmanned air vehicles: a review

AIRCRAFT ENGINEERING AND AEROSPACE TECHNOLOGY 2019年第9期91卷 1245-1255页

作者： Ben Amarat, Samia Zong, Peng Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing Jiangsu Peoples R China Nanjing Univ Aeronaut & Astronaut Aeronaut Coll Nanjing Jiangsu Peoples R China

Purpose This paper aims to present a comprehensive review in major research areas of unmanned air vehicles (UAVs) navigation, i.e. three degree-of-freedom (3D) path planning, routing algorithm and routing protocols. The paper is further aimed to provide a meaningful comparison among these algorithms and methods and also intend to find the best ones for a particular application. Design/methodology/approach The major UAV navigation research areas are further classified into different categories based on methods and models. Each category is discussed in detail with updated research work done in that very domain. Performance evaluation criteria are defined separately for each category. Based on these criteria and research challenges, research questions are also proposed in this work and answered in discussion according to the presented literature review. Findings The research has found that conventional and node-based algorithms are a popular choice for path planning. Similarly, the graph-based methods are preferred for route planning and hybrid routing protocols are proved better in providing performance. The research has also found promising areas for future research directions, i.e. critical link method for UAV path planning and queuing theory as a routing algorithm for large UAV networks. Originality/value The proposed work is a first attempt to provide a comprehensive study on all research aspects of UAV navigation. In addition, a comparison of these methods, algorithms and techniques based on standard performance criteria is also presented the very first time.

关键词： UAVs routing algorithm 3D path planning algorithm routing protocol

来源：评论

学校读者我要写书评

暂无评论

Multi-objective routing algorithms for low-earth orbit satellite network

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING 2023年第5期41卷 427-440页

作者： Xie, Xuan Huang, Linyu Tang, Chengwen Ning, Qian Sichuan Univ Coll Elect & Informat Engn Chengdu 610065 Peoples R China Sichuan Univ Coll Elect & Informat Engn Chengdu 610065 Peoples R China

The low-earth orbit (LEO) satellite network, composed of a large number of satellite nodes, is a hot research topic at present. Due to the characteristics of the large-scale LEO satellite network, such as many satellite nodes, short orbit period, large dynamic change of topology, and unstable link-state, its communication quality of service (QoS) requirements are difficult to meet. Aiming at this problem, various factors that may affect data transmission are first analyzed. The network link selection problem is modeled as a multi-constraint optimization decision problem, a routing mathematical model based on linear programming (LP) is designed, and its solution is solved. Aiming at the problem of limited onboard computing resources, a multi-object optimization Dijkstra algorithm (MOODA) is designed. The MOODA finds the optimal path according to the comprehensive performance of the link. It solves the problems of poor comprehensive QoS performance and the low degree of load balancing of the paths found by the Dijkstra algorithm. The simulation results show that the paths found by the two algorithms have good QoS, robustness, and load balancing performance.

关键词： LEO satellite network multi-objective decision-making quality of service routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A general methodology for direction-based irregular routing algorithms (vol 70, pg 363, 2010)

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2010年第5期70卷 623-623页

作者： Moraveji, R. Sarbazi-Azad, H. Zomaya, A. Y. Univ Sydney Sch Informat Technol Ctr Distributed & High Performance Comp Sydney NSW 2006 Australia Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran Sharif Univ Technol Dept Comp Engn Tehran Iran

This paper presents a general methodology for generating deadlock-free routing algorithms for irregular networks. Constructing a spanning tree on the given network, assigning directions to the network channels, creating deadlock-free zones, and specifying a logical sequence of the produced deadlock-free zones are the four fundamental steps that the proposed methodology takes to generate deadlock-free and connected routing algorithms. By applying the proposed methodology with two known labeling methods we have generated six irregular routing algorithms: three of them are novel routing algorithms and three of them (the Up/Down, Left/Right, and L-turn routing algorithms) have already been proposed in the literature. Extensive simulation experiments have been performed considering various network topologies, different network sizes (considering different network nodes and network channels), various message lengths, a variety of spanning tree roots, and a wide range of message (traffic) generation rates. Simulation results show that the six routing algorithms can be divided into three pairs. routing members of each pair show similar behavior in terms of message latencies and saturation generation rates. However, it is worth noting that for a given topology the performance of the six routing algorithms may be totally different and it mainly depends on the network topology.

关键词： Interconnection networks Irregular network General methodology routing algorithm Zone-based routing Performance evaluation Simulation

来源：评论

学校读者我要写书评

暂无评论

A New routing Protocol for Energy Optimization in Mobile Ad Hoc Networks Using the Cuckoo Optimization and the TOPSIS Multi-Criteria algorithm

引用

CYBERNETICS AND SYSTEMS 2021年第6期52卷 477-497页

作者： Tabatabaei, Shayesteh Higher Educ Complex Saravan Dept Comp Engn Saravan Iran

The Mobile Ad Hoc Network (MANET) is a set of ad hoc nodes without any infrastructure that form a temporary network without the presence of central control. Nodes present in such networks are usually in movement and result in frequent topological changes. The design of proper routing protocols to control dynamic topological changes in an ad hoc network can enhance the performance of a network. In this regard, the current study attempts to present a new routing protocol to improve energy consumption using the Cuckoo Optimization algorithm and the TOPSIS multi-criteria algorithm. The proposed approach can be applied in dynamic environments, and four important variables including the accessible bandwidth, the remaining energy, the speed of movement, and the number of steps necessary for routing have been considered for it. To select proper groups for the purpose of relaying data packages, the TOPSIS multi-criteria algorithm was applied. In addition, the Cuckoo Optimization algorithm was used to select the shortest route between the relay groups. The simulation results showed that the process of selecting a stable route using the Cuckoo Optimization algorithm and the TOPSIS algorithm has a significant impact on the performance of networks, and the proposed algorithm shows better performance compared to the methods introduced in Tabatabaei and Behravesh with regard to the throughput and the end-to-end delay.

关键词： Cuckoo Optimization algorithm energy consumption mobile ad hoc network routing algorithm TOPSIS multi-criteria algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive routing algorithms for Lifetime Reliability Optimization in Network-on-Chip

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第9期65卷 2896-2902页

作者： Wang, Liang Wang, Xiaohang Mak, Terrence Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China South China Univ Technol Sch Software Engn Guangzhou Guangdong Peoples R China Guangzhou Inst Adv Technol Guangzhou Guangdong Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England Shenzhen Inst Adv Technol Shenzhen Peoples R China

Technology scaling leads to the reliability issue as a primary concern in Network-on-Chip (NoC) design. We observe that due to routing algorithm some routers age much faster than others which becomes a bottleneck for NoC lifetime. In this paper, lifetime is modeled as a resource consumed over time. A metric lifetime budget is associated with each router, indicating the maximum allowed workload for current period. Since the heterogeneity in router lifetime reliability has strong correlation with the routing algorithm, we define a problem to optimize the lifetime by routing packets along the path with maximum lifetime budgets. The problem is then extended for both performance and lifetime reliability optimization. The lifetime is optimized in long-term time scale while performance is optimized in short-term time scale. Two dynamic programming-based adaptive routing algorithms (lifetime aware routing and multi-objective routing) are proposed to solve the problems. In the experiments, the lifetime aware routing and multi-objective routing algorithms are evaluated with synthetic traffic and real benchmarks respectively. The experimental results show that the lifetime aware routing has around 20, 45 and 55 percent minimal lifetime improvement than XY routing, NoP routing and Oddeven routing, respectively. In addition, the multi-objective adaptive routing algorithm can effectively improve both performance and lifetime.

关键词： routing algorithm network-on-chip lifetime reliability dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Fault-aware and Reconfigurable routing algorithms for Networks-on-Chip

引用

IETE JOURNAL OF RESEARCH 2011年第3期57卷 215-223页

作者： Valinataj, Mojtaba Mohammadi, Siamak Safari, Saeed Univ Tehran Sch Elect & Comp Engn Tehran 14395515 Iran

Currently, the manufacturing process of complex systems such as network-based Systems-on-Chip incurs a considerable amount of failures. This paper presents a class of very low cost routing algorithms to increase the yield and to tolerate permanent faulty links in Networks-on-Chip. These new algorithms are fault tolerant through dynamic reconfiguration when the regular topology is altered by faulty links. Also, the proposed algorithms are the reconfigurable extensions of deterministic routing algorithms and their deadlock freeness is obtained by prohibiting a few turns. To demonstrate the effectiveness of the proposed routing algorithms, the performance, power consumption, and area overheads are evaluated through appropriate simulations and syntheses. The experimental results show that considerable reliability and yield improvements are obtained with only a few percent power and area overheads.

关键词： Fault tolerance Network-on-chip Reconfiguration Reliability routing algorithm Yield

来源：评论

学校读者我要写书评

暂无评论

COMPARISON OF routing algorithmS FOR STORAGE AND RETRIEVAL MECHANISM IN CYLINDRICAL AS/RS

引用

TRANSPORT 2016年第1期31卷 11-21页

作者： Janilionis, Vytautas V. Bazaras, Zilvinas Janilionis, Vytautas [a] Dept of Transport Engineering Kaunas University of Technology Kaunas Lithuania[b] Dept of Applied Mathematics Kaunas University of Technology Lithuania

The objective of this research is to propose new routing algorithms for the Storage and Retrieval Mechanism (SRM) in the Cylindrical Automated Storage and Retrieval System (C-AS/RS) and contribute to the system conceptualization by investigating the maximum achievable retrieval request rates for different routing algorithms and system parameters. For this purpose, flexible and detailed simulation model was developed and investigated for 2 SRM types, 3 routing algorithms and a feasible set of system movement and load transfer time parameters. Based on the simulation output, the regression models for different SRM types and routing algorithms were developed for predicting the maximum retrieval request rate. The differences of the average maximum retrieval request rate were evaluated for various system configurations and routing algorithms. The alternative to optimal routing algorithm was proposed, reducing the system performance only by 1.4?÷?2.4% on average, but requiring significantly less calculations when planning the SRM tour. In addition, the system analysis indicated that SRM vertical velocity and load transfer time have the highest impact on the system performance and for different SRM types the average maximum retrieval request rates differ by 22.2?÷?31.8%.

关键词： cylindrical automated storage and retrieval system routing algorithm branch and bound algorithm automated warehouse simulation regression analysis

来源：评论

学校读者我要写书评

暂无评论

A FAST PARALLEL algorithm FOR routing IN PERMUTATION NETWORKS

引用

IEEE TRANSACTIONS ON COMPUTERS 1981年第2期30卷 93-100页

作者： LEV, GF PIPPENGER, N VALIANT, LG IBM CORP RES LABSAN JOSECA 95193

An algorithm is given for routing in permutation networks-that is, for computing the switch settings that implement a given permutation. The algorithm takes serial time O(n(log N)2) (for one processor with random access to a memory of O(n) words) or parallel time O((log n)3) (for n synchronous processors with conflict-free random access to a common memory of O(n) words). These time bounds may be reduced by a further logarithmic factor when all of the switch sizes are integral powers of two.

关键词： Complexity interconnection networks parallel processing permutation networks randomization routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A multi-criteria decision based on adaptive routing algorithms with discrete operators for on-chip networks

引用

JOURNAL OF SUPERCOMPUTING 2022年第8期78卷 10906-10929页

作者： Mahjoub, Alireza Vardi, Fatemeh Rad, Roya Islamic Azad Univ Dept Comp & Informat Technol Parand Branch Tehran Iran

The network-on-chip is a subsystem based on simplified public data network communication protocols for routing using routers. Providing an efficient solution is not a trivial issue due to communication problems caused by network element failure on the chip. The purpose is to maintain the performance of the router in the presence of failure. Therefore, in this paper, by combining path length and an adaptive congestion-aware approach using multi-criteria decision-making technique, a reliable method is introduced that, in case of failure, replaces a reliable path with similar quality of service features. The throughput increase is confirmed in the simulation results of the proposed solution, up to 54.05% and 8.05% with a two-criteria and a single-criteria router, respectively. The hardware overhead of the algorithm is relatively low cost, which maintains scalability for implementation in large network-on-chips.

关键词： Network on chip routing algorithm Fault tolerance Adaptive approach Reliability

来源：评论

学校读者我要写书评

暂无评论

Memory-Occupied routing algorithms for Quantum Relay Networks

引用

Computers, Materials & Continua 2023年第6期75卷 5929-5946页

作者： Jiangyuan Yao Kaiwen Zou Zheng Jiang Shuhua Weng Deshun Li Yahui Li Xingcan Cao School of Computer Science and Technology Hainan UniversityHaikou570228China School of Cyberspace Security Hainan UniversityHaikou570228China School of Software Beijing Jiaotong UniversityBeijing10004China The Faculty of Art University of British ColumbiaVancouverV5K1K5Canada

Quantum transmission experiments have shown that the success-ful transmission rate of entangled quanta in optical fibers decreases *** current quantum networks deploy quantum relays to establish long-distance connections,the increase in transmission distance and entanglement switching costs still need to be considered when selecting the next ***,most of the existing quantum network models prefer to consider the parameters of the physical layer,which ignore the influence factors of the network *** this paper,we propose a meshy quantum network model based on quantum teleportation,which considers both net-work layer and physical layer *** proposed model can reflect the realistic transmission characteristics and morphological characteristics of the quantum relay ***,we study the network throughput of different routing algorithms with the same given parameters when multiple source-destination pairs are interconnected *** solve the chal-lenges of routing competition caused by the simultaneous transmission,we present greedy memory-occupied algorithm Q-GMOA and random memory-occupied algorithm *** proposed meshy quantum network model and the memory-occupied routing algorithms can improve the utilization rate of resources and the transmission performance of the quantum *** the evaluation results indicate that the proposed methods embrace a higher transmission rate than the previous methods with repeater occupation.

关键词： Quantum relay network routing algorithm quantum memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：