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

A Study on Maximizing the Parallelism of Macroscopically Derived routing algorithms for WSNs

COMPUTER JOURNAL 2015年第12期58卷 3306-3324页

作者： Huang, Chun-Chieh Ko, Ren-Song Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi Taiwan

The large-scale of massively dense wireless sensor networks (WSNs) brings up many challenges in designing efficient routing algorithms. Since the optimal load-balancing routing problem can be formulated as a set of partial differential equations (PDEs) by ignoring microscopic details, a simpler routing algorithm may be derived based on using WSNs themselves to solve the PDEs numerically. One example is the distributed Gauss-Seidel iteration (DGSI) algorithm which coordinates sensors to solve the PDEs by the Gauss-Seidel iteration in lexicographical order of unknowns. Although the parallelism of DGSI may be improved by using the red-black order, simply replacing the lexicographical order with the red-black order in DGSI may not work well since it cannot collect enough information to better determine the termination of the iteration. We propose the red-black distributed Gauss-Seidel routing (RB-DGSR) algorithm to address this problem. Furthermore, we present the five-color distributed De la Garza routing (FC-DDGR) algorithm for instances in which RB-DGSR may not converge, and theoretically prove that FC-DDGR achieves the optimum degree of parallelism. Our simulation results reveal that RB-DGSR and FC-DDGR significantly improve the parallelism and thus reduce the time to solve the PDEs without too much sacrifice of transmission overhead (in broadcast communication) and accuracy.

关键词： wireless sensor networks routing algorithms load-balancing partial differential equations red-black Gauss-Seidel method De la Garza method

来源：评论

学校读者我要写书评

暂无评论

Heterogeneity consideration in wireless sensor networks routing algorithms: a review

引用

JOURNAL OF SUPERCOMPUTING 2019年第5期75卷 2341-2394页

作者： Sharma, Deepak Ojha, Amritesh Bhondekar, Amol P. CSIR CSIO Acad Sci & Innovat Res AcSIR Chandigarh India CSIR CSIO Sect 30C Chandigarh 160030 India Dewan VS Inst Engn & Technol Meerut Uttar Pradesh India

Wireless sensor networks (WSNs) are resource-constrained networks with limited battery power, computation abilities and communication capabilities at the sensor node level. A long-standing need in the area is to reduce energy consumption of the WSN nodes and to extend the network lifetime, along with improving the network reliability and the network quality. Energy-efficient routing protocols can improve the WSN performance, and the algorithms have been explored widely by the researchers. In the majority of the work, sensor nodes have been considered homogeneous in their configuration and capabilities. However, in practical scenarios and with the advent of an era of connected devices, called Internet of Things, consideration of node heterogeneity in WSN has become inevitable. Nodes' heterogeneity can be exploited constructively in WSN routing algorithms. In the literature, many different heterogeneous WSN scenarios (e.g., energy, computation, link heterogeneities) have been considered and the routing algorithms have been proposed for performance improvement in such scenarios. This paper focuses on the routing concepts for diverse heterogeneous WSNs scenarios and covers the state of the art in the area. The clustering-based approaches for routing decisions are extensively covered under different heterogeneous WSN scenarios. Along with presenting a comprehensive review of the routing algorithms under different varieties of heterogeneous WSNs, the paper also discusses the effects and interdependencies of different heterogeneities in routing decisions and unveils new research directions in the area.

关键词： Wireless sensor networks routing algorithms Heterogeneity Clustering Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Analysis on extended ant routing algorithms for network routing and management

引用

JOURNAL OF SUPERCOMPUTING 2003年第3期24卷 327-340页

作者： Sum, J Shen, H Young, G Wu, J Leung, CS Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Japan Adv Inst Sci & Technol Grad Sch & Informat Sci Tatsunokuchi Ishikawa 9231292 Japan Calif State Polytech Univ Pomona Dept Comp Sci Pomona CA 91768 USA Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China

Advances in mobile agent research have brought in a new method for network routing, ant routing. Recently, we have derived some preliminary results regarding the agent population growth property and the jumping behavior for an ant routing algorithm. The focus was on the expected number of agents in a node. In practice, the number of agents propagating on each network channel is also critical as the network channel bandwidth is limited. In this paper, we first propose two extended ant routing algorithms, and then provide an in-depth analysis on the population growth behavior of the propagating agents for these algorithms, both at nodes (hosts) and on edges (channels) of the network.

关键词： Internet mobile agents routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Deadlock-free wormhole routing algorithms for star graph topology

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1995年第6期142卷 395-400页

