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

A DTN Oriented Adaptive routing algorithm Based on Node Load

China Communications 2022年第12期19卷 54-63页

作者： Hongyan Cui Diyue Chen Roy E.Welsch State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing University of Posts and TelecommunicationsBeijing 100876China Massachusetts Institute of Technology CambridgeMA 02139USA

In recent years,Delay Tolerant Networks(DTN)have received more and more *** the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network *** paper proposes an AdaptiveSpray routing *** algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination *** the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding *** simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.

关键词： DTN routing algorithm adaptive cache management

来源：评论

学校读者我要写书评

暂无评论

RAPAR: routing algorithm based on node relationship mining in opportunistic network

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2022年第4期15卷 1953-1963页

作者： Yuan, Peiyan Shao, Saike Huang, Xiaoyan Henan Normal Univ Sch Comp & Informat Engn Xinxiang 453007 Henan Peoples R China Big Data Engn Lab Teaching Resources Xinxiang Henan Peoples R China

Information-assisted routing algorithms improve the performance of mobile opportunistic networks (MONs), where node utility and packet redundancy are used in the data forwarding process. Making a tradeoff between the forwarding performance and network overhead is the key problem in MONs. In this study, we propose a multiple-copy routing scheme based on node relationship mining. This scheme considers the influence of the difference and dynamic variability of the relationship between nodes on the routing packets. First, it uses the complex contact information of the nodes to reflect the social relationship of the nodes. Second, to further reduce the network overhead, the relationship model is constructed using the Apriori algorithm to calculate the social forwarding utility of the node. The experimental results show that the proposed scheme can achieve better network performance. This effectively reduces the network overhead on the premise of higher delivery rate and lower transmission delay.

关键词： Apriori Opportunistic networks routing algorithm Social relationship

来源：评论

学校读者我要写书评

暂无评论

Route Packets Uneven, Consume Energy Even: A Lifetime Expanding routing algorithm for WSNs

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第4期125卷 3133-3151页

作者： Kamarei, Meisam Tavakoli, Fatemeh Patooghy, Ahmad Univ Appl Sci & Technol Dept Comp Sci Tehran Iran Islamic Azad Univ Dept Comp Sci Aligoudarz Branch Aligudarz Iran North Carolina A&T State Univ Dept Comp Syst Technol Greensboro NC 27411 USA

Wireless Sensor Networks (WSNs) are infrastructure-free networks consisting of tiny and simple environmental sensing devices. Sensor nodes collaborate through wireless and limited-range communication links to report environmental conditions to the network base-station (BS). These features need to establish efficient routing algorithms in WSNs to optimize various parameters of WSNs, including energy consumption, end-to-end delay, network lifetime, and network congestion. This paper proposes an efficient routing algorithm to evenly consume energy over the network area that eventually expands the network lifetime. The proposed algorithm directs an event occurrence report toward the BS in a multi-hop manner. Intermediate sensor nodes decide about the next receiving node of the report using a lightweight optimization process based on the network's mean residual energy, sensors' distance to BS, and the positions of neighboring sensors. Evaluations show that the proposed algorithm directs traffic toward the boundaries of the network, which leads to better balance in traffic and energy consumption network-wide. The proposed algorithm reduces the standard deviation of the sensor node residual energy up to 6x and, through this, expands the network lifetime by at least 36%.

关键词： Binary particle swarm optimization algorithm (BPSO) routing algorithm Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Q-Learning-Based Fault-Tolerant and Congestion-Aware Adaptive routing algorithm for Networks-on-Chip

引用

IEEE EMBEDDED SYSTEMS LETTERS 2022年第4期14卷 203-206页

作者： Liu, Yi Guo, Rujia Xu, Changqing Weng, Xiaodong Yang, Yintang Xidian Univ Sch Microelect Xian 710071 Peoples R China Xidian Univ Guangzhou Inst Technol Xian 710071 Peoples R China

Link failure and network congestion have a serious impact on the performance degradation of network on chip (NoC). Adaptive routing algorithms, which have the capability of fault tolerance and congestion awareness, can make NoCs adapt to complex and changeable applications. The proposed algorithm in this letter is an adaptive routing algorithm based on Q -learning. By introducing H - Q table to learn the congestion and fault information of the paths between the source node and the destination node, it can avoid the unnecessary detour of data in the fault area and select the path with less congestion. Aiming at the problem caused by the untimely updating of some values in Q -learning, the Q -value decay and dynamic learning rate mechanism are proposed. Experimental results demonstrate that the proposed routing algorithms still can obtain a good performance under a high failure rate (Fault rate > 25%) with modest extra hardware overhead.

关键词： Congestion aware fault tolerant network on chip (NoC) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Multi-Region Division routing algorithm Based on Fuzzy-Shortest-Path-First for LEO Satellite Networks 19

A Multi-Region Division Routing Algorithm Based on Fuzzy-Sho...

引用

19th IEEE International Wireless Communications and Mobile Computing (IEEE IWCMC)

