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

PDAU: A new exploitation of routing strategy in adhoc network

International Journal of Mobile Network Design and Innovation 2020年第1期10卷 35-47页

作者： Raskar, Sandeep Balu Iyer, Kamatchi Computer Science and Engineering Amity University Mumbai Maharashtra410206 India

Generally, routing is the process of selecting a path for traffic in a network, or across multiple networks. The routing strategy usually struck with the issue of shortest path routing (SPR). A number of routing models is already in progress but, still the challenges rise with some real-world applications. This routing strategy impresses to focus on solving these issues by considering delay, energy and total fitness. This paper introduces a new routing algorithm for solving the issues faced in route establishment and route recovery as well. This paper also uses neural network (NN) model to predict the node movements in adhoc network. More importantly, the major optimal route selection problem is solved here by introducing a new hybrid algorithm. The proposed model, probability-based dragonfly (DA) with artificial bee colony (ABC) update (PDAU) compares its performance over other conventional methods in terms of delay, energy and total fitness. Copyright © 2020 Inderscience Enterprises Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

FOG-RPL: Fog Computing-based routing Protocol for IoT Networks

引用

RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING 2024年第2期17卷 170-180页

作者： Verma, Ankit Deswal, Suman Deenbandhu Chhotu Ram Univ Sci & Technol Dept Comp Sci & Engn Murthal Haryana India

Background The Internet of Things (IoT) is widely used because of the connectivity of devices with the Internet which provides accessibility, quick transmission, and broader coverage. IoT networks provide vast connectivity but finding the best path for sharing information is a big challenge because of limited resources like limited power and limited bandwidth. The routing protocol for low power lossy network (RPL) is standard protocol but it selects a node that has already been selected in a busty *** The fog computing technique is combined with RPL and the new objective function is used to design FOG-RPL which is the optimum routing protocol that reduces the network load using the fog computing principle and selects the right node using the new objective *** The simulation is performed and experimental results show that FOG-RPL gives better results in terms of improvement and in terms of performance *** The FOG-RPL protocol uses the fog computing principle with a new objective function and performance analysis shows that as compared to the existing routing protocol, it is more efficient.

关键词： IoT networks routing protocols routing algorithms fog computing internet of things objective function

来源：评论

学校读者我要写书评

暂无评论

Multi-path data fusion method based on routing algorithm for wireless sensor networks

引用

International Journal of Computers and Applications 2021年第9期43卷 916-923页

作者： Wang, Fei-fei Hu, Hai-feng Information Engineering College Pingdingshan University Pingdingshan China

For the purpose of saving the resources of wireless sensor networks, it is necessary to fuse the existing data in wireless sensor networks. When using the current method to fuse data in wireless sensor networks, the fusing time is too long to remove the noise signal in wireless sensor networks effectively. In the process of fusing, data packet loss is easy to occur. There are some problems such as low fusion efficiency, poor denoising performance and high packet loss rate. A multi-path data hierarchical fusion method based on routing algorithm is proposed in this paper. The redundant node decision method based on mesh partitioning is combined with the grid algorithm and EECRS protocol to establish a routing protocol based on redundant node elimination, and the redundant data existing in the redundant nodes of the wireless sensor network is removed. Based on the statistical data of the data, the probability density function is deduced and analyzed, and the noise filtering matrix is constructed to optimize the measurement matrix and remove the noise existing in the wireless sensor network. The multi-path scheduling technology is used to synthesize the pheromone table and the data forwarding flow table, and the ant is used to actively monitor the link QOS real-time information in the path finding process to update the pheromone table and the flow table, and calculate the link idle rate according to the update result. According to the calculation result, the data transmission path is selected, and the multi-path data layer fusion is completed. The experimental results show that the proposed method has high fusion efficiency, good denoising performance and low packet loss rate. © 2019 Informa UK Limited, trading as Taylor & Francis Group.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving the routing performance in optical networks by an optimised BFS algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY 2023年第2期71卷 130-140页

作者： Da Silva, Juliano Antonio Thomas, Djeisson Hoffmann De Castro, Fernando Cesar Fed Univ St Maria Elect & Comp Dept Santa Maria RS Brazil

The procedure of routing and wavelength assignment became a limiting factor for new applications in Optical Networks (ONs) due to the faster dynamic and greater unpredictability of service requests. The need for quick service recovery in the event of failures is also a crucial aspect which depends on this procedure. The present work proposes a new assignment of alternative routes able to comply to any data service request in ONs. The assignment procedure is based on the distinction by low correlation between paths, on the available bandwidth of different paths and on the latency for the establishment of communication between network nodes. In such context, an improvement of the Breadth-First Search (BFS) algorithm is proposed and tested with parameters from a real-world system, resulting in a good performance to find alternative routes and to classify them according to the best score obtainable, independently of the source or destiny nodes.

