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

Improved PSO clustering routing algorithm for WSN

Computer Modelling and New Technologies 2014年第11期18卷 234-241页

作者： Tan, Minsheng Zhou, Huan Li, Yangwei Liu, Jianxue School of Computer Science and Technology University of South China Hengyang Hunan China

For cluster head selection randomness of clustering algorithm, and PSOC algorithm were not considered the distance from cluster head to base station, an improved particle swarm optimization (I-PSOC) routing algorithm was brought out. The improved algorithm particle swarm fitness function was improved by considering the node residual energy, nodes' distance and the distance between nodes and base station. At the same time, the optimal nodes were selected as the cluster head and the cluster head has transmitted the data to base station in a single or more jumps through searching right path in the improved algorithm. The simulation results show that th e nodes energy consumption of network was reduced significantly and the network life cycle was extended.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Wireless NoCs in Presence of Irregular Network routing Strategies 14

Performance Evaluation of Wireless NoCs in Presence of Irreg...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Paul Wettin Jacob Murray Ryan Kim Xinmin Yu Partha Pratim Pande Deukhyoun Heo Washington State University Pullman

ISBN: (纸本)9783981537024

The millimeter (mm)-wave small-world wireless NoC (mSWNoC) is an enabling interconnect architecture to design high performance and low power multicore chips. As the mSWNoC has an overall irregular topology, it is extremely important to design suitable deadlock-free routing mechanisms for it. In this paper we quantify the latency, energy dissipation, and thermal profiles of mSWNoC architectures by incorporating irregular network routing strategies. We demonstrate that the latency, energy dissipation, and thermal profile are affected by the adopted routing methodologies. In presence of the benchmarks considered, the variation in latency and energy dissipation is small. However, the network hotspot temperature can vary considerably depending on the exact routing strategy and the characteristics of the benchmark.

关键词： Millimeter-wave wireless Network-on-chip Small-world Irregular routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Deflection routing in Complex Networks

Deflection Routing in Complex Networks

引用

IEEE International Symposium on Circuits and Systems

作者： Soroush Haeri Ljiljana Trajkovic Simon Fraser University Vancouver British Columbia Canada

ISBN: (纸本)9781479934331

Contention is the main source of information loss in buffer-less network architectures where deflection routing is a viable contention resolution scheme. In recent years, various reinforcement learning-based deflection routing algorithms have been proposed. However, performance of these algorithms has not been evaluated in larger networks that resemble the autonomous system-level topology of the Internet. In this paper, we compare performance of three reinforcement learning-based deflection routing algorithms by using topologies generated with Waxman and Barabasi-Albert algorithms. We examine the scalability of deflection routing algorithms by increasing the network size while keeping the network load constant.

关键词： main viable these complex networks MAINS Deflection NETWORK STRUCTURE Network routing contention resolution Internets routing algorithms

来源：评论

学校读者我要写书评

暂无评论

HNSARA: A history-and-node-state-based active routing algorithm for DTN

HNSARA: A history-and-node-state-based active routing algori...

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Haipeng Zhang Ningning Lu Jing Ma Yue Yang The 54th Research Institute of China Electronics Technology Group Corporation Building 10 2nd Section Fengtai District Beijing China 100070

ISBN: (纸本)9781510802704

The routing algorithm of the DTN, which experience frequent long-duration partitions, is quite different from the normal networks. Active routing algorithms usually adopt an active host (data mule/message ferry) to exchange and forward the messages. In the existing studies in DTN, the active routing problem is generally solved by adopting the solutions of the Travelling Salesman Problem (TSP). In such solutions, the active routing problem is often solved by finding a simple cycle with no repeated nodes nor edges. By considering a more general scenario, we propose an active routing algorithm, which is based on the historical information and node states, where the route is a closed walk. The simulations verify the accuracy and efficiency of the active routing algorithm we proposed in this paper.

关键词： DTN History-and-node-state-based algorithm active routing algorithm message ferry route DTNA gene routing algorithms Active

来源：评论

学校读者我要写书评

暂无评论

A bi-direction hybrid routing algorithm in Mobile Hybrid Wireless Networks

A bi-direction hybrid routing algorithm in Mobile Hybrid Wir...

引用

10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014)

作者： Xiaolong Li Jianjun Hao Yijun Guo Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Post and Telecommunications China

ISBN: (纸本)9781510804166

In this paper, we propose an efficient routing algorithm based on AODV for the Mobile Hybrid Wireless Networks (MHWNs), which consists of the mobile ad hoc networks (MANETs) and an infrastructure wireless networks (such as cellular networks). In MANETs, the performance of the networks has been greatly challenged by the mobility from nodes and link state changes, while the link in cellular networks remains stable link with the mobile stations. This algorithm for routing construction takes advantage of the features of MHWNs, such as hybrid radio channels and nodes heterogeneity, to accomplish the bi-direction routing discovery on demand. Our results show that the performance of MHWNs is improved in the time and overhead for route path discovery process the under our bi-direction route algorithm.

关键词： AODV Bi-Direction MHWNs routing Algorithm routing algorithms Wireless networks AODV Cellular networks Mobile ad hoc networks HYBRID Hybrid electric vehicles Ganglia

来源：评论

学校读者我要写书评

暂无评论

PSO-based proactive routing in Delay Tolerant Network

