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

A V2V2I routing algorithm for Internet of Vehicles based on adaptive variable beacon power

COMPUTING 2025年第4期107卷 1-27页

作者： Wu, Tao Ou, Yang Zhou, Qizhao Chen, Xi Chengdu Univ Informat Technol Sch Comp Sci Chengdu 610225 Peoples R China Southwest Minzu Univ Coll Comp Sci & Artificial Intelligence Chengdu 610041 Peoples R China

In traditional Vehicle-to-Vehicle-to-Infrastructure (V2V2I) routing algorithms, the beacon power of vehicles remains fixed, lacking adaptability to dynamic adjustments based on events or on-demand operational modes, leading to poor dynamic adaptability of vehicles and significant energy wastage. To enhance the flexibility of beacon power adjustment for vehicles in dynamic environments, while considering practical factors such as the signal coverage status, selfishness, and motion characteristics of routing vehicles, a self-adaptive V2V2I routing algorithm named Adaptive Beacon Power routing algorithm(ABPR) is proposed. In the algorithm, in order to enhance the stability of the vehicle's connection to RSU, vehicles first collect neighbor beacons and analyze the current signal coverage status of the vehicle. Subsequently, they adaptively adjust the beacon power of the vehicle, and then analyze available neighbor vehicle nodes through improved Q-learning, searching for the optimal neighbor node and selecting it as the next-hop route. Simulation experiments conducted on the Cologne dataset demonstrate that compared to RSAR and GPSR algorithms, the ABPR algorithm achieves an average improvement of 15% in residual energy consumption, 13.79% in selfish vehicle count, 38.58% in routing hop count, and 51.37% in routing link lifetime proportion under +/- 30% standard beacon power conditions. This algorithm enhances the flexibility of beacon power adjustment in VANET environments while optimizing the overall data offloading link quality.

关键词： VANET Mobile edge computing Variable beacon power routing algorithms Q-learning

来源：评论

学校读者我要写书评

暂无评论

Enhanced CH selection and energy efficient routing algorithm for WSN

引用

MICROSYSTEM TECHNOLOGIES-MICRO-AND NANOSYSTEMS-INFORMATION STORAGE AND PROCESSING SYSTEMS 2025年第3期31卷 735-747页

作者： Sharma, Aarti Kansal, Ankush TIET Patiala 147004 Punjab India

These days, Wireless Sensor Networks (WSNs) have been broadly utilized in numerous areas such as battlefield surveillance, industrial process control, pipeline monitoring, defence and military affairs, and so forth. Various energy efficient works are conducted without addressing the secured data transmission process. It is very challenging task to transfer data efficiently and securely to the desired location. Various researches has been done in this field but there are few limitations like malicious nodes are not considered and very complex systems are used for authentication like encryption and key management. In this paper a secure energy efficient algorithm using improved LEACH in optimization with Fire Fly algorithm (FFA) and Artificial neural network (ANN) to overcome all above said issues has been proposed. Cluster head selection is done using a new threshold value taking into account residual energy, average energy and covering distance of the nodes as compared to existing LEACH which uses only a probability based random number for CH selection. Due to the presence of malicious nodes in the route network performance degrades and data drop rate increases so there is need of energy efficient along with secure routing protocol. To fulfil this requirement firefly algorithm is used to get optimized node properties as output then this data is passed to ANN to provide communicating and non-communicating nodes as a result and attacker node in the existing route. Based on this differentiation of nodes an optimized route is developed from source to destination by eliminating the malicious nodes from the route. Simulation results demonstrate that there is an improvement in various Qos parameters of network as compared to existing approaches.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on routing Optimization Algorithm for Power OTN Based on DQN 24

Research on Routing Optimization Algorithm for Power OTN Bas...

引用

2nd International Conference on Advances in Artificial Intelligence and Applications, AAIA 2024