关键词： optical networks optical network performance optimisation routing in optical networks RWA routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A search space reduction algorithm for improving the performance of a GA-based QoS routing method in ad-hoc networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2007年第1期3卷 41-57页

作者： Barolli, Leonard Ikeda, Makoto De Marco, Giuseppe Durresi, Arjan Koyama, Akio Iwashige, Jiro Fukuoka Inst Technol Dept Informat & Commun Engn Higashi Ku Fukuoka 8110295 Japan Fukuoka Inst Technol Grad Sch Engn Higashi Ku Fukuoka Japan Louisiana State Univ Dept Comp Sci Baton Rouge LA 70803 USA Yamagata Univ Dept Informat Yamagata 990 Japan

A lot of work has been done on routing in MANETs. However, the proposed routing solutions deal only with the best effort data traffic. Connections with Quality of Service (QoS) requirements are not supported. The QoS routing has been receiving increasingly intensive attention in the wireline network domain. However, for MANETs only few QoS routing algorithms are proposed. For MANETs, approximated solutions and heuristic algorithms should be developed and QoS routing algorithms should be adaptive, flexible, and intelligent. In our previous work, we proposed a Genetic Algorithm (GA) based routing method for Mobile Ad-hoc Networks (GAMAN). In this paper, we enhance the proposed algorithm by adding an effective topology extraction algorithm to reduce the search space of GAMAN. We call this algorithm E-GAMAN. The E-GAMAN uses two QoS parameters for routing. The performance evaluation via simulations show that E-GAMAN has a good performance.

关键词： Ad hoc networks Mobile ad hoc networks Heuristic algorithms routing algorithms algorithms Network routing Performance Evaluation Quality of service

来源：评论

学校读者我要写书评

暂无评论

A simple routing algorithm based on Schnyder coordinates

引用

THEORETICAL COMPUTER SCIENCE 2013年 494卷 112-121页

作者： He, Xin Zhang, Huaming SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA Univ Alabama Dept Comp Sci Huntsville AL 35899 USA

Geometric routing is an elegant way for solving network routing problems. The essence of this routing scheme is the following: When an origin vertex u wants to send a message to a destination vertex w, it forwards the message to a neighbor t, solely based on the location information of u, w and the neighbors of u. In its simplest form, greedy routing, a message is simply forwarded to a neighbor that is closer to the destination. A greedy drawing of a graph G is an embedding of G for which the greedy routing algorithm works. Recently, Leighton and Moitra (2010) [18] found an algorithm that produces an embedding of any 3-connected planar graph in R-2 that supports greedy routing. A similar result was independently found by Angelini et al. (2010) [2]. One main drawback of these algorithms is that they need Omega(n log n) bits to represent the coordinates of the vertex locations. This is the same space usage as traditional routing table approaches, and hence makes greedy routing infeasible in applications. In the greedy routing scheme, the routing decision is based on decreasing distances between vertex locations. For this idea to work, however, the routing decision does not have to be based on decreasing distances. As long as the routing decision is solely based on the location information of the source, the destination, and the neighbors of the source, the geometric routing scheme will work fine. In this paper, we introduce a new model of geometric routing. Instead of relying on decreasing distance for routing decisions, our algorithm uses other criterion to determine the routing path, solely based on location information. Our routing algorithms are based on Schnyder coordinates which are derived from Schnyder realizers for plane triangulations and Schnyder woods for 3-connected plane graphs. The coordinates of vertex locations consist of three integers between 0 and 2n, hence the representation only needs O(log n) bits. In order to send a message from the origin u to

关键词： routing algorithms GEOMETRIC modeling PROBLEM solving INFORMATION storage & retrieval systems EMBEDDING theorems DECISION making

来源：评论

学校读者我要写书评

暂无评论

An adaptive and fault-tolerant routing algorithm for meshes

An adaptive and fault-tolerant routing algorithm for meshes

引用

International Conference on Computational Science and Its Applications (ICCSA 2008)

作者： Shamaei, A. Sarbazi-Azad, H. Sharif Univ Technol Payame Noor Univ Tehran Iran Sharif Univ Technol IPM Tehran Iran

ISBN: (纸本)9783540698388

We propose a partially adaptive fault-tolerant and deadlock-free routing algorithm in n-dimensional meshes based on the fault-tolerant planar-adaptive routing and Duato's protocol. In particular, we show that only four virtual channels per physical channel are sufficient for tolerating multiple faulty regions even in the case of n-dimensional meshes. Our scheme is able to handle faulty blocks whose associated fault rings have overlaps. In addition, it can be used to route messages when fault regions touch the boundaries of the mesh. A flag bit is introduced for guiding misrouted messages. Messages are routed adaptively in healthy regions of the network. Once a message faces a faulty region, it is routed around it using a non-minimal path. A flit-level simulator is employed to evaluate the performance of the proposed algorithm and to compare its performance to those already introduced.

