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

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Zhao, Kaiyuan Zhao, Zinan Wang, Zhenyong Zhang, Hongjiang Harbin Inst Technol Sch Elect & Informat Engn Harbin Peoples R China China Aerosp Sci & Technol Innovat Inst Beijing Peoples R China

ISBN: (纸本)9798350384482;9798350384475

We researched and designed the routing algorithms GDQR and GD3QR based on deep reinforcement learning and graph neural networks, and completed model training and performance testing. We designed the deep reinforcement learning routing algorithm reward function and derived the value learning theory used by the algorithm. Then based on the Markov decision process we designed, we researched and designed the decision-making and training parts of the intelligent routing algorithm, and proposed GDQR routing algorithm. Then, we improved the GDQR algorithm based on Dueling Network and Double DQN(Deep Q Learning) technology and proposed the GD3QR routing algorithm to address the problem of traffic fluctuations having a greater impact on the reward function in routing scenarios and the overestimation problem in value learning. We completed the training of the GDQR and GD3QR algorithms and tested the performance of the two algorithms. The results show that the GDQR and GD3QR algorithms can effectively adjust routing according to the current network status and improve the QoS performance of the entire network in complex traffic scenarios.

关键词： routing algorithms deep reinforcement learning graph neural network GDQR GD3QR

来源：评论

学校读者我要写书评

暂无评论

routing Protocols in Wireless Sensor Networks: A Comprehensive Review and Future Perspectives 7

Routing Protocols in Wireless Sensor Networks: A Comprehensi...

引用

7th International Conference on Contemporary Computing and Informatics, IC3I 2024

作者： Kaur, Puneet Kaur, Kiranbir Verma, Deepak Kumar Singh, Kuldeep Kaushik, Keshav Singh, Vineeta Guru Nanak Dev University Department of Computer Engineering & Technology Punjab Amritsar India Department of Computer Science and Engineering Uttar Pradesh Kalyanpur India Guru Nanak Dev University Department of Electronics Technology Punjab Amritsar India Amity University Amity School of Engineering and Technology Punjab Mohali India

ISBN: (纸本)9798350350067

Wireless Sensor Networks (WSNs) have significantly transformed diverse domains such as industrial automation, healthcare, disaster management, and environmental monitoring. The complex interaction of routing protocols, essential for enabling smooth data transport despite the specific difficulties in WSN environments, is the core of their success. The objective of this study is to get a accurate understanding of routing algorithms specifically projected for wireless sensor networks. Expanding upon the essential features and significant disputes faced in WSN systems, admitting limited energy resources, bandwidth constraints, and node processing capabilities, the discussion accentuates the significance of effective routing protocols. Furthermore, it thoroughly analyzes many forms of routing protocols, including basic hierarchical and flat schemes, as well as advanced location-based and data-centric protocols. The protocol category is thoroughly examined, uncovering its unique benefits, limitations, and suitability for various WSN applications. Furthermore, the review reveals the latest developments and upcoming trends in WSN routing protocols, brooding areas such as energy efficiency, dependability, scalability, and adaptive resilience to changing network considerations. In conclusion, the evaluation furnishes a forward-looking view by outlining potential research areas and possible pathways for meliorating the designs of WSN routing protocols. The main goal is to heighten the efficacy and practicality of WSNs. In this work, we examined a number of routing algorithms according to important criteria including mobility, scalability, energy efficiency, and Quality of Service (QoS). We looked at how each method handles node mobility, performs as the network expands, guarantees dependable data transmission, and optimizes energy use. We also looked at ways for choosing the cluster head (CH), energy-saving data aggregation strategies, redundancy-reduction mechanisms, and the

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

End-to-end service provisioning based on extended segment routing in multi-domain optical networks of F5G

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2022年第7期14卷 550-561页

作者： Li, Xin Liu, Yikai Zhao, Yongli Li, Yajie Li, Zhuotong Rahman, Sabidur Zhang, Jie Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China Sonoma State Univ Dept Comp Sci Rohnert Pk CA 94928 USA

As the most important fabric of fixed networks, the optical network plays an important role in expanding network capacity and providing long distance communication. At present, the fixed network has entered a key era, i.e., the fifth-generation fixed network (F5G). As one of the main features of F5G, the full-fiber connection requires a tenfold to hundredfold increase in the number of connections, which means F5G will have tens of thousands of nodes and millions of connections. Large-scale networks are composed of multiple network domains connected to each other. The whole network can be subdivided according to network functional domain. To meet different service requirements, how to provision fast end-to-end service in a multi-domain scenario has become a key issue. In optical networks, lightpath establishment must precede service transmission. The latency of lightpath establishment includes lightpath establishment signaling latency and optical interleaving device configuration latency. The latter depends on equipment performance. Therefore, how to provision fast lightpath establishment signaling is a key problem. To reduce end-to-end service provisioning latency, we propose an extended-segment-routing-based fast service provisioning scheme for the first time, to our knowledge, which consists of two steps: signaling path acquisition and signaling provisioning. For the signaling path acquisition step, we propose an adaptive segment routing (ASR) algorithm that first performs service path calculation based on service requirements, then performs a label compression algorithm to obtain the signaling path represented by the minimum number of labels according to the service path. For the signaling provisioning step, we propose a fast-signaling provisioning (FSP) process that can realize fast signaling provisioning in both single-domain and multi-domain scenarios. The simulation results show that, (1) compared to the Dijkstra algorithm, the ASR algorithm achieves a lower

