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

Multi-objective heuristic multicast routing algorithm in ndn 1

4th International Conference on IoT as a Service, IoTaaS 2018

作者： An, Xuming Zhang, Yu Chen, Yanxiang Wang, Yadong Beijing Institute of Technology Beijing China The Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory CETC-54 Shijiazhuang China

ISBN: (数字)9783030146573

ISBN: (纸本)9783030146566

. NDN naturally supports multicast better than the traditional Internet, and multicast plays an important role in NDN. Most researchs on multicast routing algorithms are focused on cost optimization without taking node cache into account. This paper constructs a mathematical model for joint optimization of delay and cost, which is more flexible in describing NDN than adding delay as a constraint to the model. Then, the heuristic multicast algorithm considering node cache for this model is proposed. Last, we analyze the delay performance of the algorithm by comparing it with the exact Algorithm and the classical STMPH algorithm. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on extract-shift-reverse routing algorithm in inverse butterfly network

Research on extract-shift-reverse routing algorithm in inver...

引用

2019 International Conference on Communications, Information System, and Computer Engineering, CISCE 2019

作者： Chang, Zhongxiang Dai, Zheng College of Information and Communication National University of Defense Technology Wuhan China

ISBN: (纸本)9781728136813

PEX, PEX-ROR, GRP and other special bit permutation instructions support fewer types of permutation, but they need complicated control information configuration and large hardware. In order to solve the problems, a new extract-shift-reverse permutation operation and routing information generation algorithm are proposed based on Inverse Butterfly network. The new algorithm not only can support the routing information for PEX and PEX-ROR, but also reduce the control information for GRP and the types of permutation has doubled. At the same time, The critical path of the algorithm is only adding one inverter, so the processing performance is basically the same as PEX-ROR. © 2019 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A GIS-based optimize routing algorithm for VANET in urban scenarios 3

A GIS-based optimize routing algorithm for VANET in urban sc...

引用

3rd IEEE International Conference on Smart Internet of Things, SmartIoT 2019

作者： Sun, Weifeng Jia, Minghan Yu, Shumiao Zhang, Guanghao Qiu, Tie School of Software Dalian University of Technology Dalian116620 China College of Intelligence and Computing Tianjin University Tianjin300350 China

ISBN: (纸本)9781728134888

The Vehicular ad-hoc network (VANET) is suitable for transmitting information in an intelligent transportation system in the smart city scenarios, but it requires real-time and accurate communications. To achieve effective data transferring, a geographic anchor constrained optimize routing algorithm (GACOR) is proposed, which introduces the global anchor. From a city scenario, relevant Geographic location factors were collected and processed by applying Geographic Information System (GIS) technology and GACOR plans the routing paths according to the global information and avoids the local optimum problem in the transmission processes. It also proposes the ideas of storing a local routing table and by which, some packets can be directly sent to the valid neighbor node without calculation. Simulation results show that GACOR can achieve lower packet loss rate and end-to-end delays compared to greedy perimeter stateless routing (GPSR) and Geographic Source routing (GSR) for VANET in urban scenarios. © 2019 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient routing of Electric Vehicles with Integrated Photovoltaic Installations

Energy-efficient Routing of Electric Vehicles with Integrate...

引用

IEEE Instrumentation and Measurement Technology Conference

作者： Christian Schuss Tapio Fabritius Bernd Eichberger Timo Rahkonen Optoelectronics and Measurement Techniques (OPEM) Research Unit University of Oulu Finland Institute of Electronic Sensor Systems Graz University of Technology Austria Circuits and Systems (CAS) Research Unit University of Oulu Finland

ISBN: (数字)9781728144603

ISBN: (纸本)9781728144610

This paper investigates the potential output power of photovoltaic (PV) installations on top of battery-powered electric vehicles (BEVs) and hybrid electric vehicles (HEVs). By choosing different routes within urban areas, we expect different output power levels from the vehicle's PV installation. Hence, we calculate energy profiles to estimate the PV energy which can be gained during driving conditions to choose the most energy-efficient route for BEVs and HEVs. While driving duration, driving distance and traffic conditions are some of the criteria within the decision-making process of routing algorithms, in this paper, we focus on energy-efficiency of routing algorithms. We present experimental data to highlight the importance of energy profiles for improving and maximising of the electrical driving distance of BEVs and HEVs.

