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

35th SBC/SBMicro/IEEE/ACM Symposium on Integrated Circuits and Systems Design (SBCCI)

作者： Rodriguez, Hugo Tarrillo, Jimmy Univ Ingn & Tecnol Dept Elect Engn Lima Peru

ISBN: (数字)9781665481281

ISBN: (纸本)9781665481281

This work proposes a low energy forwarding routing algorithm for Wireless Sensor Networks (WSN). The proposed algorithm is based on the Minimum Cost Forwarding algorithm (MCFA) and utilizes a cost function in order to determine the best transmission routes with the lowest energy consumption. The proposed cost function is calculated considering the link quality between nodes and the transmission cost of the neighboring nodes. The link quality is estimated in a bidirectional way, which means it considers reception quality and transmission quality, and is power aware. For the reception quality WMEWMA is used, and for the transmission quality the power of the transceiver and the number of transmission attempts are considered. The performance of the proposed algorithm is tested in three scenarios and compared with the performance in the same scenarios of MCFA as routing algorithm with WMEWMA as cost function. For the purpose of testing, physical nodes were designed and built using ATmega328P microprocessor and nRF24L01 transceiver.

关键词： Wireless Sensor Networks routing algorithm Cost Function MCFA WMEWMA ATmega328P nRF24L01

来源：评论

学校读者我要写书评

暂无评论

A Power-Aware routing algorithm in Fat-tree Date Center Networks 20

A Power-Aware Routing Algorithm in Fat-tree Date Center Netw...

引用

IEEE 20th International Conference on High Performance Switching and routing (HPSR)

作者： Zhang, Xiaoting Hu, Bing Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou Peoples R China

ISBN: (纸本)9781728116860

Power consumption has become a key issue during the last few years and that of Internet in particular, is not negligible. With the advent of cloud computing and the exponential growth of traffic with it, power consumption has become an increasing concern for data centers. While power-aware algorithms have been investigated quite well in the wireless context, their developments in wire-line networks, especially in traffic-intensive data centers remain to be explored. In this paper, we propose a novel power-aware flow routing algorithm on the premise of performance for fat-tree data center topology and call it GreenFlow. With a maximum link utilization threshold, we route flows as centrally as possible and turn off switches without traffic flowing through them. Moreover, we take load balancing into consideration when rerouting flows on the open devices and their corresponding available paths. Verified by simulation results, our algorithm performs well in typical traffic patterns including uniform traffic, mice-elephant traffic and hotspot traffic. Earning about 20%similar to 58% power reduction when the load is below 0.45, the performance of GreenFlow is still comparable to that of the current best-performing routing algorithms, such as CONGA and LetFlow.

关键词： power-aware routing algorithm fat-tree data center

来源：评论

学校读者我要写书评

暂无评论

New routing algorithm for Hex-Cell Network

引用

INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING 2015年第2期8卷 295-306页

作者： Mohammad, Qatawneh Khattab, Hebatallah Univ Jordan King Abdullah II Sch Informat Technol Dept Comp Sci Amman Jordan

Hex-Cell network is one of modern interconnection networks in which the nodes are connected with each other in hexagonal topology. This topology gives its network an attractive characteristic represented by expandability due toits recursive structure. In this paper a new routing algorithm for Hex-Cell network is developed depending on new addressing mode. According to this mode, each node in the Hex-Cell is identified by its level and the node number in that level. Consequently, there is no need to readdress the nodes when extra level or levels are added to the topology. Several experiments were conducted to evaluate the proposed algorithm and compare it with other routing algorithms. The results showed the superiority of the new routing algorithm over the other routing algorithms for Hex-Cell in terms of execution time.

关键词： Hex-Cell network addressing mode routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Quadrant Partitioning Adaptive routing algorithm for Irregular Reduced Vertical Link Density Topology 3-Dimensional Network-on-Chips

Dynamic Quadrant Partitioning Adaptive Routing Algorithm for...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Ying, Haoyuan Hofmann, Klaus Hollstein, Thomas Tech Univ Darmstadt Integrated Elect Syst Lab Darmstadt Germany Tallinn Univ Technol EE-19086 Tallinn Estonia

ISBN: (纸本)9781479953134

