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

IEEE 27th International Conference on Advanced Information Networking and Applications Workshops (WAINA)

作者： Montanana, J. M. de Andres, D. Tirado, F. Univ Complutense Madrid DACYA Madrid Spain Univ Politecn Valencia Inst Aplicaciones TIC Avanzadas ITACA Valencia Spain

ISBN: (纸本)9780769549521;9781467362399

Multi-Processor Systems-on-Chip (MPSoCs) are increasingly popular in embedded systems, but also on high performance systems. In such systems, the data bandwidth requirements keeps increasing as the number of processing elements increases. Therefore, a Network-on-Chip (NoCs) communication architecture use to be preferred than a communication based on shared buses, because it provides higher communication performance. The probability of failure increases in this systems, due to these great advances in integration scales and the increasing number of components on chip. Therefore Fault Tolerance will become a key aspect on designing the near future VLSI SoC, and especially on their interconnection Network on Chip (NoC). This paper focuses on describe the particular aspects of NoCs, and the proposed fault-tolerant strategies for NoCs.

关键词： component Network on chips fault tolerance Multi-Processor Systems-on-Chip in order delivery routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Gauss-Seidel Correction Algorithm: A Macroscopic Model-Derived routing Algorithm for WSNs

引用

ACM TRANSACTIONS ON SENSOR NETWORKS 2013年第1期10卷 9-9页

作者： Ko, Ren-Song Lin, Po-Liang Chiang, Pei-Yu Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Minxiong Chiayi County Taiwan

A Gauss-Seidel correction (GSC) routing algorithm for wireless sensor networks is presented in which packets are transmitted with additional information which can be exchanged among nodes to correct the current routing paths and achieve load balancing. The problem considered here is single-class routing to one/multiple sinks with lifetime maximization as the objective. The formulation to correct the routing paths is not heuristic and takes its theoretical basis from a macroscopic model, that is, based on a set of partial differential equations iteratively solved by the Gauss-Seidel method. We then theoretically investigate the convergence of GSC. Furthermore, an initial value estimation algorithm is presented to alleviate the long-path problem during the delivery of the first several packets, thus accelerating the convergence of GSC. Simulation results show that GSC effectively achieves load balancing, particularly for regions of interest with holes.

关键词： algorithms Design Performance Gauss-Seidel method load balancing partial differential equations routing algorithms wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Connection-based Router for FPGAs

A Connection-based Router for FPGAs

引用

12th International Conference on Field-Programmable Technology (FPT)

作者： Vansteenkiste, Elias Bruneel, Karel Stroobandt, Dirk Univ Ghent Dept Elect & Informat Syst Comp Syst Lab Hardware & Embedded Syst Team B-9000 Ghent Belgium

ISBN: (纸本)9781479921980;9781479921997

The FPGA's interconnection network not only requires the larger portion of the total silicon area in comparison to the logic available on the FPGA, it also contributes to the majority of the delay and power consumption. Therefore it is essential that routing algorithms are as efficient as possible. In this work the connection router is introduced. It is capable of partially ripping up and rerouting the routing trees of nets. To achieve this, the main congestion loop rips up and reroutes connections instead of nets, which allows the connection router to converge much faster to a solution. The connection router is compared with the VPR directed search router on the basis of VTR benchmarks on a modern commercial FPGA architecture. It is able to find routing solutions 4.4% faster for a relaxed routing problem and 84.3% faster for hard instances of the routing problem. And given the same amount of time as the VPR directed search, the connection router is able to find routing solutions with 5.8% less tracks per channel.

关键词： Field programmable gate arrays routing Problem Connections directed search routing algorithms Nets Network routing Power consumption

来源：评论

学校读者我要写书评

暂无评论

TOAR: transmission-aware opportunistic ad hoc routing protocol

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2013年第1期2013卷 1页

作者： Mazumdar, Arka Prokash Sairam, Ashok Singh Indian Inst Technol Patna Dept Comp Sci & Engn Patna 800013 Bihar India

Opportunistic routing (OR) protocols for ad hoc networks basically consist of selecting a few forwarders between the source and destination and prioritizing their transmission. The performance of OR protocols depends on how these two steps are performed. The aim was to reduce the number of transmissions to deliver packets to the destination. In this paper, we first present a mathematical model to compute the total number of packets including duplicate packets generated by OR protocols. We use the model to analyse well-known OR protocols and understand the reason behind their increase in number of transmissions. Next, we propose an OR scheme transmission-aware opportunistic ad hoc routing (TOAR) protocol, which attempts to minimize retransmissions. Our proposed OR protocol uses tree structures to select forwarders and prioritize them. The use of tree structures helps in identifying primary forwarders which carry packets farthest to the destination during each transmission round. TOAR also helps in choosing secondary forwarders which will transmit packets missed out by the forwarder. The optimized selection of forwarders results in significant reduction in retransmissions, a smaller forwarder list set, and improvement in goodput.

关键词： routing protocols (Computer network protocols) RESEARCH AD hoc networks (Computer networks) -- Research routing (Computer network management) DATA transmission systems -- Research routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An adaptive output selection function based on a fuzzy rule base system for Network on Chip

An adaptive output selection function based on a fuzzy rule ...

引用

16th Euromicro Conference on Digital System Design (DSD)

作者： Ascia, Giuseppe Palesi, Maurizio Catania, Vincenzo Univ Catania Catania Italy Kore Univ Enna Italy

ISBN: (纸本)9780769550749