作者： Ravikumar, CP Goel, AM Dept. of Electr. Eng. Indian Inst. of Technol. New Delhi India

For constructing massively parallel multicomputers with over 5000 processing nodes, the Star Graph topology is known to be better than the hypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-free algorithms for routing in Star Graph, assuming the Wormhole routing model. Both the algorithms use the concept of virtual channels introduced by Daily and Seitz. The first algorithm is non-optimal in terms of the average routing distance, but uses fewer virtual channels on the whole. The second algorithm is optimal in terms of routing performance, but requires a somewhat larger number of virtual channels per node.

关键词： parallel processing routing algorithms routing optimisation

来源：评论

学校读者我要写书评

暂无评论

routing algorithms for Hybrid Nodes in WSNs 1st

Routing Algorithms for Hybrid Nodes in WSNs

引用

1st International Conference on Advanced Communication and Computational Technology, ICACCT 2019

作者： Pant, Isha Verma, Shashi Kant Department of Computer Science GB Pant Institute of Engineering & Technology Pauri-Garhwal India

ISBN: (纸本)9789811553400

The prominent criteria for the Wireless Sensor Network are a lifetime of the network, stability, and the energy parameter. To enhance these crucial parameters, the paper introduces routing algorithms for hybrid nodes in sensor networks ‘RA-HNW’ protocol having four forms of sensor nodes varying in energy and capacities to improve the stability and lifespan of the sensor networks. The simulations for the proposed RA-HNW is simulated in MATLAB 2018b. It is observed that using the functionalities and capabilities of the different types of nodes taken in the work, the stability of the proposed schema increases by 49.12% as compared to the DCHRP4, twice and thrice as compared to ETSSEP, TSEP, and SEP. The lifetime criteria also upgrade by 10.49% over DCHRP4 with level four heterogeneity, 15.85% over DCHRP, 19.65% over ETSSEP, and about 64.87% over TSEP. The proposed RA-HNW methodology is well suited for working in the fixed sink environment. © 2021, Springer Nature Singapore Pte Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of distributed routing algorithms for NoCs

引用

IET COMPUTERS AND DIGITAL TECHNIQUES 2009年第5期3卷 460-475页

作者： Rodrigo, S. Medardoni, S. Flich, J. Bertozzi, D. Duato, J. Univ Politecn Valencia Parallel Architectures Grp DISCA Valencia Spain Univ Ferrara ENDIF Dept Engn I-44100 Ferrara Italy

Chip multiprocessors (CMPs) are gaining momentum in the high-performance computing domain. Networks-on-chip (NoCs) are key components of CMP architectures, in that they have to deal with the communication scalability challenge while meeting tight power, area and latency constraints. 2D mesh topologies are usually preferred by designers of general purpose NoCs. However, manufacturing faults may break their regularity. Moreover, resource management frameworks may require the segmentation of the network into irregular regions. Under these conditions, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. Logic-based distributed routing (LBDR) is proposed as a new routing method that removes the need for routing tables at all. LBDR enables the implementation of many routing algorithms on most of the practical topologies we may find in the near future in a multi-core system. From an initial topology and routing algorithm, a set of three bits per switch/output port is computed. Evaluation results show that, by using a small logic, LBDR mimics the performance of routing algorithms when implemented with routing tables, both in regular and irregular topologies. LBDR implementation in a real NoC switch is also explored, proving its smooth integration in the architecture and its negligible hardware and performance overhead.

关键词： NOCT gene ARCHITECTURE Latency Network routing route list routing algorithms Switches

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of routing algorithms in wormhole-switched networks

引用

PARALLEL COMPUTING 2006年第11-12期32卷 870-885页

作者： Shahrabi, A. Glasgow Caledonian Univ Sch Comp & Math Sci Glasgow G4 0BA Lanark Scotland