关键词： interconnection networks routing algorithms fault-tolerance adaptive routing performance evaluation

来源：评论

学校读者我要写书评

暂无评论

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

引用

9th International Conference on Distributed Computing and Networking

作者： Durocher, Stephane Kirkpatrick, David Narayanan, Lata McGill Univ Sch Comp Sci Montreal PQ Canada Univ British Columbia Dept Comp Sci Vancouver BC Canada Concordia Univ Dept Comp Sci Montreal PQ Canada

ISBN: (纸本)9783540774433

We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v's routing decision only depends on knowledge of the labels of the source and destination nodes, of the subgraph induced by nodes within distance k of v, and of the neighbour of v from which the message was received. We model a three-dimensional ad hoc network by a unit ball graph, where nodes are points in R 3, and nodes u and v are joined by an edge if and only if the distance between u and v is at most one. The question of whether there is a simple local routing algorithm that guarantees delivery in unit ball graphs has been open for some time. In this paper, we answer this question in the negative: we show that for any fixed k, there can be no k-local routing algorithm that guarantees delivery on all unit ball graphs. This result is in contrast with the two-dimensional case, where 1-local routing algorithms that guarantee delivery are known. Specifically, we show that guaranteed delivery is possible if the nodes of the unit ball graph are contained in a slab of thickness 1/root 2. However, there is no k-local routing algorithm that guarantees delivery for the class of unit ball graphs contained in thicker slabs, i.e., slabs of thickness 1/root 2 + epsilon for some epsilon > 0. The algorithm for routing in thin slabs derives from a transformation of unit ball graphs contained in thin slabs into quasi unit disc graphs, which yields a 2-local routing algorithm. We also show several results that further elaborate on the relationship between these two classes of graphs.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Multipath routing Algorithm Based on Link Multi-metrics for Wireless Sensor Networks

A Multipath Routing Algorithm Based on Link Multi-metrics fo...

引用

International Colloquium on Computing, Communication, Control and Management

作者： Li, Yaqing Li, Layuan Wang, Chunyan Wuhan Univ Technol Dept Comp Sci & Technol Wuhan 430063 Hubei Peoples R China

ISBN: (纸本)9780769532905

In this paper we propose a multipath routing algorithm (EDB-MRA) on the basis of Directed Diffusion for wireless sensor networks. The algorithm establishes multiple paths from source node to destination node. According to the three metrics of network link - energy consumption, delay and bandwidth, each path can be given a choices probability to make data always transmit on multiple paths of better link performance. At last, we simulate the new multipath routing algorithm on the NS2, and make an analysis and compare with DD and HREEMR routing algorithm. The simulation result indicates that the new routing algorithm shows a good performance on node average energy consumption, average transmission delay and packet delivery rate.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Randomized Partially-Minimal routing: Near-Optimal Oblivious routing for 3-D Mesh Networks

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2012年第11期20卷 2080-2093页

作者： Ramanujam, Rohit Sunkam Lin, Bill Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92037 USA

The increasing viability of 3-D silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extension of 2-D mesh-based tiled chip-multiprocessor architectures into three dimensions. This paper focuses on efficient routing algorithms for such 3-D mesh networks. Existing routing algorithms suffer from either poor worst-case throughput (DOR, ROMM) or poor latency (VAL). Although the minimal routing algorithm O1TURN proposed in already achieves near-optimal worst-case throughput for 2-D mesh networks, the optimality result does not extend to higher dimensions. For 3-D and higher dimensional meshes, the worst-case throughput of O1TURN degrades tremendously. The main contribution of this paper is a new oblivious routing algorithm for 3-D mesh networks called randomized partially-minimal (RPM) routing. RPM provably achieves optimal worst-case throughput for 3-D meshes when the network radix is even and within a factor of 1/k(2) of optimal worst-case throughput when is odd. Finally, whereas VAL achieves optimal worst-case throughput at a penalty factor of 2 in average latency over DOR, RPM achieves (near) optimal worst-case throughput with a much smaller factor of 1.33. For practical asymmetric 3-D mesh configurations where the number of device layers are fewer than the number of tiles along the edge of a layer, the average latency of RPM reduces to just a factor of 1.11 to 1.19 of DOR. Additionally, a variant of RPM called randomized minimal first (RMF) routing is proposed, which leverages the inherent load-balancing properties of the network traffic to further reduce packet latency without compromising throughput.

关键词： 3-D ICs on-chip networks routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：