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

10th IEEE International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)

作者： Qian, Kai-Guo Kunming Univ Dept Phys Sci & Technol Kunming 650031 Peoples R China

ISBN: (纸本)9781479924455;9781479924448

The node energy consumption is not balanced inexisting clustering routing protocol of wireless sensor network (WSN). A clustering routing algorithm based on distance probability (CRABDP) is proposed to improve this problem. It is calculated probability selected into head according to the distance with sink and the residual energy of nodes. Cluster heads distribution near sink is more than its distribution far from the base station so as to constitute a heterogeneous hierarchynetwork to realize the energy equilibrium. Performance analysis and simulation experiments show thatthe new algorithm can better balanced energy consumption and improve the utilization rate of energy to prolong network life timecompared with the classical LEACH protocol.

关键词： Wireless sensor network distance cluster head selection probability routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Improving the Performance of a NoC-based CNN Accelerator with Gather Support 33

Improving the Performance of a NoC-based CNN Accelerator wit...

引用

33rd IEEE International System on Chip Conference (IEEE SOCC)

作者： Tiwari, Binayak Yang, Mei Wang, Xiaohang Jiang, Yingtao Muthukumar, Venkatesan Univ Nevada Dept Elect & Comp Engn Las Vegas NV 89154 USA South China Univ Technol Sch Software Engn Guangzhou Peoples R China

ISBN: (纸本)9781728187464

The increasing application of deep learning technology drives the need for an efficient parallel computing architecture for Convolutional Neural Networks (CNNs). A significant challenge faced when designing a many-core CNN accelerator is to handle the data movement between the processing elements. The CNN workload introduces many-to-one traffic in addition to one-to-one and one-to-many traffic. As the de-facto standard for on-chip communication, Network-on-Chip (NoC) can support various unicast and multicast traffic. For many-to-one traffic, repetitive unicast is employed which is not an efficient way. In this paper, we propose to use the gather packet on mesh-based NoCs employing output stationary systolic array in support of many-to-one traffic. The gather packet will collect the data from the intermediate nodes eventually leading to the destination efficiently. This method is evaluated using the traffic traces generated from the convolution layer of AlexNet and VGG-16 with improvement in the latency and power than the repetitive unicast method.

关键词： Network-on-Chip (NoC) Convolutional Neural Network (CNN) routing algorithm Gather Accelerator

来源：评论

学校读者我要写书评

暂无评论

Detouring Skip Graph: A Structured Overlay Utilizing Detour Routes 17

Detouring Skip Graph: A Structured Overlay Utilizing Detour ...

引用

IEEE 17th Annual Consumer Communications and Networking Conference (CCNC)

作者： Kaneko, Takeshi Banno, Ryohei Shudo, Kazuyuki Aoki, Yusuke Abe, Kota Teranishi, Yuuichi Tokyo Inst Technol Tokyo Japan Osaka City Univ Osaka Japan Natl Inst Informat & Commun Technol Tokyo Japan Osaka Univ Osaka Japan

ISBN: (纸本)9781728138930

Skip Graph, one of the structured overlays, provides a scalable network owing to the routing path lengths of O (log n), where n denotes the total number of nodes. However, there is a problem that most of the routing paths are quite longer than the shortest paths because each node in the network knows only its neighbors, rather than the global topology. In general, long routing paths lead to long delay times and low fault tolerance. Herein, we propose Detouring Skip Graph, which shortens the path lengths through the use of detour routes. It does not require construction of extra links or modification of its topology;thereby, it can succeed in shortening them while maintaining the advantages of Skip Graph. The evaluation experiments show that the average path length was shortened by approximately 20%-30% in comparison with Skip Graph.

关键词： Skip Graph structured overlay routing algorithm detour route

来源：评论

学校读者我要写书评

暂无评论

New approach of GA-PSO-based clustering and routing in wireless sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2020年第16期33卷 e4571-e4571页

作者： Anand, Veena Pandey, Sudhakar Natl Inst Technol Raipur GE Rd Raipur 492010 Chhattisgarh India

Wireless sensor networks (WSNs) not only have become an essential technology in the current scenario but also has been established as a core technology for many applications, like the Internet of Things (IoT). The drawback of limited energy resources in WSN creates the challenge of designing an energy-efficient network topology and routing path. As these devices are generally not attended for any maintenance, such as battery replacement or charging, these resources need to be intelligently used. The paper represents a methodology for enhancing the lifetime of a network by using a genetic algorithm-based clusteringand particle swarm optimization-based routing in WSN. The best cluster head (CH) that collects the data from the remaining nodes is selected using a genetic algorithm, which considers distance and energy parameters. Further, the particle swarm optimization algorithm depends on optimal routing paths that are chosen for all relay nodes to send data to the Base Station (BS). The proposed procedure shows that the relay node supports and facilitates communication among the sink and CH, which enhances energy efficiency. Finally, the quality of service (QoS) of the WSNs is improved, due to which the system would survive longer. The results of simulated experiments show that the proposed approach significantly increases the lifetime of WSN and that energy consumption is reduced when compared with the existing protocols.

