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

A Length Matching routing algorithm for Set-Pair routing Problem

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年第12期E98A卷 2565-2571页

作者： Nakatani, Yuta Takahashi, Atsushi Tokyo Inst Technol Tokyo 1528550 Japan Tokyo Inst Technol Elect & Elect Engn Tokyo 1528550 Japan Tokyo Inst Technol Grad Sch Sci & Engn Dept Commun & Comp Engn Tokyo 1528550 Japan

In the routing design of interposer and etc., the combination of a pin pair to be connected by wire is often flexible, and the reductions of the total wire length and the length difference are pursued to keep the circuit performance. Even though the total wire length can be minimized by finding a minimum cost maximum flow in set pair routing problems, the length difference is often large, and the reduction of it is not easy. In this paper, an algorithm that reduces the length difference while keeping the total wire length small is proposed. In the proposed algorithm, an initial routing first obtained by a minimum cost maximum flow. Then it is modified to reduce the maximum length while keeping the minimum total wire length, and a connection of the minimum length is detoured to reduce the length difference. The effectiveness of the proposed algorithm is confirmed by experiments.

关键词： set-pair routing interposer PCB routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Game-based congestion-aware routing algorithm in wireless network on chips

引用

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2023年第4期42卷 258-268页

作者： Tahanian, Esmaeel Tajary, Alireza Rezvani, Mohsen Shahrood Univ Technol Fac Comp Engn Shahrood Iran

Wireless network on chip (WiNoC) has been introduced to alleviate some challenges with conventional NoC such as high latency and power consumption. routing the packet through the wireless links for arriving to far apart destination leads to a shorter path. Therefore, many of nodes prefer to send their packets to nearest wireless router on the WiNoC. When the demand for a wireless node increases, the likelihood of the congestion increases. To address this problem, we propose a game-based yet simple routing algorithm to balance the traffic in this paper. The WiNoC is modelled with a mixed-strategy Bayesian-game in which the nodes are the players with two valid actions namely, routing the packets with and without the wireless links. The simulation results show that using the proposed mixed-strategy for considerably improves the performance of the network, more precisely, the system performance is improved 10%-42% compared with the previous related works.

关键词： wireless network on chips WiNoCs routing algorithm game theory

来源：评论

学校读者我要写书评

暂无评论

An effective data fusion-based routing algorithm with time synchronization support for vehicular wireless sensor networks

引用

JOURNAL OF SUPERCOMPUTING 2018年第3期74卷 1267-1282页

作者： Tan, Chang Ji, Sai Gui, Ziyuan Shen, Jian Fu, De-Sheng Wang, Jin Nanjing Univ Informat Sci & Technol Jiangsu Engn Ctr Network Monitoring Nanjing 210044 Jiangsu Peoples R China Yangzhou Univ Sch Informat Engn Yangzhou 225009 Jiangsu Peoples R China

In the field of vehicular wireless sensor networks-based structural health monitoring, the structural damage identification is achieved by two structural features, namely natural frequencies and mode shapes. The kind of data fusion-based routing algorithm in specific applications needs to meet time synchronization requirements and meet certain constraints, such as the single-hop communication between cluster head node and each node in cluster, the overlap between different clusters and so on. To meet the special constraints for data fusion-based routing algorithm in structural health monitoring, this paper proposed a new method based on an improved flooding time synchronization protocol, which is called time synchronization and enhanced greedy algorithm based on D(v) (TSDEGA) routing algorithm. The TSDEGA method can achieve the minimum connected cover by node's own degree D(v), and it can also meet the structural health monitoring routing constraints. The simulation experiments show that TSDEGA has better energy resistance and longer network lifetime, and it is superior to the traditional greedy algorithms. The proposed algorithm can effectively eliminate interference of outliers and improve the accuracy in order to meet time synchronization requirements in structural health monitoring applications.

关键词： Data fusion routing algorithm Energy efficiency Time synchronization Vehicular wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware routing algorithm for Wireless Sensor Networks with Optimal Relay Detecting

引用

WIRELESS PERSONAL COMMUNICATIONS 2018年第2期98卷 1701-1717页

