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

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

来源：评论

学校读者我要写书评

暂无评论

SFPAG-R: A Reliable routing algorithm Based on Sealed First-Price Auction Games for Industrial Internet of Things Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第5期70卷 5016-5027页

作者： Zhang, Wenbo Wang, Xin Han, Guangjie Peng, Yan Guizani, Mohsen Shenyang Ligong Univ Sch Informat Sci & Engn Shenyang 110159 Peoples R China Hohai Univ Dept Internet Things Engn Changzhou 213022 Peoples R China Shanghai Univ Sch Artificial Intelligence Shanghai Peoples R China Qatar Univ CSE Dept Doha 2713 Qatar

Due to the harsh deployment environment of the Industrial Internet of Things, the reliability of data transmission has always been an important challenge and a hot topic in Industrial Internet of Things (IIoT). Based on a multiple sink node network model, we propose a reliable routing algorithm called SFPAG-R, which is based on sealed first-price auction games. The algorithm offers a route discovery process and data transmission mechanism using the multi-sink network structure. The classic sealed first-price auction game is improved, and we propose a sealed first-price auction game model based on standard normal distribution, in order to ensure that the auction nodes can obtain higher returns. Based on an analysis of the factors affecting reliable data transmission in a large-scale, industrial IoT system, a data forwarding auction game model is established. Finally, to address the issue of selfish nodes, a dynamic revenue control method is proposed to promote cooperation between nodes. The simulation results indicate that the SFPAG-R algorithm proposed in this paper can reliably reduce the average amount of hops that occur during data transmission, ensure a high rate of successful data transmission, balance network energy consumption, and prolong the network's life cycle.

关键词： Reliability routing Games Peer-to-peer computing Industrial Internet of Things Data communication Wireless sensor networks IoT routing algorithm Auction game Reliable transmission

来源：评论

学校读者我要写书评

暂无评论

TB-TBP: a task-based adaptive routing algorithm for network-on-chip in heterogenous CPU-GPU architectures

引用

JOURNAL OF SUPERCOMPUTING 2024年第5期80卷 6311-6335页

作者： Fang, Juan Wei, Zhichao Liu, Yaqi Hou, Yumin Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China

With the rapid development of heterogeneous network-on-chip (NoC), a vast amount of shared resources are integrated into NoC. Intense resource competition exists between CPUs and GPUs, leading to congestion and a decrease in overall network performance. Reasonable node placement can minimize network conflicts at the topology level. This paper first discusses the placement of shared last-level cache and memory controller, then selects a more rational placement method and optimizes the path. To solve the hot spots problem in center placement method, a task-based routing algorithm is designed to plan the path. Simulation results demonstrate that, compared to the traditional routing algorithm, the overall network latency is reduced by 9%, and the CPU performance is improved by 13.6%. Furthermore, a dynamic task-based routing algorithm is proposed. Compared to the static task routing algorithm, the overall network latency is reduced by 2.08%, and the CPU performance is improved by 4.09%.

关键词： Heterogeneous architectures Network-on-chip (NoC) routing algorithm Task-based

来源：评论

学校读者我要写书评

暂无评论

ECCRA: An energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2008年第10期31卷 2398-2407页

作者： Jin, Yan Jo, Ju-Yeon Wang, Ling Kim, Yoohwan Yang, Xiaozong Univ Nevada Sch Informat Las Vegas NV 89154 USA Harbin Inst Technol Sch Comp Sci Harbin 150006 Peoples R China Univ Nevada Sch Comp Sci Las Vegas NV 89154 USA

Wireless sensor networks can be used to monitor the interested region using multi-hop communication. Coverage is a primary metric to evaluate the monitoring capacity. Connectivity also should be guaranteed so that the sink node can receive all sensed data for future processing. In this paper, combining these two problems, we study the connected, coverage problem given a specific network coverage ratio under border effects. We consider the scenario where the sensor nodes are distributed in a circle-shaped region uniformly. We first derive the network coverage provided by N sensor nodes by the mathematical formulae exactly. The lower bound of the network connectivity probability is also derived. Since sensor nodes are equipped with energy-limited batteries, energy conservation in such networks is of paramount importance to prolong the network lifetime. Accordingly, we then propose a location-independent, energy-efficient routing algorithm ECCRA which achieves the required network coverage and sensor connectivity simultaneously. The extensive simulation results demonstrate that our algorithm is correct and effective. (C) 2008 Elsevier B.V. All rights reserved.