关键词： Networking hardware Numerical simulation Optical networks Optical signals Packet switching routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Review on Wireless Sensor Networks: routing

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第1期125卷 897-937页

作者： Basha, Adam Raja Koneru Lakshmaiah Educ Fdn Dept CSE Vaddeswaram 522502 AP India

Wireless sensor networks (WSNs) are networks with devices that can detect, process, store, and communicate wirelessly. Each network terminal can have multiple sensing devices that can measure physical variations such as temperature, brightness, humidity, and vibration. However, developing and implementing WSNs poses many challenges. This review presents the challenges of WSN using different routing algorithms such as geographic routing, energy-aware routing, delay aware routing, QoS aware routing, secure aware routing, and hierarchical aware routing. Another goal is to find out which WSN component automates interference and behavior. What kind of application is in the WSN depends not only on his work but also on the question of the basis, functionality, and handling of his project. The study was carefully planned, and the systematic review of the literature was set up in a strong framework according to a pre-defined protocol. Finally, we evaluate the performance parameters of previous routing algorithms with diverse routine metrics that are energy consumption, delay, packet delivery ratio, throughput, false ratio, packet loss ratio, and network overhead.

关键词： Wireless sensor networks routing algorithms Geographic routing Energy aware routing Delay aware routing QoS aware routing Secure aware routing and hierarchical aware routing

来源：评论

学校读者我要写书评

暂无评论

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 J., Huh S., Jun I.Y., Kim 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 routing Algorithm Based on Node Centrality and Optimal Stop Rule in Mobile Opportunistic Networks 11

A Routing Algorithm Based on Node Centrality and Optimal Sto...

引用

11th International Conference on Electrical Engineering, Computer Science and Informatics, EECSI 2024

作者： Liu, Jinjin Wen, Yuqing Yuan, Peiyan College of Software Henan Normal University Xinxiang China

ISBN: (纸本)9798350355314

In the mobile opportunity network, the forwarding mechanism with multiple copies is usually used to accelerate the spread of information, but it will also lead to the aggravation of network overload. How to reduce network overhead under the premise of ensuring a high delivery rate and low delay is an important research direction in mobile opportunistic networks. Firstly, in order to avoid the problem of excessive number of replicas in the network, this paper determines the optimal initial number of copies based on the optimal stop rule. Then, aiming at the problem of inefficient allocation of copy numbers in the process of data forwarding, we proposed a routing algorithm based on node centrality. Finally, through simulation experiments, and the results show that the algorithm achieves higher delivery rate, lower delay and network overhead compared with others. © 2024 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

The Impact of Temporal Resolution on routing Accuracy in Digital Twins of Multi-Domain Optical Networks

The Impact of Temporal Resolution on Routing Accuracy in Dig...

引用

2024 Asia Communications and Photonics Conference, ACP 2024 and International Conference on Information Photonics and Optical Communications, IPOC 2024

作者： Wu, Chengyu Hua, Nan Zhu, Kangqi Zheng, Xiaoping Department of Electronic Engineering Tsinghua University Beijing China

We studied the impact of the temporal resolution of digital twins on AI routing paradigms. Numerical results demonstrate that AI routing with low data temporal resolution has a relatively higher tolerance in light loa... 详细信息

ISBN: (纸本)9798350379266

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

The MAC aware routing algorithm in elastic optical networks

The MAC aware routing algorithm in elastic optical networks

引用

2023 Advanced Fiber Laser Conference, AFL 2023

作者： Huang, Junxiang Feng, Nan Li, Chaofeng Li, Xiaoke Chen, Yizhao Qin, Feng 34th Research Institute of CETC GuiLin541010 China 54th Research Institute of CETC Shijiazhuang050081 China Hebei Key Laboratory of Photonic Information Technology and Application Shijiazhuang050081 China

This paper proposes a dynamic routing method for optical networks to flexibly configure networks according to link-state and requirements of MAC layer. The effectiveness of the routing method is effectively by the OPN... 详细信息

ISBN: (纸本)9781510677661

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2022年第11期94卷 1253-1267页

作者： Xiong Zenggang Zeng Mingyang Zhang Xuemin Zhu Sanyuan Xu Fang Zhao Xiaochao Wu Yunyun Li Xiang Hubei Engn Univ Sch Comp & Informat Sci Xiaogan 432000 Peoples R China Hubei Univ Sch Comp Sci & Informat Engn Wuhan 430062 Hubei Peoples R China

In the big data environment, the social information of a large number of nodes cannot be reasonably analyzed and utilized, thus leading to the problem of uneven routing performance. Therefore, this paper proposes a Social Similarity routing Algorithm (SRRA) based on socially aware networks in the big data environment. In the SRRA algorithm, two main parts in which the process of nodes forwarding messages are in-community and out-of-community. First, we defined three indexes for nodes and communities in which nodes are located by analyzing human social behavior: community connectedness between communities, the activity of nodes, and the social similarity of nodes. Then these three indexes are used to make up two measures: the in-community forwarding measure and the out-of-community forwarding measure. When messages are forwarded within a community, we choose nodes with high in-community forwarding measures as relay nodes so that messages can be delivered quickly in the same community. The relay node with the highest out-of-community forwarding measure is chosen to forward the message to the adjacent communities that are as near as possible to the destination community as much as possible when messages are forwarded outside the community, which ensures that messages can always be sent to the target community fast and accurately. The results of the simulation experiments compared with existing routing algorithms prove that the SRRA routing algorithm significantly improves the message delivery ratio while effectively reducing the network overhead and average latency.

关键词： Big data Social aware networks routing algorithms Social relationships Community connectedness

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：