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

A deep reinforcement learning-based intelligent QoS optimization algorithm for efficient routing in vehicular networks

引用

ALEXANDRIA ENGINEERING JOURNAL 2024年 107卷 317-331页

作者： Ye, Shitong Xu, Lijuan Xu, Zhiming Wang, Feng Guangzhou Huashang Coll Dept Data Sci Guangzhou 511300 Peoples R China Guangzhou Xinhua Univ Dongguan 523133 Peoples R China

With the rapid development of Telematics, Vehicle Self-Organizing Networks (VANETs) play an increasingly critical role in Intelligent Transportation Systems (ITS). Especially in the environment without roadside assistance units (RSUs), how to effectively manage inter-vehicle communication and improve the stability and communication efficiency of the network has become a hot topic of current research. In this paper, a Deep Reinforcement Learning-based Intelligent QoS-optimized efficient routing algorithm for vehicular networks (DRLIQ) is proposed for VANETs with/without RSU environments, and routing methods are proposed respectively. Among them, in RSU-free environment, the DRLIQ algorithm utilizes the powerful processing capability of deep reinforcement learning to intelligently select the optimal data transmission path by dynamically learning and adapting to the changes in the vehicular network, thus effectively reducing communication interruptions and delays, and improving the accuracy of data transmission. The performance of the DRLIQ algorithm under different vehicle densities is evaluated in simulation experiments and compared with current popular algorithms. The experimental results show that the DRLIQ algorithm outperforms the comparison algorithms in reducing the number of communication interruptions, BER and network delay, especially in vehicle-dense environments. In addition, the DRLIQ algorithm shows higher adaptability and stability in coping with network topology changes and vehicle dynamics.

关键词： Vehicular self-organizing networks Deep reinforcement learning RSU-free environment Intelligent QoS optimization 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

来源：评论

学校读者我要写书评

暂无评论

A Whale Swarm-Based Energy Efficient routing Algorithm for Wireless Sensor Networks

引用

IEEE SENSORS JOURNAL 2024年第12期24卷 19964-19981页

作者： Zeng, Bing Deng, Jiewen Dong, Yan Yang, Xuebing Huang, Lingxiang Xiao, Zhao Huazhong Univ Sci & Technol Sch Mech Sci & Engn State Key Lab Digital Mfg Equipment & Technol Wuhan Hubei Peoples R China Wind Power Co Ltd Harbin Elec Corp State Key Lab Offshore Wind Power Equipment & Eff Xiangtan 411102 Hunan Peoples R China Hunan Univ Sci & Technol Sch Mech Engn Xiangtan 411201 Hunan Peoples R China Huazhong Univ Sci & Technol Sch Elect Informat & Commun Wuhan 430074 Hubei Peoples R China

Developing energy-efficient routing algorithms is key to reducing energy consumption of wireless sensor networks (WSNs), and the WSNs energy-efficient routing is a combinatorial optimization problem. Many researchers try to optimize it with metaheuristics. However, most metaheuristics are inappropriate in designing routing algorithms for WSNs due to the individual coding and iteration rule for WSNs routing problem. To solve these problems, this article proposes a whale swarm algorithm with iterative counter-based routing (WSA-ICR) algorithm based on the WSA-IC algorithm. The WSA-ICR algorithm considers the energy consumption of each node and path length in the balanced network and designs a new energy efficiency objective function. Then, the WSA algorithm is improved from five aspects: individual coding, individual initialization, distance calculation between two individuals, individual movement rules, and local search. The WSA-ICR algorithm is compared with several energy efficiency optimization routing algorithms. The simulation results show that the WSA-ICR algorithm has excellent performance in balancing the energy consumption of the whole network, prolonging the network life cycle and convergence speed.

关键词： Wireless sensor networks routing Energy efficiency Metaheuristics Sensors routing protocols Quality of service Better and nearest energy-efficient metaheuristics routing algorithms whale swarm algorithm (WSA) wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Mobile Wireless Sensor Networks routing Protocol Using Adaptive Boosting With Sensitivity Analysis

引用

IEEE ACCESS 2024年 12卷 146494-146512页

作者： Boikanyo, Kegomoditswe Zungeru, Adamu Murtala Yahya, Abid Lebekwe, Caspar K. Botswana Int Univ Sci & Technol Dept Elect & Commun Syst Engn Palapye Botswana

