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

Model-based evaluation of the power versus performance of network routing algorithms

COMPUTING 2021年第8期103卷 1723-1746页

作者： Asadi, Ali Naghash Azgomi, Mohammad Abdollahi Entezari-Maleki, Reza Iran Univ Sci & Technol Sch Comp Engn Trustworthy Comp Lab Tehran Iran Iran Univ Sci & Technol Sch Comp Engn Hengam StResalat Sq Tehran *** Iran Iran Univ Sci & Technol Sch Comp Engn Tehran Iran

In order to optimize traffic flows and power consumption of network components, various green routing algorithms and protocols have been proposed. These algorithms and protocols apply different techniques to attain their own goals. One of the most important techniques is the sleep-scheduling technique that switches the status of the network components, nodes or links, into active/inactive modes. There are four characteristics affecting the power and performance of communication networks which distinguish green routing algorithms and protocols, namely the sleep-scheduled component, decision structure, network traffic awareness, and quality of service awareness. In this paper, a method is proposed to model, evaluate, and compare the power and performance of the green routing algorithms that use the sleep-scheduling technique. We apply stochastic activity networks to model and analyze the routing algorithms with respect to the network topology. The results obtained from the comparison of the algorithms, validated with the OMNeT++ simulator, can be used by network administrators to make the right decisions.

关键词： routing algorithms Power-aware networking Performance modeling Stochastic activity network (SANs) OMNeT plus plus simulator

来源：评论

学校读者我要写书评

暂无评论

A Comparative Analysis of State-of-Art Cluster-Based routing algorithms in Wireless Sensor Network 3

A Comparative Analysis of State-of-Art Cluster-Based Routing...

引用

3rd International Conference on Intelligent Engineering and Management, ICIEM 2022

作者： Kaur, Supreet Grewal, Vinit Guru Nanak Dev University Regional Campus Department of ECE Jalandhar India

ISBN: (数字)9781665467568

ISBN: (纸本)9781665467568

Since the development of the Wireless Sensor Network (WSN), the main emphasis has been on saving the energy of the sensor nodes employed for sensing and collecting the data from the remote or target areas. In this regard, various routing algorithms have been proposed. As learned from the literature, the cluster-based routing algorithms have outperformed the conventional and traditional routing approaches as it balances the load distribution among sensor nodes according to the energy availability of the nodes. In this paper, the primary focus is on the discussion of state-of-art cluster-based routing algorithms, in addition, the simulation-based comparison is also presented to highlight the significant routing protocol that addresses the issue of limited energy of sensor nodes. The simulations have been performed by considering various factors namely, the first, half, and last dead nodes individually. Furthermore, the throughput comparison is also given for the considered routing algorithms. This paper will help the researchers to select a suitable routing approach for their application. © 2022 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Adapting routing algorithms to Programmable Photonic Circuits

Adapting Routing Algorithms to Programmable Photonic Circuit...

引用

2022 European Conference on Optical Communication, ECOC 2022

作者： Kerchove, Ferre Vanden Chen, Xiangfeng Colle, Didier Bogaerts, Wim Pickavet, Mario Ghent University - Imec IDLab Department of Information Technology Belgium Ghent University - Imec Photonic Research Group Department of Information Technology Gent Belgium Center of Nano and Biophotonics Ghent University Belgium

The ever-increasing size of programmable photonic integrated circuits necessitates the development of specialised routing algorithms, capable of handling different mesh architectures and magnitudes. We develop an algo... 详细信息

ISBN: (纸本)9781957171159

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Review on sink mobility-based routing algorithms in WSN proposed in the Year 2022 5

Review on sink mobility-based routing algorithms in WSN prop...

引用

5th International Conference on Contemporary Computing and Informatics, IC3I 2022

作者： Kaur, Supreet Grewal, Vinit Guru Nanak Dev University Department of ECE Regional Campus Jalandhar India

ISBN: (纸本)9798350398267

Through the Wireless Sensor Network (WSN), researchers have made every effort in advancing sensing technology worldwide. However, the essence of communication is deeply affected by the limited battery operating nature of sensor nodes. A lot of research efforts are reported that deal with this concern. Besides, the routing algorithms that tend to promise energy-efficient and optimized routing still fail to achieve optimized performance. Henceforth, sink mobility is one of the eminent solutions that tend to optimize the network through energy-saving routing strategies. In this paper, we have reviewed the sink mobility-based routing algorithms that are proposed for the Year 2022. We believe this review will help the readers to improvise the routing strategy by identifying the research gaps in the existing techniques. © 2022 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

UAV Ad Hoc Network routing algorithms in Space-Air-Ground Integrated Networks: Challenges and Directions

引用

DRONES 2023年第7期7卷

