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

Soft Actor-critic-based distributed routing Scheme for Edge Computing Integrated with Dynamic IoT Networks

IETE JOURNAL OF RESEARCH 2025年第2期71卷 537-553页

作者： Genefer, M. Jasmin Annie Theresa, M. M. Janeela St Xaviers Catholic Coll Engn Dept Comp Applicat Nagercoil 629003 Tamil Nadu India

The rapid expansion of the Internet of Things (IoT) necessitates advanced routing schemes capable of meeting the stringent demands for low latency and high accuracy, which are critical for applications such as autonomous vehicles and telemedicine. Traditional edge computing methods often struggle with elevated latency, rendering them unsuitable for time-sensitive applications. Additionally, many reinforcement learning (RL) algorithms require action space discretization, which can introduce biases and dimensionality challenges. This paper introduces a novel Soft Actor-Critic (SAC)-based distributed routing scheme for edge computing, specifically designed to address these limitations. By integrating RL with Maximum Entropy principles and employing a decentralized approach, the proposed model enhances network performance, reduces delays, and effectively manages multi-optimality criteria. The distributed routing scheme operates independently of a centralized controller, allowing routers to make autonomous decisions and adapt seamlessly to changes in the network. This is accomplished through a Markov Decision Process (MDP) that optimizes routing paths based on various factors, including node depth, energy consumption, and transmission probability. The methodology encompasses local training phases for individual nodes, followed by federated training to refine the model across the network. Experimental results conducted on topologies of varying scales demonstrate the model's efficacy in achieving high accuracy and efficient convergence, particularly in dynamic IoT environments. These findings underscore the potential of the proposed SAC-based distributed routing scheme as a robust solution for enhancing routing efficiency and reliability in the evolving landscape of IoT *** STATEMENTThe rapid expansion of Internet of Things (IoT) applications demands advanced routing solutions to ensure low latency and high accuracy, crucial for sectors like autonomous vehi

关键词： delay distributed routing optimal paths Q-learning Soft actor-critic

来源：评论

学校读者我要写书评

暂无评论

A Centralized-distributed Joint routing Algorithm for LEO Satellite Constellations Based on Multi-Agent Reinforcement Learning

引用

APPLIED SCIENCES-BASEL 2025年第9期15卷

作者： Xia, Licheng Lin, Baojun Zhao, Shuai Zhao, Yanchun ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Chinese Acad Sci Innovat Acad Microsatellites Shanghai 201304 Peoples R China

Designing routing algorithms for Low Earth Orbit (LEO) satellite networks poses a significant challenge due to their high dynamics, frequent link failures, and unevenly distributed traffic. Existing studies predominantly focus on shortest-path solutions, which compute minimum-delay paths using global topology information but often neglect the impact of traffic load on routing performance and struggle to adapt to rapid link-state variations. In this regard, we propose a Multi-Agent Reinforcement Learning-Based Joint routing (MARL-JR) algorithm, which integrates centralized and distributed routing algorithms. MARL-JR combines the accuracy of centralized methods with the responsiveness of distributed approaches in handling dynamic disruptions. In MARL-JR, ground stations initialize Q-tables and upload them to satellites, reducing onboard computational overhead while enhancing routing performance. Compared to traditional centralized algorithms, MARL-JR achieves faster link-state awareness and adaptation;compared to distributed algorithms, it delivers superior initial performance due to optimized pre-training. Experimental results demonstrate that MARL-JR outperforms both Q-routing (QR) and DR-BM algorithms in average delay, packet loss rate, and load-balancing efficiency.

关键词： satellite network low earth orbit reinforcement learning distributed routing

来源：评论

学校读者我要写书评

暂无评论

distributed routing IN NETWORKS USING AFFINITY PROPAGATION

DISTRIBUTED ROUTING IN NETWORKS USING AFFINITY PROPAGATION

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Shamaiah, Manohar Lee, Sang Hyun Vishwanath, Sriram Vikalo, Haris Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9781457705397

This paper applies affinity propagation (AP) to develop distributed solutions for routing over networks. AP is a message passing algorithm for unsupervised learning. This paper demonstrates that AP can be generalized and applied to a wide class of problems in networking. In particular, AP can be used to develop distributed routing mechanisms for networks. Simulation results demonstrate that the proposed schemes compare favorably with the existing methods.

关键词： Affinity propagation distributed routing

来源：评论

学校读者我要写书评

暂无评论

An Effective and Feasible Congestion Management Technique for High-Performance MINs with Tag-Based distributed routing

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2013年第10期24卷 1918-1929页