Mobile Wireless Sensor Networks (MWSNs) are employed in diverse applications, including remote patient monitoring systems (RPMS). In RPMS, biomedical sensors collect physiological data from patients outside clinical settings, and the data is transmitted wirelessly to healthcare providers for informed decisions. However, most routing algorithms focus on optimizing routing in static RPMS, neglecting mobile RPMS. This paper introduces an approach to improving the efficiency of MWSN algorithms, with a focus on the Termite Hill routing Algorithm (THA) applied in RPMS. The investigation employs methods of sensitivity analysis to reveal how crucial parameters, such as the quantity of nodes, speed of nodes, and distribution of nodes affect the behavior and throughput of the algorithm. The paper introduces a novel methodology, Enhanced Regression-based Gradient Boosting (ERGB), which optimizes the algorithm's parameters and enhances performance. ERGB is a unique combination of regression-based adaptive gradient boosting with sensitivity analysis and a robust machine-learning algorithm. It identifies and ranks the most critical factors that affect throughput in the constantly changing network environment of mobile RPMS. The study found that the network topology size and the source node speed are the most critical parameters impacting the algorithm, piquing the audience's interest in this innovative approach. The study compared the optimized THA with default parameters and two other algorithms (AODV and Bee Sensor) used with optimized parameters. The results demonstrate significant improvements in throughput, reaching a maximum of about 2.6 Kb/s compared to 0.3 Kb/s with default parameters.

关键词： Heuristic algorithms Wireless sensor networks Sensitivity analysis routing Optimization Boosting Machine learning algorithms Analytical models Tuning Throughput Remote monitoring Patient monitoring Gradient methods Mobile wireless sensor networks (MWSN) remote patient monitoring system (RPMS) sensitivity analysis gradient boosting routing algorithms termite hill routing algorithm

来源：评论

学校读者我要写书评

暂无评论

FOG-RPL: Fog Computing-based routing Protocol for IoT Networks

引用

RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING 2024年第2期17卷 170-180页

作者： Verma, Ankit Deswal, Suman Deenbandhu Chhotu Ram Univ Sci & Technol Dept Comp Sci & Engn Murthal Haryana India

Background The Internet of Things (IoT) is widely used because of the connectivity of devices with the Internet which provides accessibility, quick transmission, and broader coverage. IoT networks provide vast connectivity but finding the best path for sharing information is a big challenge because of limited resources like limited power and limited bandwidth. The routing protocol for low power lossy network (RPL) is standard protocol but it selects a node that has already been selected in a busty *** The fog computing technique is combined with RPL and the new objective function is used to design FOG-RPL which is the optimum routing protocol that reduces the network load using the fog computing principle and selects the right node using the new objective *** The simulation is performed and experimental results show that FOG-RPL gives better results in terms of improvement and in terms of performance *** The FOG-RPL protocol uses the fog computing principle with a new objective function and performance analysis shows that as compared to the existing routing protocol, it is more efficient.

关键词： IoT networks routing protocols routing algorithms fog computing internet of things objective function

来源：评论

学校读者我要写书评

暂无评论

NOMA-Assisted routing Algorithm Design for UAV Ad Hoc Relay Networks

引用

IEEE SENSORS JOURNAL 2023年第3期23卷 3296-3312页

作者： Yang, Xincheng Han, Bing Zhang, Gengxin Zheng, Ping Bai, Jianan Qin, Danyang Heilongjiang Univ Sch Elect Engn Harbin 150080 Peoples R China Heilongjiang Univ Harbin 150080 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 211189 Peoples R China

Unmanned aerial vehicle (UAV) ad hoc networks can be deployed flexibly and rapidly without any infrastructure, so as to play an irreplaceable role in postdisaster relief. However, the dynamic topology and energy constraints of UAVs always bring new challenges to the design of effective network architectures and routing strategies. In this article, a three-layer UAV network architecture is constructed, and the UAV channel models for the different layers are discussed categorically. A greedy perimeter comprehensive evaluation routing (GCER) algorithm is designed on the basis of geographic routing greedy perimeter stateless routing (GPSR). By estimating the energy, link stability, and data throughput of the UAV neighboring nodes, the optimal next-hop UAV node is synthetically evaluated using the analytic hierarchy process (AHP). In particular, the use of nonorthogonal multiple access (NOMA) technology in ad hoc networks is considered, and a nonconvex optimization problem for maximizing the throughput estimation of UAV relay nodes based on NOMA is proposed to solve for the optimal allocation of UAV transmission power in routing. Numerical results show that the proposed GCER routing algorithm has significant advantages over GPSR in improving link stability. The use of NOMA access technology in UAV ad hoc networks has a significant increase in the throughput of the data links.

关键词： routing NOMA Autonomous aerial vehicles Ad hoc networks Throughput Stability analysis Sensors Analytic hierarchy process (AHP) multilayer network architecture nonorthogonal multiple access (NOMA) routing algorithms unmanned aerial vehicle (UAV) ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

SDODV: A smart and adaptive on-demand distance vector routing protocol for MANETs

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2023年第5期16卷 2325-2348页

作者： Kaddoura, Sanaa Haraty, Ramzi A. Al Jahdali, Sultan Assi, Maram Zayed Univ Coll Technol Innovat Abu Dhabi U Arab Emirates Lebanese Amer Univ Dept Comp Sci & Math Beirut Lebanon Taif Univ Dept Comp Sci Taif Saudi Arabia