PSO-based proactive routing in Delay Tolerant Network

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Jing Ma NingNing Lu HaiPeng Zhang The 54th Research Institute of China Electronics Technology Group Corporation Building 10 2nd Section Fengtai District Beijing China 100070

ISBN: (纸本)9781510802704

Delay Tolerant Network (DTN) is a new wireless networking architecture. Although it is designed for the environment where network partitions frequently appear, how to realize the routing algorithm in DTN is still an open question until now. In this paper, we propose a novel proactive routing protocol based on Particle Swarm Optimization (PSO) algorithm to support the data exchange between isolated nodes. The simulation results show that: our scheme could effectively reduce the network latency and could provide better flexibility and extensibility.

关键词： DTN PSO Proactive routing DTNA gene parametric subharmonic oscillator network delay routing algorithms extensibility

来源：评论

学校读者我要写书评

暂无评论

Optimal routing strategy on weighted networks

引用

Computer Modelling and New Technologies 2014年第8期18卷 122-126页

作者： Cheng, Binghua Shao, Fei School of Information Technology Jinling Institute of Technology Nanjing China Jiangsu Information Analysis Engineering Laboratory Nanjing China

It is of great importance to improve the transfer capacity of the weighted networks. In this paper, the traffic dynamics on weighted networks is investigated based on global information. It is shown by simulations that the weighted network transfer capacity depends strongly on the tuneable parameter in three different node delivery capability schemes: constant, proportional to node degree and proportional to node strength. Furthermore simulations on both computer-generated and real world networks show that different tuneable parameter is suitable for different node delivery capability scheme.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

The reconfigurable fault tolerance routing algorithm in Mesh Topology Structure

The reconfigurable fault tolerance routing algorithm in Mesh...

引用

10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014)

作者： Jianfei Wu Hua Cai Fuheng Qu Yong Yang College of Computer Engineer Changchun University of Science and Technology China College of Electronic and Information Engineer Changchun University of Science and Technology China

ISBN: (纸本)9781510804166

The reconfigurable fault-tolerant routing algorithm in Mesh Topology Structure which belongs the field of network on chip has a feature, which is that the method achieves fault tolerance by using north last turning model and less-stored routing list. The reconfigurable fault tolerance routing algorithm has a series of merits: practical convenience, high fault-tolerance performance, low cost and little hardware expense. Moreover, if there is not any fault, the XY routing algorithm with application certainty could ensure reliable transmission of information, which divides a router into two parts including fringe nodes and middle nodes. But, in the case of faults, information that comes from middle nodes should be transmitted according to north last turning model and information derive from fringe nodes should be conveyed by routing list in order to efficient transmission. Networks-on-chip (NoC) is a structure with redundancy feature. That is to say, there are many path ways from the source node to target node, which provides us with researching condition of fault tolerance routing algorithm. The algorithm is a kind of low cost, simple structure, low power consumption, a reconfigurable fault-tolerant routing algorithm for small memory.

关键词： Fault Tolerance Networks on Chip North Last Fault tolerance network-on-chip routing algorithms route list topological structure configurability data transmission turning model

来源：评论

学校读者我要写书评

暂无评论

Improving Hamiltonian-based routing Methods for On-chip Networks: A Turn Model Approach 14

Improving Hamiltonian-based Routing Methods for On-chip Netw...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Poona Bahrebar Dirk Stroobandt Ghent University Sint-Pietersnieuwstraat Ghent Belgium

ISBN: (纸本)9783981537024

The overall performance of Multi-Processor System-on-Chip (MPSoC) platforms depends highly on the efficient communication among their cores in the Network-on-Chip (NoC). routing algorithms are responsible for the on-chip communication and traffic distribution through the network. Hence, designing efficient and high-performance routing algorithms is of significant importance. In this paper, a deadlock-free and highly adaptive path-based routing method is proposed without using virtual channels. This method strives to exploit the maximum number of minimal paths between any source and destination pair. The simulation results in terms of performance and power consumption demonstrate that the proposed method significantly outperforms the other adaptive and non-adaptive schemes. This efficiency is achieved by reducing the number of hotspots and smoothly distributing the traffic across the network.

关键词： network-on-chip Traffic distribution routing algorithms Multiprocessor Network routing system-on-chip destination Power consumption core Traffic virtual channels shortest path

来源：评论

学校读者我要写书评

暂无评论

An attack-aware routing algorithm based on immune artificial fish swarm optimization in optical networks

An attack-aware routing algorithm based on immune artificial...

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Qian Wang Qi-wu Wu Department of Information Engineering Engineering University of Armed Police Force China

ISBN: (纸本)9781510802704

For multicast security routing in optical network, through the adoption of maximum light path attack radius MaxLAR criterion, Combined with the advantages of the immune algorithm and artificial fish algorithm, this paper proposes a new attack-aware routing algorithm based on immune artificial fish swarm optimization in optical networks. The algorithm can find out the smallest light path attack radius in light paths under the given condition, can enhance the capacity of optical network attack prevention, can reduce the light damage by the potential physical-layer attacks. Through algorithm analysis, we can show that the algorithm is feasible, and have achieved good performance.

关键词： Immune artificial fish swarm MaxLAR Multicast routing Optical network Fiber optic networks Particle swarm optimization analysis of algorithm routing algorithms light damage Immunity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：