关键词： clustering genetic algorithm network lifetime particle swarm optimization routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Improved routing Scheme based on Link Stability for VANET 14

A Improved Routing Scheme based on Link Stability for VANET

引用

14th IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Wang, Hui Cheng, Wei Lu, Xiaolin Qin, Haoyang Northwestern Polytech Univ Sch Elect & Informat Xian Peoples R China

ISBN: (纸本)9781538694909

VANET(vehicular ad hoc network) generally achieves long-distance data transmission through multi-hop forwarding. Due to the high-speed mobility, uneven distribution, and the behavior of the vehicle, the VANET network topology changes dynamically and the network is prone to breakage. How to choose the next hop node is the key to implement the routing method. Link stability is an important factor to measure the performance of VANET. In this paper, the Kalman filter based strategy is used to predict speed of nodes, and the routing algorithm based on fuzzy logic to predict link stability is improved. The simulation results show that compared with the traditional AODV, the proposed method has a great improvement in routing stability.

关键词： fuzzy logic mobility prediction Kalman filte link stability routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Partial Packet Forwarding to Improve Performance in Fully Adaptive routing for Cache-coherent NoCs 27

Partial Packet Forwarding to Improve Performance in Fully Ad...

引用

27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)

作者： Eltaras, Tamer Ahmed Fornaciari, William Zoni, Davide DET Politecn Torino Turin Italy DEIB Politecn Milano Milan Italy

ISBN: (纸本)9781728116440

In the contest of cache-coherent Networks-on-Chip (NoCs), fully adaptive routing algorithms guarantee maximum flexibility to implement power-performance, fault tolerant, thermal and Quality of Service (QoS) management policies. However, to get rid of deadlock at both protocol and network level, their implementation imposes a relevant resource increase. Moreover, their performance are inferior to the one of deterministic and partially adaptive schemes mainly due to the additional constraints imposed to the virtual channel (VC) re-use policy. This work proposes a novel flow control scheme to improve the performance of fully adaptive routing algorithms by allowing an aggressive reuse of VCs in presence of both long and short packets. Our proposal works by splitting long packets in multiple chunks and by reallocating the VCs to the chunks rather that to the entire packet. By carefully sizing each chunk to fit the available space in the reallocated, eventually not empty, VC, we are avoiding deadlocks while increasing the NoC utilization and performance. Experimental results show that our solution offers a 23.8% increase, on average, in the saturation point when compared to the best state of the art flow control scheme for fully adaptive routing algorithms. Moreover, our flow control scheme offers similar or better performance than the XY routing algorithm with the same number of resources, and we also ensure superior flexibility in the definition of the routing function.

关键词： Network-on-chip routing algorithm cache fully adaptive

来源：评论

学校读者我要写书评

暂无评论

routing in triple loop circulants: A case of networks-on-chip

引用

HELIYON 2020年第7期6卷 e04427页

作者： Romanov, Aleksandr Yu Starykh, Vladimir A. Natl Res Univ Higher Sch Econ 34 Tallinskaya Ulitsa Moscow 123458 Russia

In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible implementation using Table routing;algorithms created analytically based on an engineering approach with taking into account the structural features of triple loop circulant graphs (Advanced clockwise, Direction selection);an algorithm created on the basis of a mathematical analysis of graph structure and solving the problem of enumerating coefficients at generators (Coefficients finding algorithm). Efficiency, maximum graph paths, occupied memory resources, and calculation time of the algorithms developed are estimated. Comparison of various variants of the algorithms is made and recommendations on their application for the development of networks-on-chip with triple loop circulant topologies are given. It is shown that Advanced clockwise and Direction selection algorithms guarantee that the packet reaches the destination node, but often in more steps than the shortest path. Nevertheless, they themselves are simpler and require less hardware resources than other algorithms. In turn, Coefficients finding algorithm has great computational complexity, but is optimal and, in comparison with Dijkstra's algorithm, is much simpler for RTL implementation which reduces network-on-chip routers resources cost.

关键词： Electrical engineering Topology Computer architecture algorithm design Very-large-scale integration Computer-aided engineering Network-on-chip Dijkstra's algorithm Triple loop circulant routing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Probability Prediction routing Scheme in Urban DTNs 25

An Adaptive Probability Prediction Routing Scheme in Urban D...

引用

25th IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS)