作者： Lu, Yuxi Wen, Wu Igorevich, Kostromitin Konstantin Ren, Peng Zhang, Hongxia Duan, Youxiang Zhu, Hailong Zhang, Peiying China Univ Petr East China Qingdao Inst Software Coll Comp Sci & Technol Qingdao 266580 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Guangzhou Univ Sch Comp Sci & Cyber Engn Guangzhou 510006 Peoples R China South Ural State Univ Dept Phys Nanoscale Syst 76 Lenin Ave Chelyabinsk 454080 Russia China Univ Petr East China Coll Oceanog & Space Informat Qingdao 266580 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

With the rapid development of 5G and 6G communications in recent years, there has been significant interest in space-air-ground integrated networks (SAGINs), which aim to achieve seamless all-area, all-time coverage. As a key component of SAGINs, flying ad hoc networks (FANETs) have been widely used in the agriculture and transportation sectors in recent years. Reliable communication in SAGINs requires efficient routing algorithms to support them. In this study, we analyze the unique communication architecture of FANETs in SAGINs. At the same time, existing routing protocols are presented and clustered. In addition, we review the latest research advances in routing algorithms over the last five years. Finally, we clarify the future research trends of FANET routing algorithms in SAGINs by discussing the algorithms and comparing the routing experiments with the characteristics of unmanned aerial vehicles.

关键词： unmanned aerial vehicles flying ad hoc network routing algorithms space-air-ground integrated

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Quality of Service of Opportunistic Mobile Ad Hoc Network routing algorithms on Real Devices: A Software-Driven Approach

SSRN

引用

SSRN 2024年

作者： Jesús-Azabal, Manuel García-Alonso, José Galán-Jiménez, Jaime Departamento de Ingeniería Sistemas Informáticos y Telemáticos Universidad de Extremadura Avenida de Elvas S/N Badajoz Extremadura06006 Spain

Opportunistic Mobile Ad Hoc Networks (MANETs) offer a versatile solution in contexts where the Internet is unavailable. These networks facilitate transmissions between endpoints using a store-carry-forward strategy, allowing information to be stored during periods of disconnection. Consequently, selecting the next hop in the routing process becomes a significant challenge for nodes, particularly due to its impact on Quality of Service (QoS). routing strategies are therefore crucial in opportunistic MANETs, but their deployment and evaluation in real scenarios can be challenging. In response to this context, this paper introduces a monitoring software-driven tool designed to evaluate the QoS of routing algorithms in physical opportunistic MANETs. The implementation and its components are detailed, along with a case study and the outcomes provided by an implementation of the proposed solution. The results demonstrate the effectiveness of the proposed tool in enabling the analysis of routing protocols in real scenarios, highlighting significant differences with simulation results: mobility patterns in simulations tend to be inaccurate and overly optimistic, leading to a higher delivery probability and lower latency than what is observed in the real testbed. © 2024, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed Decomposition and routing algorithms in Minor-Free Networks and Their Applications

arXiv

引用

arXiv 2023年

作者： Chang, Yi-Jun National University of Singapore Singapore

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely useful tool in designing algorithms, as it allows us to shift from the general graph setting to the low-diameter graph setting, where brute-force information gathering can be done efficiently. Chang and Su [PODC 2022] showed that any high-conductance network excluding a fixed minor contains a high-degree vertex v*, so the entire graph topology can be gathered to v* efficiently in the CONGEST model using expander routing. Therefore, in networks excluding a fixed minor, many problems that can be solved efficiently in LOCAL via low-diameter decomposition can also be solved efficiently in CONGEST via expander decomposition. In this work, we show improved decomposition and routing algorithms for networks excluding a fixed minor. We define an (ǫ, D, T)-decomposition of G = (V, E) as a partition of V into clusters of diameter at most D with at most ǫ|E| inter-cluster edges such that information gathering in each cluster can be done in T rounds in parallel. We show that an (ǫ, D, T)-decomposition with D = O(ǫ−1) and T = min n 2O(log2 1 ǫ) · O (log ∆), poly(ǫ−1, log ∆) o can be computed deterministically in O(ǫ−1 log∗ n) + min n 2O(log2 1 ǫ) · O (log ∆), poly(ǫ−1, log ∆) o rounds in networks excluding a fixed minor in the CONGEST model. Our algorithm has a wide range of applications, including the following results in CONGEST. • A (1 − ǫ)-approximate maximum independent set in a network excluding a fixed minor can be computed deterministically in O(ǫ−1 log∗ n) + poly(ǫ−1) rounds, nearly matching the Ω(ǫ−1 log∗ n) lower bound of Lenzen and Wattenhofer [DISC 2008]. • Property testing of any additive minor-closed property can be done deterministically in O(log n) rounds if ǫ is a constant or O(ǫ−1 log n) + poly(ǫ−1) rounds if ∆ is a constant, nearly matching the Ω(ǫ−1 log n) lower bound of Levi, Medina, and Ron [PODC 2018]. Copyright © 2023, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

MIROR: A middleware software tool for interfacing mobile industrial robots with optimization routing algorithms