作者： Escudero-Sahuquillo, Jesus Garcia, Pedro J. Quiles, Francisco J. Flich, Jose Duato, Jose Univ Castilla La Mancha Comp Syst Dept Escuela Super Ing Informat Albacete 02071 Spain Univ Politecn Valencia Dept Comp Engn E-46071 Valencia Spain

As parallel computing systems increase in size, the interconnection network is becoming a critical subsystem. The current trend in network design is to use as few components as possible to interconnect the end nodes, thereby reducing cost and power consumption. However, this increases the probability of congestion appearing in the network. As congestion may severely degrade network performance, the use of a congestion management mechanism is becoming mandatory in modern interconnects. One of the most cost-effective proposals to deal with the problems derived from congestion situations is the Regional Explicit Congestion Notification (RECN) strategy, based on using special queues to totally isolate the packet flows which contribute to congestion, thereby preventing the Head-of-Line (HoL) blocking effect that these flows may cause to others. Unfortunately, RECN requires the use of source-based routing, thus not being suitable for interconnects with distributed routing, like InfiniBand. Although some RECN-like mechanisms have been proposed for distributed-routing networks, they are not scalable due to the huge amount of control memory that they require in medium-size or large networks. In this paper, we propose distributed-routing-Based Congestion Management (DRBCM), a new scalable technique which, following the RECN principles, totally prevents congestion from producing HoL-blocking in multistage interconnection networks (MINs) using tag-based distributed routing. Simulation results indicate that, regardless of network size, DRBCM presents small resource requirements to keep network performance at maximum level even in scenarios of heavy congestion, where it utterly outperforms (with a gain up to 70 percent) current solutions for distributed-routing networks, like the InfiniBand congestion-control mechanism based on injection throttling. Thus, DRBCM is an efficient, cost-effective, and scalable solution for congestion management.

关键词： High-performance interconnection networks distributed routing congestion management head-of-line blocking

来源：评论

学校读者我要写书评

暂无评论

A new distributed routing protocol using partial traffic information for vehicular ad hoc networks

引用

WIRELESS NETWORKS 2014年第6期20卷 1627-1637页

作者： Tian, Rui Zhang, Baoxian Zheng, Jun Ma, Jian Beijing Univ Technol Sch Software Engn Beijing 100124 Peoples R China Univ Chinese Acad Sci Res Ctr Ubiquitous Sensor Networks Beijing 100049 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

In vehicular ad hoc networks, road traffic information can be used to support efficient routing. However, dissemination of up-to-date global road traffic information usually consumes considerable network resources and may also lead to the scalability issue. On the other hand, the highly dynamic nature of road traffic information makes it difficult to collect and disseminate such information in a timely fashion. Outdated information can lead to inefficient routing decisions and thus degraded routing performance. This paper proposes a distributed routing protocol using partial accurate routing information (RPPI). In RPPI, each node uses accurate local traffic information in its local zone and statistical traffic information in remote areas for route selection, which can significantly reduce the communication overhead. Simulation results show that RPPI can achieve better routing performance in terms of end-to-end packet delivery ratio and end-to-end packet delivery delay as compared with existing work.

关键词： distributed routing Partial traffic information Vehicular ad hoc network

来源：评论

学校读者我要写书评

暂无评论

A distributed routing scheme for energy management in solar powered sensor networks

引用

AD HOC NETWORKS 2017年 67卷 11-23页

作者： Dehwah, Ahmad H. Shamma, Jeff S. Claudel, Christian G. King Abdullah Univ Sci & Technol Dept Elect Engn Thuwal 239556900 Saudi Arabia King Abdullah Univ Sci & Technol Thuwal 239556900 Saudi Arabia Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Univ Texas Austin Dept Civil Architectural & Environm Engn Austin TX 78712 USA

Energy management is critical for solar-powered sensor networks. In this article, we consider data routing policies to optimize the energy in solar powered networks. Motivated by multipurpose sensor networks, the objective is to find the best network policy that maximizes the minimal energy among nodes in a sensor network, over a finite time horizon, given uncertain energy input forecasts. First, we derive the optimal policy in certain special cases using forward dynamic programming. We then introduce a greedy policy that is distributed and exhibits significantly lower complexity. When computationally feasible, we compare the performance of the optimal policy with the greedy policy. We also demonstrate the performance and computational complexity of the greedy policy over randomly simulated networks, and show that it yields results that are almost identical to the optimal policy, for greatly reduced worst-case computational costs and memory requirements. Finally, we demonstrate the implementation of the greedy policy on an experimental sensor network. (C) 2017 Elsevier B.V. All rights reserved.

