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

6th International Conference on Artificial Intelligence and Security,ICAIS 2020

作者： Li, Hui Feng, Jun Gong, Yanli Liu, Jialing Inner Mongolia University Hohhot010000 China

ISBN: (纸本)9789811580857

With the development and popularization of mobile communication terminals, a new wireless mobile delay tolerant network called the Vehicle interconnection is proposed. routing algorithm is one of the hotspots and difficulties in the vehicle networks. The vehicle networks with social attributes is widely used, so it is of great significance to study the routing algorithm in the vehicle networks with social attributes. Many routing algorithms based on static community have been proposed. However, in the communication process of the vehicle networks, due to the interference of selfish nodes, energy constraints, communication barriers and other factors, the community in the network shows dynamic uncertainty. In order to improve the success rate of information delivery and reduce the delivery delay when multiple factors interfere with the vehicle network, this paper studies the vehicle network routing algorithm based on the uncertain community. Based on the existing research at home and abroad, this paper studies the interference factors of communication in the vehicle networks, monitors, discovers and forecasts the dynamic change trend of uncertain communities, constructs the community rationality intelligent evaluation system model, designs and implements the routing algorithm of the vehicle networks based on uncertain communities, and verifies the effectiveness of the algorithm. © 2020, Springer Nature Singapore Pte Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A security routing algorithm against selective forwarding attacks in scale-free networks 8

A security routing algorithm against selective forwarding at...

引用

8th International Conference on Identification, Information and Knowledge in the Internet of Things, IIKI 2019

作者： Yin, Rongrong Zhang, Fufu Xu, Yinghan Liu, Lei Li, Xida School of Information Science and Engineering Yanshan University Hebei Qinhuangdao066004 China Chinese People’s Liberation Army 73676 Jiangsu Jiangyin214400 China

Scale-free networks are vulnerable to the selective forwarding attacks where the legitimated data packet is discarded by malicious nodes. And it is easy for non-balanced energy consumption to happen and prematurely make the network disconnection. This paper proposes the multiple attribute decision making model, which has the balanced characteristic of various factors. In the model, the node’s energy transmission efficiency, load and packet loss rate are defined as node attributes, and the weight value of each attribute is calculated by relative entropy. Furthermore, according to the decision values of the forward neighbors, the optimal routing node is determined. The simulation experiment results show that the routing algorithm based on decision model can effectively avoid the nodes suffered from selective forward attacks, improve the energy utilization and prolong the lifetime. © 2020 The Authors. Published by Elsevier B.V.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Inter-satellite Link Network routing Algorithm Based on Multi-objective Optimization 11th

Research on Inter-satellite Link Network Routing Algorithm B...

引用

11th China Satellite Navigation Conference, CSNC 2020

作者： Wang, Sixin Wang, Qi Yin, Hao Zhou, Yu The 6th Research Institute of China Electronics Corporation Beijing10083 China Beijing Institute of Tracking and Telecommunications Technology Beijing10083 China

ISBN: (纸本)9789811537066

In view of the problem that the inter-satellite link network routing planning algorithm adapts to the single business scenario and has poor generalization ability, this paper proposes a multi-objective optimized inter-satellite link routing model based on the breadth-first routing algorithm. In this model, the optimization objects are the data transmission performance and connectivity of the time-varying inter-satellite network, the inputs are the point-to-point path hop threshold, the preferred path number threshold, and the node load weight in the route planning algorithm, and the evaluating indicators are data transmission delay, satellite node load, and network connectivity. In this paper, the fast non-dominated sorting genetic algorithm with elite strategy (NSGA-II) is used to solve the model. In addition, this paper establishes a data transmission model based on the STDMA communication protocol of the satellite navigation system to obtain the data transmission delay in each iteration, which is composed of 24 MEO, 3 GEO and 3 IGSO satellites. Finally, the Pareto solution set of point-to-point path hop threshold, the preferred path number threshold, and the node load weight is determined when the data transmission performance and network connectivity performance of inter satellite link are optimal. According to the Pareto solution set obtained in this paper, it can effectively modify the key parameter settings of the routing planning algorithm and improve the generalization ability of the algorithm in multi service scenarios. © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved Strategies of LEACH-based Low Energy Consumption and High Reliable Multi-hop routing Algorithm for Wireless Sensor Network 6