引用

SOFTWAREX 2022年 17卷

作者： Syrmos, Evangelos Bechtsis, Dimitrios Tsolakis, Naoum Int Hellen Univ Sch Engn Dept Ind Engn & Management Thessaloniki Greece Int Hellen Univ Sch Econ & Business Adm Dept Supply Chain Management Katerini Greece

Mobile robots are extensively used in flexible manufacturing systems and intra-logistics on a 24/7 basis to address demand fluctuations, increase productivity and promote environmental, economic and social sustainability. In this regard, routing algorithms are used to navigate mobile industrial robots for optimizing shop-floor logistics operations. However, open-source tools and software libraries implementing routing algorithms provide limited real-world relevance via indicatively neglecting the physical operating environment's characteristics and the kinematics of mobile robots. To this effect, this research designs, analyzes and develops MIROR, a middleware software tool that interfaces mobile industrial robots with route optimization algorithms to deliver a sophisticated testing environment that: (i) applies routing algorithms for the optimal logistics of mobile robots in customized industrial facility layouts;(ii) allows the comparison of the resulting algorithmic outcomes to inform about effective and efficient routing options;and (iii) creates optimal routing plans for informing the logistics operations of equivalent real-world mobile robots in industrial manufacturing settings. Specifically, MIROR integrates open-source Operations Research tools and the Robot Operating System to simulate and explore alternative logistics scenarios for mobile robots in 3D recreated industrial manufacturing facilities. To a greater extent, MIROR allows the transfer of the optimal routing code to equivalent real-world vehicles. Specifically, the implemented middleware tool handles variations of the Traveling Salesman Problem and generates feasible routes in complex facility layouts considering a variety of mobile robots. Academics and practitioners could benefit from the user-friendly interface of MIROR to generate realistic scheduling and routing options for the optimal planning of the logistics operations of mobile industrial robots in manufacturing environments. (C) 2021 The

关键词： routing algorithms Logistics optimization Mobile industrial robots Traveling Salesman Problem Middleware software tool Industry 4.0

来源：评论

学校读者我要写书评

暂无评论

Model-Based and Machine Learning Approaches for Designing Caching and routing algorithms 12th

Model-Based and Machine Learning Approaches for Designing Ca...

引用

12th EAI International Conference on Ad Hoc Networks, AdHocNets 2020

作者： Kulkarni, Adita Seetharam, Anand Department of Computing Sciences SUNY Brockport Brockport United States Department of Computer Science SUNY Binghamton Binghamton United States

ISBN: (纸本)9783030673680

In this paper, we compare and contrast model-based and machine learning approaches for designing caching and routing strategies to improve cache network performance (e.g., delay, hit rate). We first outline the key principles used in the design of model-based strategies and discuss the analytical results and bounds obtained for these approaches. By conducting experiments on real-world traces and networks, we identify the interplay between content popularity skewness and request stream correlation as an important factor affecting cache performance. With respect to routing, we show that the main factors impacting performance are alternate path routing and content search. We then discuss the applicability of multiple machine learning models, specifically reinforcement learning, deep learning, transfer learning and probabilistic graphical models for the caching and routing problem. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Preliminary results of OLSR based MANET routing algorithms: OLSRd2-Qx reinforcement learning agents and ODRb

Preliminary results of OLSR based MANET routing algorithms: ...

引用

2021 International Conference on Military Communication and Information Systems, ICMCIS 2021

作者： Maret, Yann Wagen, Jean-Frederic Raza, Mohsin Wang, Junyuan Bessis, Nik Legendre, Franck Edge Hill University Ormskirk United Kingdom U. of Applied Sciences of Western Switzerland HES-SO Fribourg Switzerland Tongji University Shanghai China Armasuisse Thun Switzerland

ISBN: (纸本)9781665445863

In MANETs, congestion typically occurs on the interconnecting nodes between two or more groups of nodes. routing to avoid the congested nodes via alternate, perhaps longer paths, allows more throughput, e.g., 50% more in the canonical 9-node 2-ring scenario. OLSR-Q is based on the routing protocol OLSR and a reinforcement learning (RL) agent to learn the most appropriate link states or "Directional Air Time"metric to avoid the congested nodes. The challenges for the RL agent are (1) to avoid congestion before packets are dropped and (2) to minimize the number of real valued or discrete observations or states. In this paper, three simplified OLSRd2-Qx versions are presented and compared to OLSRd2 and a centralized ODRb, Omniscient Dijkstra routing-balanced, algorithm. The proposed OLSRd2-Qload algorithm provides the expected 50% increase in throughput on the 9-node 2-ring scenario with a specific test traffic scenario. On the NATO IST-124 Anglova scenario, and using an acknowledged message application, the Q-learning agents remain to be improved. The superior results of the centralized load balancing approach taken in ODRb will be investigated to train multi-agents systems including OLSR-Q. © 2021 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：