关键词： distributed routing Energy management Sensor networks Solar powered WSN

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient and delay-aware distributed routing with cooperative transmission for Internet of Things

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2018年 118卷 46-56页

作者： Wen, Shaojie Huang, Chuanhe Chen, Xi Ma, Jianhua Xiong, Naixue Li, Zongpeng Wuhan Univ State Key Lab Software Engn Comp Sch Wuhan Hubei Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan Hubei Peoples R China Hosei Univ Sch comp & Informat Sci Tokyo Japan Colorado Tech Univ Sch Comp Sci Colorado Springs CO USA

As an important part of IoT, Flying ad hoc networks (FANETs) can provide communication services for different devices in IoT and cyber-enabled applications. However, mobility of unmanned aerial vehicle (UAV) in FANETs results in wireless link unpredictability and increases the complexity of routing algorithms in these applications, especially for real-time routing. In this work, we propose an adaptive distributed routing method with cooperative transmission to effectively solve the problem presented above, in which the transmitters only use local information to transmit packets with help from their cooperative nodes. We formulate a corresponding mathematical optimization problem, in which the objective is to maximize network utility, while keeping end-to-end delay below a prescribed threshold. To support variations in network characteristics and channel states, we estimate the single-hop delay at relay node for each transmission, and use the dual decomposition method to transform the centralized problem into a distributed problem which allows the relay nodes to use only the local channel information and estimated delays to route the packets. Simulation results show that the proposed routing method can improve network performance in terms of energy efficiency, throughput and end-to-end delay. (C) 2017 Elsevier Inc. All rights reserved.

关键词： IoT and cyber-enabled applications distributed routing Cooperative transmission Delay constraint

来源：评论

学校读者我要写书评

暂无评论

Throughput Optimality and Overload Behavior of Dynamical Flow Networks Under Monotone distributed routing

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2015年第1期2卷 57-67页

作者： Como, Giacomo Lovisari, Enrico Savla, Ketan Lund Univ Dept Automat Control SE-22100 Lund Sweden CNRS GIPSA Lab F-38000 Grenoble France Univ So Calif Sonny Astani Dept Civil & Environm Engn Los Angeles CA 90089 USA

This paper investigates the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies. The networks are modeled as systems of ordinary differential equations based on mass conversation laws on directed graphs with limited flow capacities on the links and constant external inflows at certain origin nodes. Under monotonicity assumptions on the routing policies, it is proven that, if the external inflow at the origin nodes does not violate any cut capacity constraints, then there exists a globally asymptotically stable equilibrium, and the network achieves maximal throughput. On the contrary, should such a constraint be violated, the network overload behavior is characterized. In particular, it is established that there exists a cut with respect to which the flow densities on every link grow linearly over time (respectively, reach their respective limits simultaneously) in the case where the buffer capacities are infinite (respectively, finite).

关键词： distributed routing dynamical flow networks monotone dynamical systems resilience throughput transportation networks

来源：评论

学校读者我要写书评

暂无评论

distributed routing Based on Minimum End-to-End Delay for OFDMA Backhaul Mobile Mesh Networks

引用

ETRI JOURNAL 2013年第3期35卷 406-413页

作者： Chung, Jong-Moon Lee, Daeyoung Park, Jong-Hong Lim, Kwangjae Kim, HyunJae Kwon, Dong-Seung Yonsei Univ Sch Elect & Elect Engn Seoul 120749 South Korea ETRI Commun & Internet Res Lab Taejon South Korea ETRI Creat Future Res Lab Taejon South Korea

In this paper, an orthogonal frequency division multiple access (OFDMA)-based minimum end-to-end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type-I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end-to-end delay and support highly reliable routing using only local information of neighbor nodes.

关键词： Wireless mesh network (WMN) OFDMA backhaul minimum end-to-end delay (MED) distributed routing

来源：评论

学校读者我要写书评

暂无评论

A distributed routing method for multiple AGVs for motion delay disturbances

A distributed routing method for multiple AGVs for motion de...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Morinaka, S Nishi, T Konishi, M Imai, J Okayama Univ Dept Elect & Elect Engn Okayama 7008530 Japan

ISBN: (纸本)0780389123

In this paper, we propose a distributed routing method for multiple mobile robots under uncertain motion delays. The feature of the proposed method is that each AGV subsystem creates the routing to minimize the sum of the transportation time and the penalty for collision avoidance constraints taking into account motion delay disturbances for other AGVs. The computational results show that the total transportation time obtained by the proposed method is shorter than that of the conventional method under various type of motion delay disturbances.

关键词： Automated Guided Vehicles distributed routing motion delay disturbances rescheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：