3-Dimensional Networks-on-Chips (3D NoCs) are proposed as the next generation interconnect infrastructure for multi/many core embedded systems due to the high performance characteristics and scalability. However the heat and thermal issues in 3D NoCs are critical. Reducing the vertical links between dies becomes can be one of the proper solutions, but the 3D NoC system performance can be harmed due to the less number of possible vertical links. In order to find the best trade-off point between the vertical links reduction and 3D NoC performance, in this paper, we demonstrate a dynamic quadrant partitioning (DQP) adaptive routing algorithm for 3D NoCs with irregular reduced vertical link density topologies, which can improve the system performance (latency max. 10.9% and energy max. 24.1%) in comparison to deterministic routing algorithm with the same vertical link number configurations. Also our DQP routing algorithm can maintain the system performance in comparison to full vertical link connection running dimension-order deterministic routing algorithm (ZXY) by reducing 40% vertical links number. The comparison results are demonstrated with different benchmark applications and random generated task graphs.

关键词： 3D NoC routing algorithm Adaptivity Irregular Topology

来源：评论

学校读者我要写书评

暂无评论

A Security-Enhanced routing algorithm with Path Randomization

A Security-Enhanced Routing Algorithm with Path Randomizatio...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Pagan, Mario Hession, Audrey Yuan, Shengli Univ Houston Downtown Dept Comp Sci & Engn Technol Res Experience Undergrad Houston TX 77002 USA

ISBN: (纸本)9781479969593

Modern society is becoming increasingly dependent on various communication networks such as the Internet and the sensor networks. These networks need strong security measures to keep the traffic secure. If the security fails, many aspects of the society may suffer. In this paper, we address the network security challenge by focusing on one integral part of the network functionality: routing. Using Open Shortest Path First (OSPF) as our Internal Gateway Protocol (IGP), we aim to create a randomization process in which the packets will be sent through less predictable paths. By using this process we expect to increase the difficulty for a hacker to eavesdrop traffic hence improve network security.

关键词： Network security routing algorithm OSPF path randomization

来源：评论

学校读者我要写书评

暂无评论

A Hotspot-Pattern-Aware routing algorithm for Networks-on-Chip 13

A Hotspot-Pattern-Aware Routing Algorithm for Networks-on-Ch...

引用

IEEE 13th International Symposium on Embedded Multicore/Many-Core Systems-on-Chip (MCSoC)

作者： Luo, Yaoying Meyer, Michael Conrad Jiang, Xin Watanabe, Takahiro Waseda Univ GS Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan Kitakyushu Coll Natl Inst Technol Kitakyushu Fukuoka 8020985 Japan

ISBN: (纸本)9781728148823

Network-on-Chip (NoC) is widely accepted as an advanced on-chip system capable of replacing the traditional bus structure. NoC is promising as a solution for future many-core chip processors with better scalability and flexibility. Many routing algorithms have been proposed to improve the performance of NoCs. Some routing algorithms only have superiority under a specific traffic pattern, but they can have poor performance under other traffic patterns. Compared to uniform traffic, some complex hotspot patterns are closer to reality. Traffic-aware routing algorithms are designed to solve this problem. These traffic-aware routing algorithms commonly utilize virtual channels (VC) or routing tables to predict future traffic distribution, which will have large power and hardware overheads that cannot be ignored. To solve these problems, a VC-free traffic-pattern-aware routing algorithm based on West-first routing and North-last routing is proposed in this paper. This algorithm contains a hotspot node and hotspot pattern detecting mechanism, which were designed to improve the performance of NoCs under different traffic patterns. A hotspot information block which has a small cost is connected to each router to deal with the hotspot information and detect the hotspot patterns. The simulation results show that the proposed routing algorithm combines the advantages of the two existing routing algorithms and has better performance when considering different traffic patterns.

关键词： Networks-on-Chip traffic pattern routing algorithm hotspot detection

来源：评论

学校读者我要写书评

暂无评论

A Novel Heuristic routing algorithm for Peer-to -Peer Network

A Novel Heuristic Routing Algorithm for Peer-to -Peer Networ...

引用

International Conference on Smart Materials and Intelligent Systems

作者： Ren Yanhua Shenyang Ligong Univ Sch Econ & Management Shenyang Peoples R China

ISBN: (纸本)9780878492237