Improved Strategies of LEACH-based Low Energy Consumption an...

引用

6th IEEE International Conference on Computer and Communications, ICCC 2020

作者： Guo, Lubin Liu, Jiayan Qin, Peng Zhao, Xiongwen Ma, Huiyuan Chi, Zhongjun School of Electrical and Electronic Engineering North China Electric Power University Beijing China State Grid Beijing Electric Power Company Beijing China

ISBN: (纸本)9781728186351

LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the pioneer clustering routing algorithm, the idea of clustering proposed by which provides a good reference for the design of routing algorithm for wireless sensor network. In LEACH algorithm, the selection of cluster head ignores the consideration of node energy, which may lead to the death of cluster head and this will case the failure of data transmitted to sink. Besides, cluster head direct communication with the base station limits the expansion of the network scale. In response to these shortcomings, three strategies to improve the performance of LEACH-based algorithm are discussed in this paper, based on which we propose a low energy consumption high reliable multi-hop routing algorithm LEACH-MB. By improving the selection of cluster heads, introducing a mechanism of backup cluster head and adopting the approach of cluster head multi-hop, the performance of this new algorithm has been significantly improved compared to LEACH. Through the simulation analysis of the algorithm, we can find that this algorithm can prolong the network lifetime and improve the reliability of data transmission, and get a result of throughput increase. © 2020 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Secure routing Algorithm Based on Trust Value for Micro-nano Satellite Network 2

A Secure Routing Algorithm Based on Trust Value for Micro-na...

引用

2nd International Conference on Information Technology and Computer Application, ITCA 2020

作者： Ding, Yuanming Zhao, Yu Zhang, Ran Dalian University Communication and Network Laboratory Dalian China

ISBN: (纸本)9780738111414

With the increasing application of micro-nano satellite network, it is extremely vulnerable to the influence of internal malicious nodes in the practical application process. However, currently micro-nano satellite network still lacks effective means of routing security protection. In order to solve this problem, combining with the characteristics of limited energy and computing capacity of micro-nano satellite nodes, this research proposes a secure routing algorithm based on trust value. First, the trust value of the computing node is synthesized, and then the routing path is generated by combining the trust value of the node with the AODV routing algorithm. Simulation results show that the proposed MNS-AODV routing algorithm can effectively resist the influence of internal malicious nodes on data transmission, and it can reduce the packet loss rate and average energy consumption. © 2020 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Zone routing Algorithm for Service Network

A Zone Routing Algorithm for Service Network

引用

2020 International Conference on Service Science, ICSS 2020

作者： Zheng, Bangpeng Yin, Jianwei Pang, Shengye Zheng, Tao Tian, Qunxi College of Computer Science Zhejiang University Hangzhou China New H3C Beijing China Alibaba Group Hangzhou China

ISBN: (纸本)9781728185316

The increasing number of available open services demands distributed architectures to promote scalability to enable their precise and efficient retrieval. As web services proliferate, it is more and more difficult to find suitable services and further compose them into complex applications automatically. In this paper, a novel service infrastructure named Service Network(ServNet), which is constructed on the basis of service routers and service switches, is proposed to deploy and manage large-scale services. Furthermore, the zone routing algorithm (ZRA) combines the advantages of the proactive and reactive approaches by maintaining an up-to-date topological map of a zone centered on each service node. Experimental evaluations confirmed the efficiency in terms of accuracy of query and network traffic. © 2020 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Cluster Head Selection for Wireless Sensor Network Using Fuzzy Logic

Energy Efficient Cluster Head Selection for Wireless Sensor ...

引用

International conference on Research in Intelligent and Computing in Engineering, RICE 2020

作者： Jain, Kusum Lata Gupta, Shivani Mohapatra, Smarnika Department of Computer & Communication Engineering Manipal University Jaipur Jaipur India Poornima University Jaipur India

ISBN: (纸本)9789811575266

Many routing protocols are proposed and used for wireless sensor networks that use clustering for load sharing in the network. This is a significant technique which extends the network lifetime. Dynamic or topology makes cluster head selection a difficult task in the network. The following paper proposed a fuzzy logic-based cluster head selection method and compared with LEACH routing protocol which considered as the benchmark algorithm for the cluster-based routing algorithm for WSN. © 2021, Springer Nature Singapore Pte Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel generalised meta-heuristic framework for dynamic capacitated arc routing problems