作者： Li, Shangyi Wang, Fu Yao, Haipeng Dong, Ze Dong, Tao Yin, Jie Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China Beijing Univ Posts Telecommun BUPT Sch Elect & Engn Beijing Peoples R China Space Star Technol Co Ltd State Key Lab Space Ground Integrated Informat Te Beijing Peoples R China

ISBN: (纸本)9798350333398

As an important complement to the terrestrial network and an essential component of the future 6G, Low Earth Orbit (LEO) satellite network is expected to provide higher-quality communication services in combination with terrestrial network and attracts widespread research interest. Since the unbalanced distribution of terrestrial services may lead to inter-satellite link (ISL) congestion, balancing the network load has become one of the key issues for LEO satellite networks. In order to prevent ISL congestion in LEO networks, we propose a multi-region division routing algorithm based on fuzzy-shortest-path-first (FSPF-MDR) for LEO satellite networks. We divide the satellite network into multiple small regions and share link information within the regions to achieve congestion avoidance. Simulation results show that, using the proposed algorithm, the computing complexity is reduced significantly with a slightly cost of increasing average hop count. Furthermore, it is able to achieve congestion prevention while using fewer resources. With different scales of LEO networks, the computing complexity can be reduced by 45% to 70%.

关键词： LEO satellite networks routing algorithm region division load balancing

来源：评论

学校读者我要写书评

暂无评论

GAPPO - A Graph Attention Reinforcement Learning based Robust routing algorithm 34

GAPPO - A Graph Attention Reinforcement Learning based Robus...

引用

IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Li, Xinyuan Xiao, Yang Liu, Sixu Lu, Xucong Liu, Fang Zhou, Wenli Liu, Jun Beijing Univ Posts & Telecommun Sch Artificial Intelligence Beijing Peoples R China

ISBN: (纸本)9781665464833

routing algorithms, which determine how to deliver traffic from the source to the destination, are essential for next-generation networks and the internet. To make optimal routing decisions in complex network environments, researchers have leveraged Deep Reinforcement Learning (DRL) to design next-generation routing mechanisms. However, most existing DRLbased routing algorithms are implemented using traditional Neural Networks (NN), which lack robustness against topology changes. In this paper, we propose a novel algorithm called GAPPO, which integrates Graph Attention Network (GAT) and Proximal Policy Optimization (PPO) to optimize routing policies with the objective of minimizing end-to-end (E2E) latency in networks affected by link failures. To evaluate the performance of the proposed algorithm, we conduct a series of experiments on dynamically changing topologies with link failures under different loads. Experimental results demonstrate that GAPPO outperforms benchmark algorithms in both simulated and real-world networks, confirming its powerful robustness against link failures.

关键词： Deep Reinforcement Learning Graph Neural Network routing algorithm Attention Robustness

来源：评论

学校读者我要写书评

暂无评论

An enhanced routing algorithm based on a re-position particle swarm optimization (RA-RPSO) for wireless sensor network

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第10期34卷 10304-10318页

作者： Elshrkawey, Mohamed Al-Mahdi, Hassan Atwa, Walid Suez Canal Univ Fac Comp & Informat Dept Informat Syst Ismailia 41522 Egypt Suez Canal Univ Fac Comp & Informat Dept Comp Sci Ismailia 41522 Egypt Menoufia Univ Fac Comp & Informat Dept Comp Sci Menoufia Egypt

Energy saving is a major requirement in the design of routing algorithms to maximize the throughput and lifetime of wireless sensor networks. To address this requirement, this work proposes a routing algorithm based on a novel Reposition Particle Swarm Optimization (RPSO) algorithm and a new fitness function. The role of the RPSO algorithm is to salvage particles that may have fallen into local minima, if any. The algorithm is evaluated using three types of benchmark functions, namely unimodal, multimodal, and rotated multimodal. The evaluation results demonstrate that RPSO outperforms native Particle Swarm Optimization and Particle Swarm Optimization with Levy Flight in terms of convergence speed and global optimum identification. The proposed RPSO is then employed to develop an efficient routing algorithm. The routing algorithm is tested in terms network lifetime, number of dead sensor nodes, energy consumption, and number of packets delivered to base station, against four competitive MetaHeuristic algorithms. The test results clearly indicate that the routing algorithm outperforms all the competitive algorithms for all the performance metrics. In particular, it achieves 14% to 29% higher network lifetime, 52% to 58% less dead sensor nodes, 61% to 70% less energy consumption, and 13% to 36% more throughput.

关键词： PSO Mult-objective function Wireless sensor network Clustering routing algorithm Power consumption

来源：评论

学校读者我要写书评

暂无评论

Multi-user routing algorithm for indoor spaces-Adapted for social distancing

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第9期34卷 7045-7058页

作者： Alamri, Abdullah Alturki, Rayan Ali Alamri, Sultan Univ Jeddah Coll Comp Sci & Engn Jeddah Saudi Arabia Saudi Elect Univ Coll Comp & Informat Riyadh Saudi Arabia