作者： Li, Feng Wang, Li Zhejiang Univ Technol Coll Informat Engn 288 Liuhe Rd Hangzhou 310023 Zhejiang Peoples R China

Efficient and reliable routing plays a key role in wireless sensor networks in which routing design with regard to network availability and node lifetime needs to be deliberately considered. When multi-hop relay transmission is frequently applied to reduce a source node's energy consumption and improve network capacity, a key issue affecting the nodes' participation in the transmission is the problem of suitably determining the next hop in order to prolong each node's lifetime and to maintain the energy-balancing of the whole network. In this study, we propose an energy-aware routing scheme by taking the Cauchy operator, node's residual energy and routing distance into account. Based on Cauchy inequation, we achieve a relationship between the routing distance and the energy usage in the routing. By fixing a relay selection parameter and then identifying the next hop appropriately, we obtain a balancing energy-aware routing algorithm. Numerical results are provided to verify the lifetime and equilibrium of the energy distribution by comparing with them with those of a traditional approach.

关键词： Energy awareness routing algorithm Multi-hop transmission Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Harris Hawks Optimization algorithm Based 2-Hop routing algorithm for CR-VANET

引用

IEEE ACCESS 2021年 9卷 58230-58242页

作者： Hossain, Mohammad Asif Noor, Rafidah Md Yau, Kok-Lim Alvin Azzuhri, Saaidal Razalli Z'Abar, Muhammad Reza Ahmedy, Ismail Jabbarpour, Mohammad Reza Univ Malaya Fac Comp Sci & Informat Technol Kuala Lumpur 50603 Malaysia Univ Malaya Fac Comp Sci & Informat Technol Ctr Mobile Cloud Comp Kuala Lumpur 50603 Malaysia Sunway Univ Sch Sci & Technol Petaling Jaya 47500 Selangor Malaysia Niroo Res Inst Dept Informat & Commun Technol Tehran *** Iran

Vehicular Ad Hoc Network (VANET) emerges to ameliorate road accident, traffic congestion, and infotainment. Cognitive radio (CR) is integrated with VANET (termed as CR-VANET) to deal with the spectrum scarcity problems. For better data transmission, routing is very important in a highly dynamic CR-VANET environment. routing in CR-VANET has several challenges due to vehicles' high-speed movements and channel accessibility issues. This paper proposes a 2-Hop routing algorithm based on the Multi-Objective Harris Hawks Optimization (2HMO-HHO) algorithm that chooses the optimal forwarders between the source and destination vehicles. Selecting 2-hops instead of multiple hops or the entire route increases the selected route's stability and assures successful data transmission. The simulations performed in OMNeT++ with SUMO show that the proposed algorithm achieves promising results on throughput, delay, packet delivery ratio, packet loss rate and communication overhead.

关键词： routing Vehicular ad hoc networks Optimization routing protocols Delays Heuristic algorithms Dedicated short range communication VANET routing algorithm 2-hop routing Harris Hawks Optimization cognitive radio throughput packet delivery ratio delay packet loss rate communication overhead

来源：评论

学校读者我要写书评

暂无评论

GIR: An Opportunistic Network routing algorithm Based on Game Theory

引用

IEEE ACCESS 2020年 8卷 201158-201172页

作者： Li, Limiao Wang, Haotian Liu, Zhixiong Ye, Hui Changsha Univ Sch Comp Engn & Appl Math Changsha 410003 Peoples R China Cent South Univ Sch Comp Sci & Engn Changsha 410075 Peoples R China

