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

A Cross Unequal Clustering routing algorithm for Sensor Network

MEASUREMENT SCIENCE REVIEW 2013年第4期13卷 200-205页

作者： Wang Tong Wu Jiyi Xu He Zhu Jinghua Munyabugingo, Charles Harbin Engn Univ Coll Informat & Commun Engn Harbin 150001 Peoples R China Hangzhou Normal Univ Key Lab E Business & Informat Secur Hangzhou 311121 Zhejiang Peoples R China Harbin Engn Univ Coll Mech & Elect Harbin 150001 Peoples R China Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Peoples R China

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the "hot spot" problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node's position and node's remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime.

关键词： Sensor networks routing algorithm energy balance

来源：评论

学校读者我要写书评

暂无评论

Congestion aware routing algorithm for delay-disruption tolerance networks

引用

Journal of Central South University 2011年第1期18卷 133-139页

作者：陶勇龚正虎林亚平周四望 School of Computer National University of Defense Technology School of Software Hunan University

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering *** simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.

关键词： delay-disruption tolerant network congestion control routing algorithm custody transfer

来源：评论

学校读者我要写书评

暂无评论

A Non-Minimal routing algorithm for Aging Mitigation in 2D-Mesh NoCs

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2019年第7期38卷 1373-1377页

作者： Wang, Liang Wang, Xiaohang Leung, Ho-Fung Mak, Terrence Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Peoples R China Tsinghua Univ Inst Microelect Beijing 100084 Peoples R China South China Univ Technol Sch Software Engn Guangzhou 510006 Guangdong Peoples R China South China Univ Technol Guangzhou Inst Adv Technol Guangzhou 510006 Guangdong Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

Due to technology scaling, aging issue is becoming one of major concerns in the design of network-on-chip (NoC). The imbalanced workload distribution and routing algorithm cause aging hotspots, where a certain group of routers have higher aging effect than others. This can possibly lead to shorter lifetime of NoC. Most existing aging-aware routing algorithms are based on minimal routing, which suffers from less degree of adaptiveness compared to non-minimal routing. Thus, they are inefficient to mitigate the aging effect of routers. In this paper, we propose to use a non-minimal routing scheme to detour the traffic away from the aging hotspots, with the objective of mitigating the aging effect for NoCs. The problem is formulated as a bottleneck shortest path problem and solved using a dynamic programming approach. Finally, the experimental results show that compared to the state-of-the-art aging-aware routing algorithm, the non-minimal routing algorithm has up to 20% lifetime improvement for hotspot traffic patterns and realistic workload traces.

关键词： Aging dynamic programming network-on-chip (NoC) non-minimal routing routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Load-Balancing routing algorithm Based on Segment routing for Traffic Return in LEO Satellite Networks

引用

IEEE ACCESS 2019年 7卷 112044-112053页

作者： Liu, Wei Tao, Ying Liu, Liang China Acad Space Technol Inst Telecommun Satellite Beijing 100094 Peoples R China

To tackle the network congestion problem caused by ground gateway stations arranged within a limited area in low earth orbit (LEO) satellite networks, a routing algorithm based on segment routing for traffic return is proposed. Light and heavy load zones are dynamically divided according to the relative position relationship between gateways and the reverse slot. The pre-balancing shortest path algorithm is used in the light load zone, and the minimum weight path defined by congestion index is the routing rule in the heavy load zone. Then, the consistent forwarding is performed referring to segment routing in all zones. Simulation conditions are different sizes of heavy load zone, different traffic density distributions, and different traffic demands. Simulation results confirm that the load-balancing performance is improved significantly with the extension of the heavy load zone size in terms of the average rejection ratio, the average relative throughput, the maximum link utilization, and the average delay. The proposed algorithm is an alternative solution and guidance for routing strategy in LEO satellite networks.

关键词： Load balancing LEO satellite networks routing algorithm segment routing

来源：评论

学校读者我要写书评

暂无评论

A Deterministic-Path routing algorithm for Tolerating Many Faults on Very-Large-Scale Network-on-Chip

引用

ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS 2021年第1期26卷 1–26页

作者： Zhang, Ying Hong, Xinpeng Chen, Zhongsheng Peng, Zebo Jiang, Jianhui Tongji Univ Sch Software Engn Beijing Peoples R China Linkoping Univ Embedded Syst Lab Linkoping Sweden

Very-large-scale network-on-chip (VLS-NoC) has become a promising fabric for supercomputers, but this fabric may encounter the many-fault problem. This article proposes a deterministic routing algorithm to tolerate the effects of many faults in VLS-NoCs. This approach generates routing tables offline using a breadth-first traversal algorithm and stores a routing table locally in each switch for online packet transmission. The approach applies the Tarjan algorithm to degrade the faulty NoC and maximizes the number of available nodes in the reconfigured NoC. In 2D NoCs, the approach updates routing tables of some nodes using the deprecated channel/node rules and avoids deadlocks in the NoC. In 3D NoCs, the approach uses a forbidden-turn selection algorithm and detour rules to prevent faceted rings and ensures the NoC is deadlock-free. Experimental results demonstrate that the proposed approach provides fault-free communications of 2D and 3D NoCs after injecting 40 faulty links. Meanwhile, it maximizes the number of available nodes in the reconfigured NoC. The approach also outperforms existing algorithms in terms of average latency, throughput, and energy consumption.