作者： Hu, Yang Yu, Yang Zhang, Qiang He, Yujun Information and Communication Company State Grid Jilin Electric Power Co. Ltd. Jilin Changchun China Department of Electronic and Communication Engineering North China Electric Power University Hebei Baoding China

ISBN: (纸本)9798400712883

routing optimization is key to improve the performance of power OTN. To solve the unequally distributed traffic load in power OTN, this paper put forward a power OTN routing optimization algorithm based on DQN. The power OTN was logically divided into states according to the technology characteristics of DQN, with corresponding actions, rewards and DQN agent designed for its operation. It generated optimized routing strategies that produce network routing optimization after several rounds of device-level iteration. The experimental method verified good convergence and effectiveness of the algorithm through simulation experiments on a 14 nodes NSFNet network. © 2024 Copyright held by the owner/author(s).

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Generalized Multi-Level Line routing for Packaging Design of an Urban Air Mobility Nacelle Using Dijkstra’s Algorithm and Signed Distances

Generalized Multi-Level Line Routing for Packaging Design of...

引用

AIAA Science and Technology Forum and Exposition, AIAA SciTech Forum 2025

作者： Tameer, Daniel Jalayer, Shayan Huh, Jaesung Jun, Sangkook Kim, Il Yong Department of Mechanical and Materials Engineering Queen’s University KingstonON Canada Korea Aerospace Research Institute Yuseong-Gu Daejeon 34133 Korea Republic of

ISBN: (数字)9781624107238

ISBN: (纸本)9781624107238

Urban air mobility vehicle nacelles contain mechanical and electrical components of varying sizes and geometries, where interactions between components via pipes, cables, and wire harnesses are essential to the fit, form, and function of the vehicle. There is a need for packaging design methods and tools to consider the design and modelling of system component interconnections to minimize production costs of these connections, including pipes, cables, and harnesses. A custom generalized line routing method was developed and applied to a nacelle system to minimize total length of pipes and cables. Utilizing Dijkstra’s algorithm to generate single line routes between two physical points, this method produced practical results for pipe and cable routes for multi-level branched routes. This method also leverages the mathematical signed distance function to generate a weighted graph for Dijkstra’s algorithm to prevent for geometric overlap between pipe and cable routes and system components. This paper outlines the methodology developed and final line routing results obtained for the nacelle case study. © 2025, American Institute of Aeronautics and Astronautics Inc, AIAA. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A reliable energy-efficient routing algorithm for WBAN using centrality measure

A reliable energy-efficient routing algorithm for WBAN using...

引用

International Conference on Innovation and Technological Advances for Sustainability, ITAS 2023

作者： Ameen, Shayan Ahmed, Ghufran Malik, Rauf Shams Siddiqui, Shahbaz Kariz Kamal, Muhammad Akhunzada, Adnan Karachi Pakistan College of Computing and Information Technology University of Doha for Science and Technology Doha Qatar

ISBN: (纸本)9781032803722

WBAN (Wireless body area networks) have enabled continuous real-time monitoring of health professionals and patients. For example, monitoring blood pressure and other biological indicators can help predict heart attacks. Real-time applications require constant communication between source and destination sensor nodes. Developing real-time applications while maintaining the energy of the critical sensor nodes is difficult due to the dynamic network architecture of WBAN. To improve the network lifetime, throughput in terms of energy-efficient routing protocol in WBAN will play a vital role with the help of identifying the critical nodes in WBAN. In this study, we proposed an energy-efficient SDWBAN (Software define-Wireless body area network) routing algorithm with the help of identifying the critical nodes and comparing them with the existing solutions. To determine the essential nodes of WBAN, we used the centrality measure. © 2025 The Author(s).

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

DTN routing Algorithm Based on Social Center and Classifier 20th

DTN Routing Algorithm Based on Social Center and Classifie...

引用

20th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2024