A large number of routing algorithms in Opportunistic Networks are based on the assumption that nodes are free to help other nodes forward messages. However, when the Opportunistic Network is applied to an urban environment, the nodes will have certain social attributes. In many cases, a node can decide whether to execute the routing policy or not. Due to the limited resources and poor social relationships, nodes may be unwilling to forward messages from other nodes and have strong motivation to implement selfish policies. As a result, increased network latency reduces message delivery rates and affects the overall network performance. In order to solve this problem, we propose a perceptual routing protocol to promote node cooperation from the perspective of game theory. Specifically, We introduce the concept of virtual currency and construct a price function, and nodes can obtain a certain virtual currency through cooperation. In the process of message forwarding, we consider the change of link degree and energy of node (the energy exists in the form of electricity in this article), and use them as factors of the trading node quotation. The trading node finally makes it through the multiple rounds of bargaining games, so that the proposed game between both sides reaches the Nash equilibrium. Experiments show that the algorithm outperforms Epidemic, EPSR, MINEIRO and ICRP algorithms in terms of delivery rate, average latency and energy consumption. According to the simulation experiments, the average delivery ratio of GIR algorithm is 0.68, which is 13% higher than that of the epidemic algorithm. In terms of average delay, 7% is better than ICRP algorithm.

关键词： Cooperation routing algorithm Nash equilibrium selfish

来源：评论

学校读者我要写书评

暂无评论

DFRDRL: a dynamic fuzzy routing algorithm based on deep reinforcement learning with guaranteed latency and bandwidth for software-defined networks

引用

JOURNAL OF BIG DATA 2024年第1期11卷 150页

作者： Wang, Yonghong Othman, Marini Choo, Wou Onn Liu, Ruiqing Wang, Xiaofeng Xinzhou Normal Univ Dept Comp Sci Xinzhou 034000 Shanxi Peoples R China INTI Int Univ Fac Data Sci & Informat Technol Nilai 71800 Negeri Sembilan Malaysia Xinzhou Normal Univ Dept Econ & Management Xinzhou 034000 Shanxi Peoples R China

Traditional routing algorithms have several limitations that become increasingly significant in the context of Software-Defined Networking (SDN). Firstly, these algorithms often have limited support for Quality of Service (QoS) requirements, making them less suitable for handling diverse traffic types efficiently. Moreover, current SDN controllers leverage a default shortest-path routing approach, which does not allow for more dynamic and flexible traffic management based on real-time network policies. To address these issues, this paper introduces a Dynamic Fuzzy routing algorithm based on Deep Reinforcement Learning (DRL) for SDN that provides guaranteed latency and bandwidth (DFRDRL). DFRDRL provides intelligent and efficient routing that adapts to dynamic traffic by considering path-state criteria and using DRL. Fuzzy logic mainly performs online routing between an ingress-egress pair. To adapt to dynamic traffic changes, DFRDRL can predict the traffic matrix in real time. Meanwhile, DFRDRL reduces the routing reliance on network topology by weighting the network based on critical nodes. Additionally, when the network experiences congestion based on the traffic matrix, a deferral mechanism is applied to prioritize requests with lower resource demands. This mechanism helps ensure efficient resource allocation by temporarily postponing or queuing higher-demand requests, thereby optimizing overall network performance during periods of congestion. The simulation results show that the performance of DFRDRL is better than the equivalent algorithms in terms of latency and throughput. Also, DFRDRL is about 2.5% more efficient than the best existing algorithm in terms of admission rate of routing requests.

关键词： Software-defined networking routing algorithm Dynamic routing Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A fuzzy bandwidth and delay guaranteed routing algorithm for performance enhancement of video conference over MPLS networks

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2021年第6期14卷 7079-7090页

作者： Gong, Jianhu Nazari, Hamed Guangdong Peizheng Coll Sch Data & Comp Sci Guangzhou 510830 Peoples R China Urmia Univ Dept Comp Engn Orumiyeh Iran