arXiv

引用

arXiv 2021年

作者： Tong, Hao Minku, Leandro L. Menzel, Stefan Sendhoff, Bernhard Yao, Xin School of Computer Science University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom Honda Research Institute Europe GmbH Offenbach63073 Germany Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

The capacitated arc routing problem (CARP) is a challenging combinatorial optimisation problem abstracted from typical real-world applications, like waste collection and mail delivery. However, few studies considered dynamic changes during the vehicles' service, which can make the original schedule infeasible or obsolete. The few existing studies are limited by dynamic scenarios that can suffer single types of dynamic events, and by algorithms that rely on special operators or representations, being unable to benefit from the wealth of contributions provided by the static CARP literature. Here, we provide the first mathematical formulation for dynamic CARP (DCARP) and design a simulation system to execute the CARP solutions and generate DCARP instances with several common dynamic events. We then propose a novel framework able to generalise all existing static CARP optimisation algorithms so that they can cope with DCARP instances. The framework has the option to enhance optimisation performance for DCARP instances based on a restart strategy that makes no use of past history, and a sequence transfer strategy that benefits from past optimisation experience. Empirical studies are conducted on a wide range of DCARP instances. The results highlight the need for tackling dynamic changes and show that the proposed framework significantly improves over existing algorithms. Copyright © 2021, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

DeFT: A Deadlock-Free and Fault-Tolerant routing Algorithm for 2.5D Chiplet Networks

arXiv

引用

arXiv 2021年

作者： Taheri, Ebadollah Pasricha, Sudeep Nikdast, Mahdi Department of Electrical and Computer Engineering Colorado State University United States

By interconnecting smaller chiplets through an interposer, 2.5D integration offers a cost-effective and high-yield solution to implement large-scale modular systems. Nevertheless, the underlying network is prone to deadlock, despite deadlock-free chiplets, and to different faults on the vertical links used for connecting the chiplets to the interposer. Unfortunately, existing fault-tolerant routing techniques proposed for 2D and 3D on-chip networks cannot be applied to chiplet networks. To address these problems, this paper presents the first deadlock-free and fault-tolerant routing algorithm, called DeFT, for 2.5D integrated chiplet systems. DeFT improves the redundancy in vertical-link selection to tolerate faults in vertical links while considering network congestion. Moreover, DeFT can tolerate different vertical-link-fault scenarios while accounting for vertical-link utilization. Compared to the state-of-the-art routing algorithms in 2.5D chiplet systems, our simulation results show that DeFT improves network reachability by up to 75% with a fault rate of up to 25% and reduces the network latency by up to 40% for multi-application execution scenarios with less than 2% area overhead. © 2021, CC BY-NC-SA.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimized graph based routing algorithm for the Angara interconnect

arXiv

引用

arXiv 2021年

作者： Mukosey, Anatoly Semenov, Alexander Tretiakov, Alexander JSC NICEVT Scientific and Research Centre of Electronic Computer Technology Russia National Research University Higher School of Economics Russia

JSC NICEVT has developed the Angara high-speed interconnect with 4D torus topology. The Angara interconnect router implements deterministic routing based on the bubble flow control, a direction order routing (DOR) and direction bits rules. The router chip also supports non standard First Step / Last Step for bypassing failed nodes and links, these steps can violate the DOR rule. In the previous work we have proposed an algorithm for generation and analysis of routing tables that guarantees no deadlocks in the Angara interconnect. It is based on a breadth-first search algorithm in a graph and it practically does not take into consideration communication channel load. Also we have never evaluated the influence of routing table generation algorithm on the performance of a real-world Angara based cluster. In this paper we present a routing graph notation that provides a possibility to build routes in the torus topology of the Angara interconnect. We propose a deadlock-free routing algorithm based on a fast single-source shortest path algorithm for the deterministic Angara routing with a single virtual channel. We evaluated the considered routing algorithms on a 32-node Desmos cluster system and benchmarked the proposed algorithm performance improvement of 11.1% for the Alltoall communication pattern and of more than 5% for the FT and IS application kernels. Copyright © 2021, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：