关键词： algorithm battery-powered electric vehicle data acquisition energy profile environmental data hybrid electric vehicle measurement photovoltaic energy solar energy Hybrid electric vehicles Photovoltaic energy Energy efficiency Environmental data Electric vehicles Data Collection Methods Solar Energy routing algorithms Installations ROADWAY-POWERED ELECTRIC VEHICLES algorithms Automobile driving Output power

来源：评论

学校读者我要写书评

暂无评论

A SDN-based QoE-aware routing Algorithm on Video 2

A SDN-based QoE-aware Routing Algorithm on Video

引用

2nd IEEE International Conference on Information Systems and Computer Aided Education, ICISCAE 2019

作者： Ge, Mingxia Chen, Wen Zeng, Yanling Donghua University School of Information Science and Technology Shanghai China

ISBN: (纸本)9781728130668

In recent years, with the vigorous development of the video business market, the competition among service providers has become increasingly fierce. The key to winning the competition depends on the Quality of Experience (QoE). Faced with the increasing video traffic, how to use the limited infrastructure resources to ensure the good user experience is a difficult problem. Recent studies unilaterally focus on guaranteeing QoE, which may lead to sub-optimal resource utilization. To solve this problem, this paper proposes a QoE-centric routing algorithm based on Yen K-shortest paths (YenKSP), which pays attention to the utilization of limited resources while guaranteeing the quality of user experience. © 2019 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved routing Algorithm on Complex Multi-ring Network Topology 5

An Improved Routing Algorithm on Complex Multi-ring Network ...

引用

5th IEEE International Conference on Computer and Communications, ICCC 2019

作者： Zhou, Zitao Wang, Yongli Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing China

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147437

Although the traditional ring network can provide more secure and stable services, it is not satisfactory in terms of network delay and transmission efficiency. The augmented ring network structure and the complex multi-ring network derived from the augmented ring network was studied in this paper. An improved routing algorithm- PRR algorithm is proposed in this paper which is divided into three steps: Preprocessing, Recovering Nodes and Recovering Path. The core idea of the algorithm is to combine and divide the characteristics of the multi-ring network, and transform the original network into directed network through preprocessing, thus transforming the complex routing problem in the multi-ring network into a simple routing problem in the single-ring network. This paper proves that the optimal path obtained by the algorithm is error-free theoretically. The network simulation and experiments proved that the algorithm is an effective and efficient routing algorithm in complex multi-loop networks compared with the results and performance of existing algorithms. © 2019 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Software for constructing a-chains with ordered enclosing for a plane connected 4-regular graph

引用

IFAC-PapersOnLine 2019年第13期52卷 2650-2655页

作者： Makarovskikh, Tatiana A. Panyukov, Anatoly V. South Ural State University pr. Lenina 76 Chelyabinsk454080 Russia

The task of constructing the cutting path of the tool when the part cut off from the sheet does not require additional cuts and the trajectories of cuts intersections are forbidden (the touches is allowed) may arise in CAD/CAM-systems of technological preparation of cutting processes. Formally, such a task can be formulated as the problem of constructing a self-non-intersecting chain in a plane Euler graph representing a homeomorphic image of a cutting plan. Finally, the tasks of routes satisfying technological constraints constructing are reduced to defining an A-chain with ordered enclosing for a plane connected 4-regular graph. This article is devoted to the algorithm for finding such a chain. The execution of this algorithm consists of two stages. At the first stage, cut-vertices of rank k are identified and splitted. At the second stage, the construction of the chain starts from an arbitrary vertex incident to the outer face; the first edge of the chain is chosen to be an edge of maximal rank incident to a given vertex; next, an iterative process is organized where, as the next edge, an unpassed edge of maximum rank is chosen, which is the left or right neighbour of the current one. It is shown that the algorithm constructs a route with the indicated properties in linear time for a plane connected 4-regular graph. The software implementation of the algorithm in C ++ is considered. The results of testing the developed program are given. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Graph algorithms C++ (programming language) Computer aided design Graph theory Iterative methods Motion planning routing algorithms Software testing Arbitrary vertices Cad/cams Graph theoretic models Homeomorphic images Iterative process Software implementation Software performance Technological constraints