In Network-on-chip design two of the most important performance indices are the average delay of packets and power dissipation. The first depends on the level of congestion of the communication system, the second is strongly influenced by the power dissipated by the links of a network-on-chip (NoC) which accounts for a significant fraction of the overall power dissipated by the on-chip communication fabric. Such fraction becomes more and more relevant as technology shrinks. The selection policy of the output port in the NOC router with adaptive routing function affects both the performance and power dissipation. In fact, generally a NOC with a lower average delay has a lower power dissipation on the links for transmission. The selection policies proposed in the literature have the object or the minimization of the average delay or in some cases the reduction of power dissipation. In this paper we propose a selection policy aimed at minimizing both the average delay and power consumption of the communication system of NoC based architectures. The proposed policy uses a cost function obtained using a Fuzzy Rule Base System (FRBS) with two inputs an one output. Inputs are the level of use of the buffers of the downstream routers, and the link power dissipation of the selected output. The output of FRBS is the cost function. The experimental results, obtained using a cycle accurate NoC simulator for different traffic scenarios, shows that the proposed selection policy outperforms other selection approaches both in terms of average delay and in terms on power dissipation and energy consumption.

关键词： Network on Chip routing algorithms Selection Strategy Fuzzy Systems

来源：评论

学校读者我要写书评

暂无评论

Experimental Validation of Dynamic Restoration in GMPLS-controlled Multi-layer Networks using PCE-based Global Concurrent Optimization

Experimental Validation of Dynamic Restoration in GMPLS-cont...

引用

Conference on Optical Fiber Communication (OFC)/National Fiber Optic Engineers Conference (NFOEC)

作者： Martinez, R. Castro, A. Casellas, R. Munoz, R. Velasco, L. Vilalta, R. Comellas, J. Ctr Tecnol Telecomunicac Catalunya Castelldefels 08860 Spain

An experimental validation of a PCE-based GCO architecture for dynamic restoration in GMPLS multi-layer networks is presented. This solution better addresses the concurrence of multiple connection requests favoring gr... 详细信息

ISBN: (纸本)9781557529626;9781479904570

关键词： Network topology Packet switching routing algorithms Switching Wavelength division multiplexing Networks, circuit-switched (060.4253) Networks, protection and restoration (060.4261)

来源：评论

学校读者我要写书评

暂无评论

Moving Target Oriented Opportunistic routing Algorithm in Vehicular Networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2013年第unknown期2013卷 1-10页

作者： Ding, Yu Wang, Wendong Cui, Yong Gong, Xiangyang Wang, Bai Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Beijing Univ Posts & Telecommun Sch Comp Sci Beijing 100876 Peoples R China

In vehicular networks, the multihop message delivery from information source to moving vehicles presents a challenging task due to many factors, including high mobility, frequent disconnection, and real-time requirement for applications. In this paper, we propose a moving target oriented opportunistic routing algorithm in vehicular networks for message delivery from information source to a moving target vehicle. In order to adapt the constantly changing topology of networks, the forwarding decisions are made locally by each intermediate vehicle based on the trajectory information of the target vehicle. The simulation and real trace experiment show that our design provides an efficient message delivery with a higher success ratio, shorter success time, and lower transmission overhead compared with other reference approaches.

关键词： routing algorithms VEHICULAR ad hoc networks (Computer networks) INTELLIGENT transportation systems WIRELESS localization COMPUTER science

来源：评论

学校读者我要写书评

暂无评论

A community-based message transmission algorithm for opportunistic networks

A community-based message transmission algorithm for opportu...

引用

2nd International Conference on Mechanical Engineering, Industrial Electronics and Informatization, MEIEI 2013

作者： Ren, Zhi Liu, Yan Wei Peng, Shuang Li, Ji Bi Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (纸本)9783037858905

In opportunistic networks, routing algorithms based on community division have some redundant forwarding in the process of message transmission. In this paper, we propose a community-based message transmission algorithm (CMTA). CMTA makes fully use of the nodes within communication overlapping areas to forward messages and optimizes forwarding determination mechanism to carry message nodes, then CMTA redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that CMTA outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, etc. © (2013) Trans Tech Publications, Switzerland.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

WN-LEACH: A weighted residual energy based cluster-heads selection algorithm for wireless sensor network

引用

2013 International Conference on Advances in Materials Science and Manufacturing Technology, AMSMT 2013

作者： Bao, Xi Rong Xie, Jia Hua Li, Shuang Long College of Information Science and Engineering Northeastern University Shenyang China

ISBN: (纸本)9783037857984

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm. © (2013) Trans Tech Publications, Switzerland.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards the benefit of multi-hop relaying in opportunistic networking

Towards the benefit of multi-hop relaying in opportunistic n...

引用

2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

作者： Jianbin, Jia Yingwen, Chen Ming, Xu Geming, Xia Xiaoqiang, Xiao School of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769550466

Hop count is an important parameter for routing strategies in wireless network. Particularly in the opportunistic networks, due to the intermittent connectivity between mobile nodes, it imposes great impact on the delivery performance in terms of delivery ratio and average latency. In the previous works, there are papers either claimed that two-hop is enough, or claimed that more hops increase the delivery delay, and also there is the attitude that more hops reduce more delivery delay. All of those conclusions are well justified under their specific assumptions and conditions, but the factors arousing such different attitudes towards multi-hop benefit have not be well investigated. In this paper, we establish a framework to analyze opportunistic multi-hop relaying benefit based the concept of Good Relay Ratio (GRR), and discuss the factors that impact max-benefit hop count in three typical multi-hop forms. Finally, we make a set of realistic trace-driven simulation to verify the analytical results. It is expected that the framework and result implications are meaningful to the routing strategy design in opportunistic networking. © 2013 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：