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

International Conference on Intelligent Computing, Automation and Systems (ICICAS)

作者： Zhiqiang Zou Xiangyu Lin Jian Sun Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing

ISBN: (数字)9781728161068

ISBN: (纸本)9781728161075

Underwater acoustic sensor networks (UASNs) have attracted much attention in both the academic and industrial fields. routing design of a UASN is an important part of the research, yet routing algorithms with low energy consumption and high data delivery ratios are not established completely. This paper proposed the Cluster-Based Adaptive routing Algorithm (CBAR) to fulfill the demands of large-scale underwater sensor networks. It optimized the network architecture by introducing the concept of a cluster in cellular wireless communication. Inspired by Focus Beam routing and Hop-By-Hop Dynamic Addressing routing protocol, the CBAR algorithm is designed to achieve better performance in large-scale UASNs. In CBAR, the format of transmitting data packets is simplified to suit the clustered network architecture and two adaptive methods are included: dynamic routing updates to adapt to the characteristics of the underwater environment, and power control to reduce energy consumption in the routing process. The result of simulation shows that the CBAR performs better than Focus Beam routing and Distributed Underwater Clustering Scheme in terms of energy consumption and data delivery ratio, because CBAR can significantly reduce the energy consumption of the network and improve the life cycle of nodes with an optimal data delivery ratio.

关键词： cellular radio routing protocols telecommunication power management underwater acoustic communication wireless sensor networks routing protocols underwater acoustic communication Wireless sensor networks energy consumption routing algorithms cellular radio NETWORK STRUCTURE acoustic transducers Underwater Simulation results Wet underwater environment data packets Dynamic routing

来源：评论

学校读者我要写书评

暂无评论

Capsule networks need an improved routing algorithm

arXiv

引用

arXiv 2019年

作者： Paik, Inyoung Kwak, Taeyeong Kim, Injung Deep Bio Inc. Seoul Korea Republic of Handong Global University Pohang Korea Republic of

In capsule networks, the routing algorithm connects capsules in consecutive layers, enabling the upper-level capsules to learn higher-level concepts by combining the concepts of the lower-level capsules. Capsule networks are known to have a few advantages over conventional neural networks, including robustness to 3D viewpoint changes and generalization capability. However, some studies have reported negative experimental results. Nevertheless, the reason for this phenomenon has not been analyzed yet. We empirically analyzed the effect of five different routing algorithms. The experimental results show that the routing algorithms do not behave as expected and often produce results that are worse than simple baseline algorithms that assign the connection strengths uniformly or randomly. We also show that, in most cases, the routing algorithms do not change the classification result but polarize the link strengths, and the polarization can be extreme when they continue to repeat without stopping. In order to realize the true potential of the capsule network, it is essential to develop an improved routing algorithm. Copyright © 2019, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Local routing in sparse and lightweight geometric graphs

arXiv

引用

arXiv 2019年

作者： Ashvinkumar, Vikrant Gudmundsson, Joachim Levcopoulos, Christos Nilsson, Bengt J. Van Renssen, André University of Sydney Australia Lund University Sweden Malmö University Sweden

Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no O(1)-competitive online routing algorithm exists. A notable exception is the Delaunay triangulation for which Bose and Morin [11] showed that there exists an online routing algorithm that is O(1)-competitive. However, a Delaunay triangulation can have Ω(n) vertex degree and a total weight that is a linear factor greater than the weight of a minimum spanning tree. We show a simple construction, given a set V of n points in the Euclidean plane, of a planar geometric graph on V that has small weight (within a constant factor of the weight of a minimum spanning tree on V ), constant degree, and that admits a local routing strategy that is O(1)-competitive. Moreover, the technique used to bound the weight works generally for any planar geometric graph whilst preserving the admission of an O(1)-competitive routing strategy. Copyright © 2019, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks 1

An energy efficient multiple mobile sinks based routing algo...

引用

1st International Conference on Functional Materials and Chemical Engineering (ICFMCE)

作者： Zhong, Peijun Ruan, Feng ZTEsoft Technol Co Ltd Nanjing 210012 Jiangsu Peoples R China Nanjing Univ Informat Sci & Technol Sch Informat & Control Nanjing 210044 Jiangsu Peoples R China

With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