关键词： wireless sensor networks border effects coverage connectivity routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Male-Silkmoth-Inspired routing algorithm for Large-Scale Wireless Mesh Networks

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2015年第4期17卷 384-393页

作者： Nugroho, Dwi Agung Prasetiadi, Agi Kim, Dong-Seong Kumoh Natl Inst Technol Dept IT Convergence Engn Sch Elect Engn Gumi South Korea

This paper proposes an insect behavior-inspired routing algorithm for large-scale wireless mesh networks. The proposed algorithm is adapted from the behavior of an insect called Bombyx mori, a male silkmoth. Its unique behavior is its flying technique to find the source of pheromones. The algorithm consists of two steps: the shortest-path algorithm and the zigzag-path algorithm. First, the shortest-path algorithm is employed to transmit data. After half of the total hops, the zigzag-path algorithm, which is based on the movement of the male B. mori, is applied. In order to adapt the biological behavior to large-scale wireless mesh networks, we use a mesh topology for implementing the algorithm. Simulation results show that the total energy used and the decision time for routing of the proposed algorithm are improved under certain conditions.

关键词： Bio-inspired large-scale wireless mesh networks male-silkmoth behavior routing algorithm

来源：评论

学校读者我要写书评

暂无评论

LEF: An Effective routing algorithm for Two-Dimensional Meshes

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2019年第10期E102D卷 1925-1941页

作者： Van Chu, Thiem Kise, Kenji Tokyo Inst Technol Dept Comp Sci Tokyo 1528550 Japan Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Japan

We design a new oblivious routing algorithm for two-dimensional mesh-based Networks-on-Chip (NoCs) called LEF (Long Edge First) which offers high throughput with low design complexity. LEF's basic idea comes from conventional wisdom in choosing the appropriate dimension-order routing (DOR) algorithm for supercomputers with asymmetric mesh or torus interconnects: routing longest dimensions first provides better performance than other strategies. In LEF, we combine the XY DOR and the YX DOR. When routing a packet, which DOR algorithm is chosen depends on the relative position between the source node and the destination node. Decisions of selecting the appropriate DOR algorithm are not fixed to the network shape but instead made on a per-packet basis. We also propose an efficient deadlock avoidance method for LEF in which the use of virtual channels is more flexible than in the conventional method. We evaluate LEF against O1TURN, another effective oblivious routing algorithm, and a minimal adaptive routing algorithm based on the odd-even turn model. The evaluation results show that LEF is particularly effective when the communication is within an asymmetric mesh. In a 16 x 8 NoC, LEF even outperforms the adaptive routing algorithm in some cases and delivers from around 4% up to around 64.5% higher throughput than O1TURN. Our results also show that the proposed deadlock avoidance method helps to improve LEF's performance significantly and can be used to improve O1TURN's performance. We also examine LEF in large-scale NoCs with thousands of nodes. Our results show that, as the NoC size increases, the performance of the routing algorithms becomes more strongly influenced by the resource allocation policy in the network and the effect is different for each algorithm. This is evident in that results of middle-scale NoCs with around 100 nodes cannot be applied directly to large-scale NoCs.

关键词： Network-on-Chip two-dimensional (2D) mesh routing algorithm Long Edge First (LEF)

来源：评论

学校读者我要写书评

暂无评论

Complement routing: A methodology to design reliable routing algorithm for Network on Chips

引用

MICROPROCESSORS AND MICROSYSTEMS 2010年第6期34卷 163-173页

作者： Patooghy, Ahmad Miremadi, Seyed Ghassem Sharif Univ Technol Dept Comp Engn Tehran Iran