作者： Cui, Jianqun Gao, Mengnan Chang, Yanan Yan, Huiran Ma, Zhiyuan Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Central China Normal University Hubei Wuhan430079 China Department of Computer Science Central China Normal University Wuhan China

ISBN: (纸本)9789819628636

Opportunistic Mobile Social Networks (OMSNs) are intermittent complex networks consisting of mobile nodes equipped with communication devices, characterized by unstable connections, high node mobility, and limited resources. Existing OSMN routing algorithms, when selecting the next hop node, either focus on limited information within the network and employ simple fusion techniques or consider excessive redundant information in complex designs. To address these issues, this paper proposes an OSMN routing algorithm RFSC based on social centrality and classifier. The algorithm introduces a social circle partitioning algorithm and designs the routing algorithm SCRouter by considering the social attributes of nodes, node-specific situations, and message properties. Subsequently, the SCRouter algorithm is integrated with classifier to enhance the algorithm’s anti-interference capabilities and reduce the consideration of redundant metrics. Furthermore, the RFSC algorithm introduces an adaptive cache replica allocation strategy to improve data transmission efficiency. Experimental results demonstrate that compared to CARA, Prophet, SprayAndWait, CPN_ASW and INR_PRA algorithms, the RFSC enhances delivery rates by 139.6%, 16.6%, 39.5%, 12.0% and 12.7% respectively. It effectively reduces transmission delays and alleviates network congestion. © IFIP International Federation for Information Processing 2025.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A high-level simulator for Network-on-Chip

引用

INTEGRATED COMPUTER-AIDED ENGINEERING 2025年第1期32卷 55-71页

作者： Paris, Paulo Cesar Donizeti Pedrino, Emerson Carlos Univ Fed Sao Carlos Dept Comp Sci Rodovia Washington LuisKm 235 BR-13565905 Sao Carlos Brazil

This study presents a high-level simulator for Network-on-Chip (NoC), designed for many-core architectures, and integrated with the PlatEMO platform. The motivation for developing this tool arose from the need to evaluate the behavior of application mapping algorithms and the routing, both aspects are essential in the implementation and design of NoC architectures. This analysis underscored the importance of having effective NoC simulators as tools that allow for studying and comparing various network technologies while ensuring a controlled simulation environment. During this investigation and evaluation, some simulators, such as Noxim, NoCTweak, and NoCmap, among others, offered configurable parameters for application traffic, options to synthetically define topology and packet traffic patterns. Additionally, they include mapping options that optimize latency and energy consumption, routing algorithms, technological settings such as the CMOS process, and measurement options for evaluating performance metrics such as throughput and power usage. However, while these simulators meet detailed technical demands, they are mostly restricted to analyzing the low-level elements of the architecture, thus hindering quick and easy understanding for non-specialists. This insight underscored the challenge in developing a tool that balances detailed analysis with a comprehensive learning perspective, considering the specific restrictions of each simulator analyzed. Experiments demonstrated the proposed simulator efficacy in handling algorithms like GA, PSO, and SA variant, and, surprisingly, revealed limitations of the XY algorithm in Mesh topologies, indicating the need for further investigation to confirm these findings. Future work will expand the simulator functionalities, incorporating a broader range of algorithms and performance metrics, to establish it as an indispensable tool for research and development in NoCs.

关键词： Many-core network-on-chip simulators application mapping routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A schedulability-aware routing algorithm for time sensitive network based on improved ant colony algorithm

引用

AD HOC NETWORKS 2025年 169卷

作者： Guo, Yi Luo, Feng Wang, Zitong Tong, Yingpeng Ren, Yi Tongji Univ Sch Vehicle Engn Shanghai 200092 Peoples R China

