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

arXiv 2018年

作者： Drain, James Department of Mathematics Dartmouth College

We present and analyze two new algorithms for the package-exchange robot-routing problem (PERR): restriction to inidividual paths (RIP) and bubbletree. RIP provably produces a makespan that is O(SIC + k2), where SIC is the sum of the lengths of the individual paths and k is the number of robots. Bubbletree produces a makespan that is O(n), where n is the number of nodes. With optimizations bubbletree can also achieve a makespan of O((k + l)logk), where l is the longest path from start to goal in the bubbletree subgraph. Copyright © 2018, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Path unaware layered routing protocol (PULRP) with non-uniform node distribution for underwater sensor networks

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2008年第8期8卷 1045-1060页

作者： Gopi, Sarath Kannan, G. Chander, Deepthi Desai, U. B. Merchant, S. N. Indian Inst Technol SPANN Lab Dept Elect Engn Bombay 400076 Maharashtra India

We propose path unaware layered routing protocol (PULRP) for 2D Underwater sensor networks (UWSNs) with mobile nodes. The steady-state distribution of mobile nodes in UWSNs is nonuniform in general. Hence, we use a mobility model-dependent node distribution. The proposed PULRP algorithm consists of two phases. In the first phase (layering phase), a layering structure is presented which is a set of concentric circles, around a sink node. The radii of the concentric circles are chosen based on equal distribution of nodes in every layer. A distributed power control inechanisin is also introduced. The power level of nodes in a particular layer is chosen such that communication occurs only with nodes in the next layer. In PULRR we consider multihop communication from source to sink. Therefore. in the second phase (communication phase), we propose a method to choose the intermediate relay nodes and an on the fly routing algorithm for packet delivery from source node to sink node across the chosen relay nodes. The proposed algorithm, PULRP finds the routing path on the fly and hence, it does not require any fixed routing table, localization. or time synchronization processes. We demonstrate the performance of PULRP using random waypoint (RWP) mobility model in a simulated underwater environment. Our findings show that the proposed algorithm has considerably better throughput (successful packet delivery rate) compared to the underwater diffusion (UWD) algorithm for various node densities as well as node velocities. In addition, the delay performance of PULRP is also better than that of UWD. Copyright (C) 2008 John Wiley & Sons Ltd.

关键词： underwater sensor networks routing algorithms random waypoint mobility model

来源：评论

学校读者我要写书评

暂无评论

Localised credit based QoS routing

引用

IEE PROCEEDINGS-COMMUNICATIONS 2006年第6期153卷 787-796页

作者： Alabbad, S. H. Woodward, M. E. Univ Bradford Sch Informat Dept Comp Bradford BD7 1DP W Yorkshire England

Localised quality of service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localised view of the network QoS state. A credit based routing algorithm (CBR) which is a simple yet effective localised QoS routing algorithm is introduced. Its performance is compared against the localised proportional sticky routing (PSR) algorithm using different types of network topologies, QoS requirements and traffic patterns and under a wide range of traffic loads. Extensive simulations show that the algorithm outperforms the PSR scheme while maintaining the same level of adaptivity and stability. Its performance is also compared against the global widest-shortest path algorithm (WSP) and it is shown that CBR gives a comparable performance with better time complexity and very low communication overhead.

关键词： Quality of service complexity classes Network routing PRIMARY SYSTEM RELIEF traffic patterns routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Vascular-Network-Based Nonuniform Hierarchical Fault-Tolerant routing Algorithm for Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2012年第11期8卷 1-14页

作者： Li, Hongbing Gao, Peng Xiong, Qingyu Shi, Weiren Chen, Qiang Chongqing Univ Sch Automat Chongqing 400030 Peoples R China Chongqing Three Gorges Univ Sch Comp Sci & Engn Chongqing 404100 Peoples R China Chongqing Univ Sch Software Engn Chongqing 400030 Peoples R China

Fault tolerance is the key technology in wireless sensor networks which attracts many research interests. Aiming at the issue that the nodes' failures affect the network's stability and service quality, a vascular-network-based fault-tolerant routing algorithm is presented by nonuniform hierarchical clustering. According to the distribution characteristics of the vascular network and inspirations to the fault tolerance for wireless sensor networks, a mathematical model and network topology are, respectively, established. It applies the improved particle swarm optimization (IPSO) to the nonuniform hierarchical clustering, and multipaths are established between the neighbor hierarchical nodes based on the best-worst ant system (BWAS). It introduces the normalized values of the pheromone generated by the ants as the selection probabilities of transmitting paths to establish the hierarchical routing. Theoretical analysis and simulations show that the algorithm has higher packet receiving rates, lower average transmission delay, and balanced energy consumption. It has the good performance in fault tolerance and stability of data transmitting, and it avoids the hot issue in energy consumption and achieves the network load balance.