关键词： routing algorithm fault-tolerant NoC avoiding deadlock turn model 3D NoC

来源：评论

学校读者我要写书评

暂无评论

Vehicular delay tolerant network routing algorithm based on trajectory clustering and dynamic Bayesian network

引用

WIRELESS NETWORKS 2023年第4期29卷 1873-1889页

作者： Wu, Jiagao Cai, Shenlei Jin, Hongyu Liu, Linfeng Nanjing Univ Posts & Telecommun Sch Comp Nanjing 210023 Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Peoples R China

Typically, delay tolerant network (DTN) suffers from frequent disruption, high latency, and lack of stable connections between nodes. As a special case of DTN, vehicular delay tolerant network (VDTN) has particular spatial-temporal characteristics. Different kinds of vehicles may have different movement ranges and movement patterns and the movements of vehicles exhibit significant dynamics from the temporal view. The movement patterns and dynamic characteristics of vehicles are difficult to be described accurately. To this end, a novel framework of VDTN routing algorithm based on trajectory clustering and dynamic Bayesian network (DBN) is proposed, which can capture the spatial-temporal characteristics and the movement patterns of vehicles in the real VDTN scenarios. Firstly, a K-means trajectory clustering (KTC) algorithm is adopted to cluster the trajectories of vehicles according to their spatial characteristics. Then, a KTC-based DBN structure learning algorithm is proposed to construct the prior network and transition network of DBN by an extended K2(+) algorithm to capture the temporal characteristics of VDTN, and multiple DBN models are established for different trajectory clusters to further improve the prediction accuracy. Finally, a VDTN routing algorithm is presented to forward message by the inference of DBN models. Simulation results show that the proposed VDTN routing algorithm has a higher delivery ratio as well as a lower overhead compared with other related routing algorithms, and the effectiveness of the trajectory clustering method and DBN models are verified.

关键词： Vehicular delay tolerant network routing algorithm K-means trajectory clustering Dynamic Bayesian network Performance

来源：评论

学校读者我要写书评

暂无评论

Message Ferry routing algorithm for Data Collection in Partitioned and Buffer-Limited Wireless Sensor Networks

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2012年第4期28卷 655-669页

作者： Chang, Jyh-Huei Jan, Rong-Hong Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

In some particular environments such as battlefield, disaster recovery and wide area surveillance, most existing routing algorithms will fail to deliver messages to their destinations. Thus, it is an important research issue of how to deliver data in disconnected wireless sensor networks. This paper presents two efficient message ferry routing algorithms, denoted as MFRA1 and MFRA2, for data collection in disconnected wireless sensor networks. Both algorithms are designed to find feasible routes for the message ferry such that the buffers of sensors will not overflow after a complete sequence. A complete sequence is the visit sequence of message ferry which visits every sensor node at least once. We find the shortest sequence for message ferry which visits every sensor exactly once and then we check the feasibility of the visit sequence. If there is a sensor overflow, MFRA1 and MFRA2 fix the overflow by partitioning the initial visit sequence into some sub-sequences such that the ferry visits the overflow node twice in the resulting sequence. The above process will continue until a feasible solution is found. Simulation results show that both MFRA1 and MFRA2 are better than other schemes in terms of the amount of data lost, because the other schemes neglect the case of sensor overflow.

关键词： message ferry routing algorithm data collection sensor networks partitioned networks

来源：评论

学校读者我要写书评

暂无评论

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 ACO-based cross-layer routing algorithm in space-air-ground integrated networks

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2021年第5期14卷 3372-3387页

作者： Zheng, Rongping Zhang, Jiaxiang Yang, Qi Xiamen Univ Sch Informat Xiamen 361005 Fujian Peoples R China

Space-air-ground integrated networks (SAGINs) are heterogeneous, self-organizing and time-varying wireless networks providing massive and global connectivity. These three characteristics of SAGINs bring great challenges for routing design. In this paper, the important parameters affecting performance of SAGINs are analyzed, based on which the heterogeneous network framework is described as a vector weighted topology. Instead of a scale, the weighted parameter of the topology is a vector with elements of signal-to-noise ratio (SNR), variation of SNR, end-to-end delay and queuing length. To meet the time-varying requirements, a Wiener predictor is adopted for obtaining the estimated channel information, the expectation of queuing delay is also acquired by modeling the process of packets waiting the transmitting buffer as a M/M/1 queuing system. Considering the Ant Colony Optimization (ACO) algorithm sharing the common decentralized feature with routing algorithm in SAGINs, a novel ACO-based cross-layer routing algorithm for SAGINs is proposed. The proposed algorithm takes the link quality and end-to-end packed delay in the physical layer as deciding factors in searching for optimal routing. Simulations performed in different scenarios show that this proposed algorithm demonstrates a higher packet delivery rate.

关键词： Peer-to-peer network SAGIN Ant colony optimization routing algorithm Cross-layer design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：