Use of deep sub-micron VLSI technologies in fabrication of Network on Chips (NoCs) makes the reliability to be one of the first order concerns in the design of these products. This paper proposes and evaluates a methodology that adds reliability to NoC routing algorithms with minimal power and performance overheads. The key idea behind this methodology is to use the concept of complement routing in which two routing algorithms with disjoint sets of allowed turns are incorporated. According to this methodology, while a packet is routed by a routing algorithm, a redundant copy of that packet is routed by the complement of that routing algorithm. This is done by exploiting channels with lower utilization to route redundant packets. To find the complement of the used NoC routing algorithm, an analytical approach based on the channel dependency graph is presented. The methodology is applied to two NoCs using the dimension order and the Duato's routing algorithms. These networks are simulated using an HDL-based NoC simulator along with the Synopsys Power Compiler tool. Results extracted by different traffic generation rates and by different error injection rates confirm that the proposed methodology provides similar reliability improvement in comparison with the flood-based routing algorithms. This methodology also decreases the performance and power consumption overheads as compared to the flood-based routing algorithms. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Network on chip routing algorithm Reliability Fault injection

来源：评论

学校读者我要写书评

暂无评论

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 multi-constraint optimal routing algorithm in LEO satellite networks

引用

WIRELESS NETWORKS 2021年 1-12页

作者： Zhao, Na Long, Xiaoyi Wang, Jian Yunnan Univ Sch Software Key Lab Software Engn Yunnan Prov Kunming 650091 Yunnan Peoples R China Wuhan Univ Sch Comp Sci Wuhan 430072 Peoples R China Kunming Univ Sci & Technol Coll Informat Engn & Automat Kunming 650504 Yunnan Peoples R China Elect Power Res Inst Yunnan Power Grid Kunming 650217 Yunnan Peoples R China

The LEO satellite network is an important part of the communication network, among which the inter-satellite link (ISL) undertakes the main data transmission task. The routing technology in LEO constellation is an important technical component of the satellite communication system. However, the design of ISL routing algorithm is not easy. It is necessary to consider the relative motion between satellites, the data transmission capacity of nodes and the reliability of links. Moreover, the algorithm should be adaptive to face all kinds of emergencies. Based on the above considerations, this paper proposes a multi-constraint optimal routing algorithm (MCORA) in LEO satellite networks. By analyzing various parameters that may affect data transmission, the link selection problem is transformed into a multi-constraint optimal problem. In order to avoid getting trapped in local optimal solution during path finding, an improved ant colony algorithm is proposed. So MCORA not only considers the optimal link selection but also considers the reliability and load balancing of the whole network. Simulation results show that the MCORA scheme obtains better link performance, indicating the proposed routing algorithm is feasible.

关键词： LEO satellite networks Inter satellite link routing algorithm Multi-constraint optimal problem Ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

A crosstalk aware routing algorithm for Benes ONoC

引用

IEICE ELECTRONICS EXPRESS 2012年第12期9卷 1069-1074页

作者： Bai, Luying Gu, Huaxi Yang, Yintang Wang, Kun Xidian Univ State Key Lab ISN Xian 710071 Peoples R China Sci & Technol Informat Transmiss & Disseminat Com Shijiazhuang Peoples R China Xidian Univ Inst Microelect Xian Peoples R China Xidian Univ Inst Comp Sci Xian Peoples R China

Optical network-on-chip (ONoC) has been proposed to provide higher bandwidth and lower power consumption for future multicore systems. However, due to the intrinsic characteristic of optical devices, crosstalk noise is a potential issue for ONoC. The traditional routing algorithms for Benes ONoC have not considered the aspect of crosstalk. In this paper, we build the crosstalk model of the optical switch and analyze the crosstalk noise, signal-to-noise-ratio (SNR) and bit-error-rate (BER) for Benes ONoC. Moreover, we propose a routing algorithm to relieve the crosstalk problem. Simulation results verify the effectiveness of the algorithm compared to the conventional alternatives.

关键词： Optical network-on-chip Benes crosstalk routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：