关键词： FAULT-tolerant computing routing algorithms WIRELESS sensor networks QUALITY of service ELECTRIC network topology PARTICLE swarm optimization

来源：评论

学校读者我要写书评

暂无评论

End-to-end service provisioning based on extended segment routing in multi-domain optical networks of F5G

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2022年第7期14卷 550-561页

作者： Li, Xin Liu, Yikai Zhao, Yongli Li, Yajie Li, Zhuotong Rahman, Sabidur Zhang, Jie Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China Sonoma State Univ Dept Comp Sci Rohnert Pk CA 94928 USA

As the most important fabric of fixed networks, the optical network plays an important role in expanding network capacity and providing long distance communication. At present, the fixed network has entered a key era, i.e., the fifth-generation fixed network (F5G). As one of the main features of F5G, the full-fiber connection requires a tenfold to hundredfold increase in the number of connections, which means F5G will have tens of thousands of nodes and millions of connections. Large-scale networks are composed of multiple network domains connected to each other. The whole network can be subdivided according to network functional domain. To meet different service requirements, how to provision fast end-to-end service in a multi-domain scenario has become a key issue. In optical networks, lightpath establishment must precede service transmission. The latency of lightpath establishment includes lightpath establishment signaling latency and optical interleaving device configuration latency. The latter depends on equipment performance. Therefore, how to provision fast lightpath establishment signaling is a key problem. To reduce end-to-end service provisioning latency, we propose an extended-segment-routing-based fast service provisioning scheme for the first time, to our knowledge, which consists of two steps: signaling path acquisition and signaling provisioning. For the signaling path acquisition step, we propose an adaptive segment routing (ASR) algorithm that first performs service path calculation based on service requirements, then performs a label compression algorithm to obtain the signaling path represented by the minimum number of labels according to the service path. For the signaling provisioning step, we propose a fast-signaling provisioning (FSP) process that can realize fast signaling provisioning in both single-domain and multi-domain scenarios. The simulation results show that, (1) compared to the Dijkstra algorithm, the ASR algorithm achieves a lower

关键词： Networking hardware Numerical simulation Optical networks Optical signals Packet switching routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Review on Wireless Sensor Networks: routing

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第1期125卷 897-937页

作者： Basha, Adam Raja Koneru Lakshmaiah Educ Fdn Dept CSE Vaddeswaram 522502 AP India

Wireless sensor networks (WSNs) are networks with devices that can detect, process, store, and communicate wirelessly. Each network terminal can have multiple sensing devices that can measure physical variations such as temperature, brightness, humidity, and vibration. However, developing and implementing WSNs poses many challenges. This review presents the challenges of WSN using different routing algorithms such as geographic routing, energy-aware routing, delay aware routing, QoS aware routing, secure aware routing, and hierarchical aware routing. Another goal is to find out which WSN component automates interference and behavior. What kind of application is in the WSN depends not only on his work but also on the question of the basis, functionality, and handling of his project. The study was carefully planned, and the systematic review of the literature was set up in a strong framework according to a pre-defined protocol. Finally, we evaluate the performance parameters of previous routing algorithms with diverse routine metrics that are energy consumption, delay, packet delivery ratio, throughput, false ratio, packet loss ratio, and network overhead.

关键词： Wireless sensor networks routing algorithms Geographic routing Energy aware routing Delay aware routing QoS aware routing Secure aware routing and hierarchical aware routing

来源：评论

学校读者我要写书评

暂无评论

Coping with Disruptions Performance Comparison of Strategies for Online Inventory routing Systems Under Demand Surges

引用

TRANSPORTATION RESEARCH RECORD 2010年第2168期2168卷 63-70页

作者： Giesen, Ricardo Mahmassani, Hani S. Jaillet, Patrick Northwestern Univ Transportat Ctr Dept Civil & Environm Engn Evanston IL 60201 USA Pontificia Univ Catolica Chile Dept Transport Engn & Logist Santiago Chile MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA

In real time distribution operations, It is generally assumed that demand process parameters can be precisely estimated However, this is rarely the case, particularly for products with a short life cycle Experiments were done to investigate the performance of various strategies for online distribution operations under disruptions caused by surges in demand patterns at a particular facility Two sets of strategies are considered (a) optimization based strategies, in which an off line optimization problem is formulated and used to update routing and inventory allocation plans, and (b) fixed tour strategies, in which a priori sets of routes to provide retailers with recourse actions depending on different degrees of real time information capabilities for controlling the system are used These are compared against two benchmark policies Simulation results for two scenarios (high and low inventory holding cost products) show that strategies that use real time information to update delivery plans systematically outperform strategies in which routes are not modified after the vehicle leaves the depot The differences tend to be higher in scenarios of products with low Inventory holding costs For replanning strategies, the benefits of en route plan updates are significant, in particular the possibility of diverting the vehicle In the case of fixed tour strategies, the possibility of updating tour Intervals provides potentially great savings Replanning strategies systematically outperform fixed tour strategies

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Mixing Convergence and Deflection Strategies for Packet routing in All-Optical Networks

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2009年第3期1卷 222-234页

作者： Barth, D. Berthome, P. Chiaroni, D. Fourneau, J. M. Laforest, C. Vial, S. Univ Paris Univ Versailles CNRS PRiSM LabUMR 8144 F-75252 Paris France Univ Orleans ENSI Bourges Orleans France Univ Orleans LIFO Orleans France Univ Clermont Ferrand 2 Photochim Mol & Macromol Lab CNRS LIMOSUMR 6158 F-63177 Clermont Ferrand France

We present two routing algorithms based on deflection and convergence, which are able to provide high bandwidth and an ending guarantee for the end-to-end delay in a core network. We study the performance of these rou... 详细信息

关键词： All-optical networks routing algorithms Packet-switched networks Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

The performance of a hybrid routing intelligent algorithm in a mobile ad hoc network

引用

COMPUTERS & ELECTRICAL ENGINEERING 2014年第4期40卷 1255-1264页

作者： Nancharaiah, B. Mohan, B. Chandra JNT Univ Dept ECE Hyderabad Andhra Pradesh India Bapatla Engn Coll Dept ECE Bapatla 522101 Andhra Pradesh India

End-to-end delay, power consumption, and communication cost are some of the most important metrics in a mobile ad hoc network (MANET) when routing from a source to a destination. Recent approaches using the swarm intelligence (SI) technique proved that the local interaction of several simple agents to meet a global goal has a significant impact on MANET routing. In this work, a hybrid routing intelligent algorithm that has an ant colony optimisation (ACO) algorithm and particle swarm optimisation (PSO) is used to improve the various metrics in MANET routing. The ACO algorithm uses mobile agents as ants to identify the most feasible and best path in a network. Additionally, the ACO algorithm helps to locate paths between two nodes in a network and provides input to the PSO technique, which is a metaheuristic approach in SI. The PSO finds the best solution for a particle's position and velocity and minimises cost, power, and end-to-end delay. This hybrid routing intelligent algorithm has an improved performance when compared with the simple ACO algorithm in terms of delay, power consumption, and communication cost. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： AD hoc networks (Computer networks) routing algorithms PERFORMANCE evaluation ARTIFICIAL intelligence ELECTRIC power consumption TIME delay systems

来源：评论

学校读者我要写书评

暂无评论

Space-efficient routing tables for almost all networks and the incompressibility method

引用

SIAM JOURNAL ON COMPUTING 1999年第4期28卷 1414-1432页

作者： Buhrman, H Hoepman, JH Vitányi, P Ctr Wiskunde & Informat NL-1098 SJ Amsterdam Netherlands Univ Twente Dept Comp Sci NL-7500 AE Enschede Netherlands

We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs, Theta(n(2)) bits are necessary and sufficient for shortest path routing. By "almost all graphs" we mean the Kolmogorov random graphs which constitute a fraction of 1 ? 1/n(c) of all graphs on n nodes, where c > 0 is an arbitrary fixed constant. There is a model for which the average case lower bound rises to Omega(n(2) log n) and another model where the average case upper bound drops to O(n log(2) n). This clearly exposes the sensitivity of such bounds to the model under consideration. If paths have to be short, but need not be shortest (if the stretch factor may be larger than 1), then much less space is needed on average, even in the more demanding models. Full-information routing requires Theta(n(3)) bits on average. For worst-case static networks we prove an Omega(n(2) log n) lower bound for shortest path routing and all stretch factors < 2 in some networks where free relabeling is not allowed.

关键词： computer networks routing algorithms compact routing tables Kolmogorov complexity incompressibility method random graphs average-case complexity space complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：