来源：评论

学校读者我要写书评

暂无评论

Construction and routing algorithms for multi-layer Steiner Triple System

引用

Journal of Information and Computational Science 2013年第12期10卷 3605-3613页

作者： Zhang, Jianfei Fang, Zhiyi Zheng, S.Q. Qu, Guannan College of Computer Science and Technology Jilin University Changchun 130012 China Department of Computer Science University of Texas at Dallas Richardson TX 75083 United States

Topology structure has been studied as an important aspect which influences the performance of Data Center (DC). Recently, we proposed a novel topology structure named MSTS structure. MSTS structure is a multi-layer topology structure and is based on Steiner Triple System (STS). We have proved that MSTS structure can include much more computation units with small diameter. This outstanding feature makes MSTS be built only by small scale commercial connection equipment. It largely reduces its implementation cost. In this paper, we present an efficient construction method and a fault tolerant routing algorithm for MSTS structure. © 2013 by Binary Information Press.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Mathematical model for a cutting path avoiding intersections ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 10455-10460页

作者： Tatiana A. Makarovskikh Anatoly V. Panyukov South Ural State University pr. Lenina 76 Chelyabinsk 454080Russian Federation

During the technological preparation of the cutting process, it is necessary to determine the path of the cutter when there are no self-intersections of the cutting path and the part cut off from the sheet does not require any cuts, then arise the problems: first, representation of the cutting plan as a planar graph which is the homeomorphic image of the cutting plan; second, algorithms to find the cutter routes in this graph. The paper is devoted to a polynomial-time algorithm for constructing a non-intersecting ordered enclosing chain ( NOE -chain) for a plane Eulerian graph. The proposed approach consists in splitting of all original graph vertices with degree higher than 4 by introducing fictive vertices and edges and, thus, reducing the considered earlier problem to the problem of finding an A-chain with ordered enclosing in a plane connected 4-regular graph. A test example of constructing NOE -chain with ordered enclosing is considered.

关键词： CAD/CAM Graph theoretic models Graph theory Path planning routing algorithms Software performance

来源：评论

学校读者我要写书评

暂无评论

A Vector-Based routing Protocol in Underwater Wireless Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2018年第4期100卷 1569-1583页

作者： Mazinani, Sayyed Majid Yousefi, Hadi Mirzaie, Mostafa Imam Reza Int Univ Fac Engn Mashhad Iran Islamic Azad Univ Neyshabur Branch Neyshabur Iran Imam Reza Int Univ Formal Languages & Automata Course Mashhad Iran Imam Reza Int Univ Comp Lab Course Mashhad Iran

One major concern shared by many researchers about underwater wireless sensor networks (UWSNs), with respect to the limitations and particularities of underwater environment, is the problem of routing. These limitations include three-dimensional topology, limited bandwidth, node movement, long delay, limited energy, and construction costs. The new routing protocols for underwater networks have been developed on the basis of voracious routing systems. The main problem with UWSNs is finding an efficient route between the source and the target to send more packets to the target with lower levels of energy consumption. In this research, by improving VBF algorithm, which is dependent on the radius of the routing pipe, an algorithm is introduced which considers pipe radius as a function of the environment's dimensions and of the range and the number of nodes. Consequently, by changing one of these parameters, the radius of the routing pipe changes. However, to control the energy consumed by the nodes, there exists a function that, if the recipient node's energy to receive the packet is much lower than that of the sender node, the proposed method reduces the size of the routing pipe's radius to lessen its chance of being selected as the guiding node so that other nodes are able to have the chance of getting the packet's guiding node. The proposed algorithm has been compared with VBVA, HHVBF, and VBF protocols;the simulation results obtained from NS-2 simulator indicate that the proposed protocol could cut back on energy consumption, especially in networks with high number of nodes, by relying on changing the width of the routing pipe in proportion to network density. It was also successful in delivering more packets in non-dense networks.

关键词： Underwater sensor networks routing algorithms NS-2 routing pipe

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：