Nowadays, video conferencing is one of the state-of-the-art and highly demanded technologies for conducting online communications. Providing real-time and rapid connection establishment is one of the chief principles of video conferences which is competently achieved by Multi-Protocol Label Switching (MPLS). Also, the emerging concept of Next Generation Networks (NGN) has accelerated the advancement of IP-based multimedia networks including Voice over IP (VoIP), Video on Demand (VoD) and IPTVs. MPLS networks have formed the foundation of fulfilling multimedia requirements in NGN. Therefore, Label Switching Path (LSP) routing is one of the highlighted challenges of Traffic Engineering (TE) in MPLS networks. MPLS routing algorithms attempt to increase the acceptance rate of requests and consequently meet the Quality of Service (QoS) constraints satisfaction. In this paper, we propose a novel routing algorithm that applies fuzzy rules to meet the bandwidth and end-to-end delay constraints in the routing. The proposed fuzzy mechanism constitutes a predicting system based on weighted fuzzy rules that filters the requests with higher resource demands. We name the proposed method as Fuzzy Bandwidth and Delay guaranteed routing algorithm (FBDRA). Schematically, FBDRA aims to defer the requests with maximum bandwidth and minimum end-to-end delays. All simulation experiments are carried out in MATLAB R2019a on different scenarios. We have gauged several metrics such as the number of accepted requests, average path length, energy consumption, load balancing, and average end-to-end delay to evaluate our proposed algorithm performance. The simulation results evidence the superiority of FBDRA in video conference applications.

关键词： routing algorithm MPLS Video conference Fuzzy system Weighted rules

来源：评论

学校读者我要写书评

暂无评论

A Load Balance routing algorithm for Medical IoT Based on Link Quality

引用

WIRELESS PERSONAL COMMUNICATIONS 2023年第2期133卷 1265-1279页

作者： Shen, Hongming Cheng, Xingsi Xu, Boyang Shao, Wei Xu, Chen Shen, Xiaoyan Nantong Univ Sch Informat Sci & Technol Nantong Peoples R China Nantong Res Inst Adv Commun Technol Nantong Peoples R China Baokong Nantong IoT Technol Co Ltd Nantong Peoples R China

In order to address the pressing needs for energy efficiency, system stability, and reliable data transmission in medical Internet of Things (IoT) applications, a novel routing algorithm built upon Bluetooth Low Energy (BLE) mesh network architecture is proposed. This proposed algorithm quantifies the channel quality for each communication link within the network. By doing so, it retains only the two most viable links between the source and destination nodes to guarantee stability in message transmission. Moreover, the algorithm minimizes the number of solitary nodes functioning as intermediaries. This mitigates the risk of node over-utilization, which is a common cause of rapid battery depletion, thus prolonging the overall lifespan of the network. Comparative experimental data indicate that this proposed algorithm outperforms conventional mesh networking approaches in both channel quality and energy sustainability.

关键词： Medical IoT BLE mesh network routing algorithm B-AOMDV

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing algorithm for Self-Organizing Networks in 5G-Based Intelligent Transportation Systems

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2024年第1期70卷 1757-1765页

作者： Quy, Vu Khanh Chehri, Abdellah Quy, Nguyen Minh Nguyen, Van-Hau Ban, Nguyen Tien Hung Yen Univ Technol & Educ Dept Informat Technol Hung Yen 160000 Vietnam Royal Mil Coll Canada Dept Math & Comp Sci Kingston ON K7K 7B4 Canada Posts & Telecommun Inst Technol Fac Telecommun Hanoi 100000 Vietnam

The rapid growth of the consumer Internet of Things (CIoT) has resulted in substantial enhancements in networking and data analytics. The emergence of customer-centric communication technologies like mobile ad hoc networks (MANETs) and vehicular ad hoc networks (VANETs), also known as self-organizing networks (SONs), along with the integration of 5G Internet of Things and artificial intelligence, has paved the way for intelligent transportation systems (ITS). In SONs, each vehicle serves as a network node. Hence, it is essential for these network nodes to interact, communicate, and exchange data in a flexible, efficient, and convenient manner. SONs offer revolutionary communication capabilities by enabling self-configuration, self-setting, and autonomous data transmission. However, one significant drawback of SONs is their poor network performance. In this study, we have developed an efficient routing scheme that aims to enhance the performance and reduce energy consumption of SONs for ITS in smart cities with low mobility speeds. The simulation results clearly show that the proposed algorithm performs better than conventional routing protocols in low-speed mobility scenarios. It outperforms in terms of network lifetime, packet delivery ratio, and latency.

关键词： routing routing protocols Measurement Ad hoc networks Mobile computing Internet of Things Clustering algorithms Consumer Internet of Things (CIoT) edge/fog computing routing algorithm low-speed transportation scenarios energy-saving effectiveness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：