Mobile ad hoc networks (MANETS) are nodes connected in a peer-to-peer fashion. Because MANETs have challenging characteristics such as mobility and limited energy, traditional existing routing protocols are not very efficient - they suffer several limitations in terms of network stability and lifetime, especially in the emerging era of IoT, crowd-sensing, and smart cities. In this work, we present SDODV, a new smart and dynamic on-demand distance vector routing protocol for mobile ad hoc networks that addresses the shortcomings of existing routing protocols. Our proposed adaptive algorithm effectively increases the built network's lifetime by considering the network topology when establishing a route. It monitors the traffic load, nodes mobility, neighborhood density, and battery power to adjust packets accordingly. This protocol is based on the distributed reinforcement learning approach and on the traditional AODV. SDODV improves the quality of service because it chooses the shortest and most stable path while considering mobility, bandwidth, and power. Experimental results prove that SDODV outperforms the shortest path method and reduces energy consumption.

关键词： Adaptive protocol Mobile ad hoc networks Q-learning routing algorithms Shortest path

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient routing based on a genetic algorithm for satellite laser communication

引用

OPTICS EXPRESS 2023年第5期31卷 8682-8695页

作者： Jing, Yinji Yang, Zhenghao Zhao, Yongli Wang, Hua Wang, Wei Rahman, Sabidur Zhang, Jie Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China AT&T Labs Atlanta CA USA

Low earth orbit satellite laser communication has become an important part of communications due to its large capacity and low latency. The lifetime of the satellite mainly depends on the recharge and discharge cycles of the battery. The low earth orbit satellites frequently recharge under sunlight and discharge in the shadow, which leads satellites to age quickly. This paper studies the energy-efficient routing problem for satellite laser communication and builds the satellite ageing model. Based on the model, we propose an energy-efficient routing scheme based on the genetic algorithm. Compared with shortest path routing, the proposed method improves the satellite lifetime by about 300%, and the performances of the network are only slightly degraded, the blocking ratio increases by only 1.2%, and the service delay increases by 1.3 ms.(c) 2023 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

关键词： Genetic algorithms Laser communications Network topology Optical devices Optical networks routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Preprocessing for segment routing optimization

引用

NETWORKS 2023年第4期82卷 459-478页

作者： Callebaut, Hugo De Boeck, Jerome Fortz, Bernard Univ libre Bruxelles Dept Informat Brussels Belgium INRIA INOCS Villeneuve Dascq France Univ Liege HEC Management Sch Liege Belgium Univ Fribourg Decis Support & Operat Res Fribourg Switzerland Univ Liege HEC Management Sch Rue Louvrex14 B-4000 Liege Belgium

In this article we introduce a preprocessing technique to solve the Segment routing Traffic Engineering Problem optimally using significantly fewer computational resources than previously introduced methods. Segment routing is a recently developed interior gateway routing protocol to be used on top of existing protocols that introduces more flexibility in traffic engineering. In practice, segment routing allows to deviate traffic from its original path by specifying a list of intermediate nodes or links, called segments, to visit before going to its destination. The issue we tackle in this article is that the number of segment paths scales exponentially with the maximum number of segments allowed leading to scalability issues in mathematical formulations. This article introduces the notion of dominated segment paths, these are paths that can be eliminated from the solution space when searching for an optimal solution. We propose a dynamic programming algorithm eliminating dominated paths for any number of segments. Numerical results show that respectively 50%, 90%, and 97% of paths are dominated when considering up to 2, 3, and 4 segments on benchmark network topologies.

关键词： graph theory mixed integer linear programming network flows network optimization routing algorithms segment routing telecommunication networks traffic engineering

来源：评论

学校读者我要写书评

暂无评论

A Improved Subgradient Lagrangian Relaxation Algorithm for Solving the Stochastic Demand Inventory routing Problem

引用

Cyber-Physical Systems 2023年第2期9卷 174-192页

作者： Zhao, Yuan-Yuan Duan, Qian-qian Department of Electric and Electronic Engineering Shanghai University Of Engineering Science Shanghai China

In order to improve the coordination efficiency of vehicle routing problem, a multi-level stochastic demand in ventory routing problem was established in this paper, which minimizes the total cost of the system by determining the relation among inventory of distribution center, fleets, and customer needs. Solving the Lagrangian dual problem by the traditional subgradient Lagrangian relaxation algorithm may easily cause oscillation and then slow down the solving speed. To tackle the problem, an improved subgradient Lagrangian relaxation algorithm was proposed. Compared with the traditional subgradient algorithm, the proposed method is faster and improves the quality of the approximate solution. © 2021 Informa UK Limited, trading as Taylor & Francis Group.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：