NoC-based DNN Accelerator: A Future Design Paradigm 19

NoC-based DNN Accelerator: A Future Design Paradigm

引用

13th IEEE/ACM International Symposium on Networks-on-Chip (NOCS)

作者： Chen, Kun-Chih (Jimmy) Ebrahimi, Masoumeh Wang, Ting-Yi Yang, Yuch-Chi Natl Sun Yat Sen Univ Kaohsiung Taiwan KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9781450367004

Deep Neural Networks (DNN) have shown significant advantages in many domains such as pattern recognition, prediction, and control optimization. The edge computing demand in the Internet-of-Things era has motivated many kinds of computing platforms to accelerate the DNN operations. The most common platforms are CPU, GPU, ASIC, and FPGA. However, these platforms suffer from low performance (i.e., CPU and GPU), large power consumption (i.e., CPU, GPU, ASIC, and FPGA), or low computational flexibility at runtime (i.e., FPGA and ASIC). In this paper, we suggest the NoC-based DNN platform as a new accelerator design paradigm. The NoC-based designs can reduce the off-chip memory accesses through a flexible interconnect that facilitates data exchange between processing elements on the chip. We first comprehensively investigate conventional platforms and methodologies used in DNN computing. Then we study and analyze different design parameters to implement the NoC-based DNN accelerator. The presented accelerator is based on mesh topology, neuron clustering, random mapping, and XY-routing. The experimental results on LeNet, MobileNet, and VGG-16 models show the benefits of the NoC-based DNN accelerator in reducing off-chip memory accesses and improving runtime computational flexibility.

关键词： Network-on-Chip (NoC) Deep Neural Network (DNN) CNN RNN Accelerators routing algorithms Mapping algorithms Neural Network Simulator

来源：评论

学校读者我要写书评

暂无评论

Parallelization of a gossip algorithm for vehicle routing problems 14

Parallelization of a gossip algorithm for vehicle routing pr...

引用

14th IEEE International Conference on Automation Science and Engineering (IEEE CASE)

作者： Riazi, Sarmad Bengtsson, Kristofer Lennartson, Bengt Chalmers Univ Technol Signals & Syst Dept Automat Res Grp Gothenburg Sweden

ISBN: (纸本)9781538635933

A large body of research on the vehicle routing problem and its variants focuses on developing efficient solution procedures. Yet, not so many research articles have addressed parallelism in their proposed algorithms. Parallelized optimization algorithms can yield better solution quality in less amount of time. The main contribution of this paper is parallelization of a distributed algorithm based on the gossip protocol for vehicle routing problems VRP. The proposed algorithm can be applied to different variants of VRPs. While the resulting speed-ups are promising, the required effort for implementation of the parallelism is minimal, which makes the algorithm even more appealing.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous routing: A Methodology for PPA Tradeoff in Network-on-Chips 3

Heterogeneous Routing: A Methodology for PPA Tradeoff in Net...

引用

3rd IEEE International Conference on Integrated Circuits and Microsystems (ICICM)

作者： Li, Chenfeng Wang, Xuexiang Cai, Lei Gu, Zihan Southeast Univ Res Ctr Naional ASIC Syst Engn Technol Sch Elect Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538683118

This paper proposes a routing algorithm design methodology based on real network traffic analysis. The method aims at large-scaled network on chip in which load differs among different areas or routing nodes. By applying different routing algorithms on different nodes, the area and/or power consumption can be saved only at the cost of minor performance loss. Experimental results show that by replacing routing nodes using NoP routing algorithm with nodes using XY routing algorithm, up to 10% of routing nodes can be simplified into much less power/area costing nodes, saving at least 2% of area overhead, only at the cost of 5% of performance loss.

关键词： network-on-chip routing algorithms traffic model

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Scalable routing Protocol Based on ACO for WSNs

Energy-Efficient Scalable Routing Protocol Based on ACO for ...

引用

International Conference on Mechatronics (ICOM)

作者： Afsah Sharmin F. Anwar S. M. A. Motakabber International Islamic University Malaysia Kuala Lumpur Malaysia

ISBN: (纸本)9781728129723