This paper presents, building on the analytical models developed in [A. Shahrabi, M. Ould-Khoua, L. Mackenzie, Performance modelling of broadcast communication in multicomputer networks, International Journal of Parallel, Emergent, and Distributed Systems 20 (1) (2005);A. Shahrabi, M. Ould-Khoua, On the communication latency of wormhole routed interconnection networks, International Journal of Simulation 4 (5-6) (2003) 32-43;A. Shahrabi, L. Mackenzie, M. Ould-Khoua, Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Traffic, in: N.J. Dimopoulos, K.F. Li (Eds.), Chapter 10 in High Performance Computing Systems And Applications, Kluwer Academic Publishers, Boston, 2002;A. Shahrabi, M. Ould-Khoua, L. Mackenzie, An Analytical Model of Wormhole-Routed Hypercubes under Broadcast Traffic, Performance Evaluation 53 (1) (2003) 23-42;A. Shahrabi, M. Ould-Khoua, L. Mackenzie, Latency of double-tree broadcast in wormhole-routed hypercubes, in: Proceedings of International Conference on Parallel Processing (ICPP'01), IEEE Computer Society, 2001, pp. 401-408] a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched interconnection networks carrying a broadcast traffic component and investigates the performance vicissitudes of them under a variety of network operating conditions. In contrast to previous works, which have reported superiority of adaptive over deterministic routing especially in high-dimensional networks such as hypercubes, our results show that adaptivity does not necessarily improve network performance even for high-dimensional networks and its superiority starts to deteriorate as the broadcast fraction of generated traffic increases. (c) 2006 Elsevier B.V. All rights reserved.

关键词： routing algorithms adaptive routing deterministic routing broadcast operation wormhole switching

来源：评论

学校读者我要写书评

暂无评论

routing algorithms for voice communication systems in air traffic services networks

Routing algorithms for voice communication systems in air tr...

引用

Annual Conference on Huntsville Simulation Conference, HSC 2006

作者： Rausch, Thomas Schmidt, Johannes Vienna University of Technology Gusshausstrasse 27-29 1040 Vienna Austria

This paper investigates the performance of fixed and dynamic routing algorithms in voice communication networks used for air traffic controls. Different routing algorithms were simulated in order to determine their applicability in the given application domain. After presentation of the simulation model model and its implementation, a subsequent comparison of real and simulated results evaluates the suitability of the simulation tool. Four routing algorithms were examined and tested in simulation to determine their performance characteristics in a loosely meshed networks topology.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Node duplication and routing algorithms for quantum-dot cellular automata circuits

引用

IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS 2006年第5期153卷 497-505页

作者： Chung, W. J. Smith, B. Lim, S. K. Stanford Univ Dept Elect Engn Stanford CA 94305 USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

Quantum-dot cellular automata (QCA) is a novel computing mechanism that can represent binary information based on the spatial distribution of electron charge configuration in chemical molecules. QCA circuit layout is currently restricted to a single layer with very limited number of wire crossings permitted. Thus, wire crossing minimisation is crucial in improving the manufacturability of QCA circuits. We present the first QCA node duplication and routing algorithms for wire crossing minimisation. Our duplication algorithm named fan-out tolerance duplication (FTD) explores node duplication in conjunction with node placement using K-layered bipartite graphs (KLBG). FTD successfully removes additional crossings at the cost of increased area and allows flexible tradeoff between area and wire crossing. Our routing algorithm, namely cycle breaker (CB), constructs a modified vertical constraint graph (VCG) to enforce additional vertical relation for wire crossing reduction. We formulate and provide a heuristic solution for the weighted minimum feedback edge set problem to effectively remove cycles from the VCG. As a result, FTD and CB achieve wire crossing results that are very close to theoretical lower bound and outperform the conventional algorithms significantly.

关键词： vertical constraint graph electron charge configuration cellular automata fan-out tolerance duplication spatial distribution chemical molecules cycle breaker binary information circuit layout graph theory quantum computing quantum dots QCA circuit layout routing algorithms wire crossing minimisation logic design node duplication network routing quantum-dot cellular automata circuits QCA circuit manufacturability K-layered bipartite graphs

来源：评论

学校读者我要写书评

暂无评论

Variability-tolerant routing algorithms for Networks-on-Chip

引用

MICROPROCESSORS AND MICROSYSTEMS 2014年第8期38卷 1037-1045页

作者： Gawish, Eman Kamel E-Kharashi, M. Watheq Abu-Elyazeed, M. F. Cairo Univ Dept Elect & Elect Commun Engn Giza 12613 Egypt Ain Shams Univ Dept Comp & Syst Engn Cairo 11517 Egypt

This paper proposes variability-tolerant routing algorithms for mesh-based Networks-on-Chip (NoC). Different NoC routing algorithms are modified, from variability perspective, to route flits through links with lower failure probability. The algorithms considered in this study are XY, West-First, Negative-First, and Odd Even routing algorithms. To evaluate our variability-tolerant routing algorithms, a cycle-accurate simulator, NoCTweak, is used to measure how tolerant the resultant NoCs are against process variations. Results reflect the efficiency of our routing algorithms to overcome the process variation problems in modern fabrication technologies. For example, variability-tolerant West-First routing algorithm achieves up to 56% reduction in NoC overall failure rate. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Networks-on-Chip (NoC) Process variations routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：