作者： Wen, Zhan Tang, Xianghong Huang, Xiaoyan Fu, Tingwei Liu, Jianwei Li, Wenzao Chengdu Univ Informat Technol Sch Commun Engn Chengdu Peoples R China AT&T Inc Mobile Packet Core Dept Dallas TX 75202 USA Chengdu Univ Informat Technol Sch Control Engn Chengdu Peoples R China Chengdu Xingshu Reconnaissance Infrastruct Engn C Date Ctr Chengdu Peoples R China Simon Fraser Univ Sch Comp Sci Burnaby BC Canada

ISBN: (纸本)9781728125831

Most existing DTN routing algorithms can't show efficient network performance. Prophet is a routing protocol widely used for DTNs. The delivery predictability of active nodes will obviously reduce with the same speed as less active nodes. In this paper, we propose an Adaptive Probability Prediction routing (APPR) approach, which can dynamically adjust the aging factor based on the active degree of nodes. Leveraging the APPR approach, the delivery predictability of each node can be reduced in different speed if the node does not encounter the other node. Furthermore, when two nodes encounter, the forward decision depends on the distance between each node to the destination node, if the delivery predictabilities of encountered nodes are similar. Compared with the traditional Prophet, simulation results demonstrate the proposed APPR approach can significantly improve successful delivery ratio, reduce overhead ratio and the average latency.

关键词： probability prediction adaptive probability routing algorithm delay tolerant network

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: Makespan of routing and security in Cross Centric Intrusion Detection System (CCIDS) over black hole attacks and rushing attacks in MANET (Retracted article. See DEC, 2024)

引用

INTERNATIONAL JOURNAL OF INTELLIGENT UNMANNED SYSTEMS 2019年第4期7卷 162-176页

作者： Rajendran, N. Jawahar, P. K. Priyadarshini, R. BS Abdur Rahman Crescent Inst Sci & Technol Dept Informat Technol Chennai Tamil Nadu India BS Abdur Rahman Crescent Inst Sci & Technol Dept Elect & Instrumentat Engn Chennai Tamil Nadu India

Purpose The purpose of this paper is to apply security policies over the mobile ad hoc networks. A mobile ad hoc network refers to infrastructure-less, persistently self-designing systems;likewise, there is a noteworthy innovation that supplies virtual equipment and programming assets according to the requirement of mobile ad hoc network. Design/methodology/approach It faces different execution and effectiveness-based difficulties. The major challenge is the compromise of performance because of unavailable resources with respect to the MANET. In order to increase the MANET environment's performance, various techniques are employed for routing and security purpose. An efficient security module requires a quality-of-service (QoS)-based security policy. It performs the task of routing and of the mobile nodes, and it also reduces the routing cost by finding the most trusted node. Findings The experimental results specify that QoS-based security policy effectively minimizes the cost, response time as well as the mobile makespan (routing cost and response time) of an application with respect to other existing approaches. Social implications When the concept is applied to practical applications. Quality of Service introduced in the proposed research reduces the cost of routing and improves the throughput. Originality/value The proposed calculation is tested by NS2 simulator and the outcomes showed that the execution of the calculation is superior to other conventional algorithms.

关键词： routing Security policy Cross Centric Intrusion Detection System Mobile makes span routing algorithm Self-configuring networks

来源：评论

学校读者我要写书评

暂无评论

Study on Logic-based routing for 3D NOCs 12

Study on Logic-based Routing for 3D NOCs

引用

12th IEEE/ACM International Workshop on Network on Chip Architectures (NoCArc)

作者： Tang, Minghua Palesi, Maurizio GuangDong Univ Finance Dept Internet Finance & Engn Informat Guangzhou Guangdong Peoples R China Univ Catania Dept Elect Elect & Comp Engn Catania Italy

ISBN: (纸本)9781450369497

For mesh-based Network-on-Chip (NoC), in order for a routing algorithm to be implemented by logic-based circuit, the prohibited turns should be repetitively distributed. The 3D mesh network has a huge searching space for routing algorithms. Due to its complexity, there is lack of research to detect its design space. In this paper, the design space for logic-based routing algorithms for 3D mesh network is systematically exploited. After detecting the design space, new logic-based routing algorithm that outperforms the state-of-the-art routing algorithms is proposed. For the first step, all routing algorithms that have repetitively distributed turns for 2D mesh network are constructed. For the second step, the routing algorithms for the three planes of the 3D mesh network are constructed respectively. The Z plane of the 3D mesh network is constructed by placing a 2D network routing on it. The X and Y planes of the 3D mesh network are constructed by rotating the Z plane up or down, respectively. Finally, the constructed routing algorithms are evaluated under 44 traffic scenarios. The best routing algorithm is termed as 3D repetitive turn model (3DRTM). Simulation results show that it has better performance than the prior proposed routing algorithm under most synthetic and real traffic scenarios.

关键词： Network-on-Chip routing algorithm logic-based routing table-based routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：