Efficient routing is an essential requirement for the design of wireless sensor network (WSN) protocols to overcome inherent challenges and to meet hardware and resource constraints. An energy-efficient scalable routing algorithm based on ant colony optimization (ACO) for WSNs is presented here to find the optimal path of data transmission while consuming less energy leading to increase of network's lifetime. Most of the existing ACO based routing algorithms are designed on the assumption that the sensor nodes and the sinks are stationary and do not consider the overhead of mobility and the current node energy is not considered, which will prompt sudden passing of certain nodes. To overcome the existing problem of accommodating node mobility, reducing initialization time for ant based routing algorithm and to maintain scalability in WSN for time critical applications, an ACO based WSN routing algorithm has been proposed and analyzed in this paper. The proposed algorithm has been simulated and verified utilizing MATLAB. The evaluation results demonstrate that it has reduced energy consumption, almost 50% less consumed energy even with the increasing number of nodes, compared with the traditional ACO and an existing ant-based routing algorithm. Moreover, it increases the nodes' lifetime and lifetime of the network.

关键词： routing algorithms WSN ACO IoT Network lifetime Energy consumption routing algorithms energy consumption Scalability Ganglia node energy

来源：评论

学校读者我要写书评

暂无评论

Expected complexity of routing in θ6 and half-θ6 graphs

arXiv

引用

arXiv 2019年

作者： Bose, Prosenjit De Carufel, Jean-Lou Devillers, Olivier Carleton University Ottawa Canada University of Ottawa Ottawa Canada Universite de Lorraine CNRS Inria LORIA NancyF-54000 France

We study online routing algorithms on the Θ6-graph and the half-Θ6-graph (which is equivalent to a variant of the Delaunay triangulation). Given a source vertex s and a target vertex t in the Θ6-graph (resp. half-Θ6-graph), there exists a deterministic online routing algorithm that finds a path from s to t whose length is at most 2kstk (resp. 2:89kstk) which is optimal in the worst case [Bose et al., siam J. on Computing, 44(6)]. We propose alternative, slightly simpler routing algorithms that are optimal in the worst case and for which we provide an analysis of the average routing ratio for the Θ6-graph and half-Θ6-graph defined on a Poisson point process. For the Θ6-graph, our online routing algorithm has an expected routing ratio of 1:161 (when s and t are random) and a maximum expected routing ratio of 1:22 (maximum for fixed s and t where all other points are random), much better than the worst-case routing ratio of 2. For the half-Θ6-graph, our memoryless online routing algorithm has an expected routing ratio of 1:43 and a maximum expected routing ratio of 1:58. Our online routing algorithm that uses a constant amount of additional memory has an expected routing ratio of 1:34 and a maximum expected routing ratio of 1:40. The additional memory is only used to remember the coordinates of the starting point of the route. Both of these algorithms have an expected routing ratio that is much better than their worst-case routing ratio of 2:89. Copyright © 2019, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Networks routing Algorithm Based on the Uncertain Social Relationship 22

Opportunistic Networks Routing Algorithm Based on the Uncert...

引用

22nd IEEE International Conference on Computer Supported Cooperative Work in Design (CSCWD)

作者： Xu, Gang Xu, Zhendong He, Yuchen Zhou, Jiantao Guo, Ying Guo, Xiaodong Inner Mongolia Univ Coll Comp Sci Inner Mongolia Engn Lab Cloud Comp & Serv Softwar Hohhot Peoples R China Bur Transportat Inner Mongolia Autonomous Reg Hohhot Inner Mongolia Peoples R China

ISBN: (纸本)9781538614822

routing protocol based on the social relationship in opportunistic networks can gain better performance in the opportunistic network with the social attribute. Several algorithms are proposed in literature for static social relationship in opportunistic networks, however these algorithms based on static social relationship cannot be used for the routing purpose in opportunistic networks as the social relationship in opportunistic networks are dynamic in nature. This paper investigates the problem of opportunistic network routing algorithms based on the dynamic social relationship. A new model of the dynamic social relationship in opportunistic networks is presented, and a new prediction method is introduced to predict the movement pattern and the encounter time. An optimized routing protocol in opportunistic network based on the dynamic social relationship is developed to rout messages. Our experiment results show that the proposed protocol is very efficient in the opportunistic networks with the dynamic social relationship, and the routing protocol in opportunistic is very suitable for the real application.

关键词： Opportunistic network dynamic social relationship routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：