With the rapid development of industrial automation, there are higher requirements for reliable and deterministic communication in industrial networks, including in-vehicle networks, avionics and intelligent transport. Time Sensitive Network offers bounded, low-latency transmission assurance for crucial traffic via the Time Aware Shaper described in the IEEE 802.1Qbv. This standard ensures low jitter and deterministic delay for timesensitive traffic by employing a pre-calculated circular transmission schedule. Current scheduling algorithms typically use the shortest path algorithm to determine paths for time-triggered flows. However, this approach can lead to an excessive concentration of time-triggered flows traversing the same link, thereby impacting the scheduling feasibility of such flows. In this paper, first, the time-sensitive network topology and time-triggered flows are modeled and the SMT-based no-wait scheduling constraints are proposed. Then, a schedulability-aware routing (SAR) algorithm based on the improved ant colony algorithm is designed to enhance the schedulability of time-triggered flows under the no-wait scheduling problem, thereby improving the ability of the time-sensitive network to accommodate time-triggered flows. Finally, SAR is compared with four routing algorithms including the shortest path routing algorithm (Dijkstra) to evaluate its performance under different network loads. The results show a significant improvement in the scheduling success rate of SAR compared to other routing algorithms. In the original network topology, when the link communication rate is 1000 Mbit/s, SAR achieves scheduling success rates that are 44 %, 62 %, and 56 % higher than Dijkstra for 80, 85, and 90 time-triggered flows, respectively, and 18 %, 8 %, and 10 % higher than LBR.

关键词： Time sensitive network routing algorithms No-wait scheduling Time aware shaper

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms for the constrained routing problem in computer networks

引用

COMPUTER COMMUNICATIONS 1998年第16期21卷 1476-1485页

作者： Hung, YC Soochow Univ Dept Comp & Informat Sci Taipei Taiwan

The quickest path problem is possibly the most important problem for data routing in computer networks. The quickest path problem is to find quickest paths in a computer network to transmit a given amount of data with minimal transmission time. The selection of quickest paths depends on both the characteristics of the computer network and the amount of data to be transmitted. In addition, if the quickest paths are required to go through a specified path, then the restricted problem is called the constrained quickest path problem. In this study, some new distributed routing algorithms are developed for multimedia data transfer in an asynchronous computer network. For all pairs of nodes in a network, an O(mn) messages and O(m) time distributed algorithm is first presented to find constrained quickest paths, and then an O(mn) messages and O(m) time distributed algorithm is present to enumerate the first k quickest paths. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： computer networks routing algorithms distributed algorithms quickest path problem

来源：评论

学校读者我要写书评

暂无评论

Advanced Chiplet Placement and routing Optimization considering Signal Integrity

引用

IEEE Transactions on Components, Packaging and Manufacturing Technology 2025年

作者： Kim, Haeyeon Lee, Junghyun Choi, Seonguk Berto, Federico Shin, Taein Park, Joonsang Kim, Jihun Yoon, Jiwon Kim, Byeongmok Kim, Youngwoo Kim, Joungho Daejeon Korea Republic of Hanyang University Seoul Korea Republic of Gwangju Korea Republic of Hongik University Seoul Korea Republic of Sejong University Seoul Korea Republic of Korea University Seoul Korea Republic of Seoul National University Seoul Korea Republic of

This article addresses the critical challenges of chiplet placement and routing optimization in the era of advanced packaging and heterogeneous integration. We present a novel approach that formulates the problem as a signal integrity-aware hierarchical Markov decision process (MDP), leveraging the place-to-route (P2R) algorithm. Our method uniquely incorporates the universal chiplet interconnect express (UCIe) eye mask specifications to ensure compliance with datarate-dependent signal integrity requirements. Tested on 10 benchmark problems, P2R achieved superior results with an average eye-diagram aperture of 0.869 unit interval (UI) in a single iteration, outperforming random search and deep reinforcement learning by 44.8%. By addressing the combinatorial complexity and hard constraints inherent in chiplet-based designs, this approach enables optimization while ensuring compliance with industry standards. Our work represents a significant advancement in optimizing heterogeneous integrated systems, addressing challenges that conventional placement and routing methods cannot adequately solve. © 2025 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：