To improve the efficiency and effectiveness traditional algorithm which still has some shortcomings, this paper combines with the advantages of genetic algorithm, brings forward a routing algorithm based on novel heuristic genetic algorithm (NHGA). The simulation results show that this algorithm overcomes the shortcomings of genetic algorithm. From the analysis and experiment result, it is concluded that NHGA was exploited to achieve the goal of improving the routing performance, and is superior to genetic algorithm simultaneously.

关键词： Peer-to-Peer routing algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Double Cluster Head Based Wireless Sensor Network routing algorithm 8

A Double Cluster Head Based Wireless Sensor Network Routing ...

引用

8th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Huang, Jie HezhouUniv Coll Informat & Commun Engn Hezhou Guangxi Provinc Peoples R China

ISBN: (纸本)9781538604977

A double cluster head based wireless sensor network routing algorithm is proposed aiming at the premature death of the cluster head due to very fast energy consumption and the unbalanced energy consumption of nodes. Firstly, the master cluster heads and the member nodes of the cluster are determined based on the LEACH algorithm. Secondly, the vice cluster head is selected from cluster member nodes according to energy consumed by all the member nodes to complete a process of data transmission, collection and fusion based on the principle of minimum energy consumption. Any member node in the cluster transmits the data to the cluster head near to it. Both the master cluster head and the vice cluster head collect and integrate the data, which effectively reduces and balances the energy consumption of nodes. Based on the simulation results, compared with the LEACH algorithm, the algorithm proposed in this article significantly delays the death time of the first node in the wireless sensor network, increasing the life cycle of the network by about 75%.

关键词： Double cluster head Wireless sensor network routing algorithm Vice cluster head Data fusion

来源：评论

学校读者我要写书评

暂无评论

An Emergency Event Driven routing algorithm for Bi-directional Highway in Vehicular Ad Hoc Networks 1st

An Emergency Event Driven Routing Algorithm for Bi-direction...

引用

1st International Conference on Machine Learning and Intelligent Communications (MLICOM)

作者： Yang, Yajie Li, Demin Zhang, Guanglin Guo, Chang Jin, Saifei Donghua Univ Coll Informat Sci & Technol Shanghai 201620 Peoples R China Donghua Univ Minist Educ Engn Res Ctr Digitized Text & Apparel Technol Shanghai 201620 Peoples R China

ISBN: (纸本)9783319527307;9783319527291

Vehicular Ad Hoc Networks (VANETs) play a significant role in preventing traffic accidents on the highway. But it is a challenge to reduce the messages transmission delay under emergency condition. In this paper, an emergency event driven routing algorithm for bi-directional highway is proposed. Each vehicle maintains a real-time special neighbor nodes set which includes the next-hop vehicle and vehicle ID in three different directions. In particular, when there is no vehicle ahead or behind the accident vehicles we use the vehicles from reverse direction to reduce the intermittent link. And the emergency events of vehicles are divided into two types, according to the different influence of events on vehicles ahead and behind. And different emergency events launch different transmission algorithms. This ensures that the emergency messages (EMs) can transmit to the vehicles affected much more by the emergency events. Furthermore, we derive the transmission delay formula based on the proposed algorithm. Finally, the algorithm is verified by the simulation of the transmission delay formula. The results show that the proposed emergency event driven routing algorithm can reduce the transmission delay effectively.

关键词： Vehicle Ad Hoc Networks Emergency messages Event-driven routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The routing algorithm of Link-disjoint Paths based on Ant Colony System in Ad Hoc Networks

The Routing Algorithm of Link-disjoint Paths based on Ant Co...

引用

2nd IEEE International Conference on Advanced Computer Control

作者： Wang, Zhenchao Wang, Jing Wang, Yijin HeBei Univ Coll Elect & Informat Engn Baoding Peoples R China

ISBN: (纸本)9781424458479

In order to reduce the congestion of Ad Hoc network and increase the speed of routing searching, the link-disjoint paths algorithm based on ant colony optimization is proposed in this paper. The new algorithm introduces the intelligence and positive feedback of ant algorithm to link-disjoint paths algorithm to improve the probability of path optimization, sets the age domain of ant to reduce immersion, and lets the ants search routing parallelly to increase the speed. Besides, in order to reduce the occupancy of network resources, only the ants which carry the final routing data are allowed to return to the source node. The simulation results show that the new algorithm is effective and superior to the original link-disjoint paths algorithm.

关键词： the ant colony algorithm Ad Hoc network link-disjoint paths routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：