The development of techniques and systems for indicating routes in outdoor and indoor spaces has received a great deal of attention. While outdoor route planning is based on criteria such as the shortest, fastest route, and the least number of turns, indoor route planning is primarily focused on accessibility and safety. routing systems for indoor spaces have become the focus of many researchers due to significant differences that make indoor routing is more complex than outdoor routing. An indoor environment is complex, which makes it difficult to find a route due to closed corridors, multiple floors, and other indoor features. Because of the present global scenario following the advent of the COVID-19 pandemic, indoor routing has become increasingly crucial. Wi-Fi, Bluetooth, and RFID are among the technologies used for indoor routing. For these technologies to help and guide users to the optimal route to their chosen destinations, they require accurate information, appropriate processing and modeling, and route density monitoring to ensure social distancing. In this paper, a new multi-user routing algorithm for indoor spaces is proposed. It has been adapted to the need for social distancing, and is based on multiple users, allowing more than one user to take the route or separate routes at one time without causing congestion on the same route. Despite the complexity of the system, the evaluation indicated that the proposed algorithm successfully controlled the flow of moving objects while ensuring social distancing and maintaining low costs. (c) 2022 The Author(s). Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： routing algorithm Indoor space Spatial databases Social distancing COVID-19 Indoor technology

来源：评论

学校读者我要写书评

暂无评论

A fuzzy-based fast routing algorithm with guaranteed latency-throughput over software defined networks

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第10期34卷 8221-8233页

作者： Li, Hongsheng Osmani, Amjad Aziz, Amira Sayed A. Huanghuai Univ Sch Intelligent Manufacture Zhumadian 463000 Henan Peoples R China Islamic Azad Univ Dept Comp Engn Qazvin Branch Qazvin Iran Future Univ Egypt Fac Comp & Informat Technol Digital Media Dept New Cairo 11835 Egypt

With the development of online communications over the Internet, the network is required to guarantee the Quality of Service (QoS) requirements for different traffic flows. High quality and fast communication can be provided by Software-Defined Networks (SDN). SDN is a promising architecture for efficient man-agement of network resources by separating control logic from data planes. In order to ensure the QoS requirements of traffic flows in SDN, this paper proposes a Fuzzy-based fast and efficient routing algo-rithm with guaranteed Latency-Throughput (FRLR). The FRLR develops the dynamic routing problem in SDN using a traffic flow classification mechanism based on a fuzzy system. The purpose of the fuzzy sys-tem is to efficiently distribute resource allocation to improve the handling of future requests. In addition, the FRLR classifies traffic flows based on latency to reduce computational complexity. Besides, FRLR can effectively direct traffic flows and reduce network energy consumption by identifying critical links and selecting appropriate paths. Simulations on standard topologies with different scenarios confirm the bet-ter performance of FRLR by guaranteeing QoS requirements. The FRLR classifies traffic flows efficiently and offers significant improvements in the scalability and throughput of the network. Also, FRLR has pro-vided superior results compared to some state-of-the-art algorithms such as MDA, MDWCRA, FARP, ECMP, and QI-RM. Experimental results show that FRLR works on average between 7% and 24% better than other algorithms.(c) 2022 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Software defined networks Latency Throughput Traffic flows Fuzzy systems routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Network performance optimisation using triple interleaving routing algorithm for oil and gas pipeline network

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2022年第2期28卷 147-170页

作者： Lee, Mohamad Yusry Lee Ikhwan Azman, Amierul Syazrul Azril Subramaniam, Siva Kumar Feroz, Farah Shahnaz Univ Teknikal Malaysia Melaka UTeM Fak Kejuruteraan Elekt & Kejuruteraan Komputer Melaka Malaysia Univ Teknikal Malaysia Melaka UTeM Fak Kejuruteraan Elekt & Kejuruteraan Komputer Adv Sensors & Embeded Controls Syst ASECS Melaka Malaysia Univ Teknikal Malaysia Melaka UTeM Fak Kejuruteraan Elekt & Kejuruteraan Komputer Pervas Comp & Educ Technol PET Melaka Malaysia

As demand for oil and gas increases, demands for a safe and efficient system for remote control and pipeline management also increases. The wireless sensor network (WSN) can facilitate real-time data transmission between sensor nodes and centralised monitoring stations. In this application, nodes are distributed in a linear chain configuration to cover long-distance pipelines in the midstream. When the size of the network increases, the performance of WSN is compromised. Consequently, the network has a substantially low throughput, low delivery ratio, high latency, high energy consumption, and unfairness. In this paper, ad-hoc on-demand distance vector triple interleaving (AODVTRI), a reactive protocol that reduced routing inconsistency by splitting the network traffic into three separate routes with the consideration of x-axis is proposed. The proposed routing protocol was evaluated with AODV and DSDV with 20, 40, 60, 80, 100, 120, 140, 160, 180, and 200 node deployments in accordance with IEEE802.11 standard.

关键词： WSN linear oil and gas pipeline LWSN routing algorithm multi-hop

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：