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

2023 Innovations in Power and Advanced Computing Technologies, i-PACT 2023

作者： Shukla, Kumar A. Vaidh, Somay Choudhary, Ayush Adhikari, Soham Mandal, Debangan Thakur, Ayush School of CSE Vellore Institute of Technology Vellore India

ISBN: (纸本)9798350325188

To address the growing need for smart and connected devices in the Internet of Things (IoT), numerous routing algorithms have been developed to optimise communication in wireless sensor networks. In this paper, we describe a novel routing algorithm for IoT applications based on the energy-efficient clustering protocol (EECP). To improve network lifetime and minimise energy usage, the suggested method considers aspects such as energy consumption, network connection, and node mobility. We used real-world IoT data from a wireless sensor network to assess the performance of the suggested algorithm. We ran a series of simulations and statistical analyses to assess algorithm performance in terms of energy consumption, network lifetime, and network connectivity. Our findings show that the suggested routing method is effective for energy-efficient communication in wireless sensor networks for IoT applications. We also perform anomaly detection in the dataset to detect the anomalies. © 2023 IEEE.

关键词： Clustering Internet of Things routing algorithm Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

An Optimized Frame-Driven routing algorithm for Reconfigurable SRAM-Based FPGAs

引用

IEEE ACCESS 2020年 8卷 116226-116238页

作者： Bozzoli, Ludovica Sterpone, Luca Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy

Reconfigurable SRAM-based Field Programmable Gate Arrays (FPGAs) are everyday more attractive due to their high integration, performance, flexibility, and upgradability. Run-time reconfiguration improves the reconfigurable computing paradigm allowing to rewrite just a portion of the FPGA configuration memory on-line. This enhances the flexibility and provides opportunities for new high-performing architectures able to adjust in-flight the hardware to the current payload. However, the performance of reconfigurable architectures is bounded by the efficiency of the reconfiguration procedure, which in turn is bounded by the amount of configuration frames to be rewritten in the memory. Furthermore, the lack of tools and design software to implement optimized reconfigurable architectures makes their performance less efficient than expectation. In this work, we propose an approach to enhance the performance of reconfigurable systems by reducing the reconfiguration time of reconfigurable resources. Our method is based on a frame-driven routing algorithm able to drastically reduce the number of configuration memory frames used in the design. We evaluate the optimization achieved with our algorithm on several benchmark circuits of different size and we investigate the performance and the routability for different placement solutions. Experimental results confirm that our approach reduces the reconfiguration time up to 40% with respect to traditional reconfiguration approaches for a wide range of circuits.

关键词： Field programmable gate arrays routing Switches Hardware Tools Clocks Memory management Frame partial reconfiguration reconfiguration time routing algorithm SRAM-based FPGAs

来源：评论

学校读者我要写书评

暂无评论

Vehicular Delay Tolerant Network routing algorithm Based on Bayesian Network

引用

IEEE ACCESS 2020年 8卷 18727-18740页

作者： Wu, Jiagao Guo, Yahang Zhou, Hongyu Shen, Lu Liu, Linfeng Nanjing Univ Posts & Telecommun Sch Comp Nanjing 210023 Peoples R China Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Peoples R China

Delay Tolerant Networks (DTNs) are novel wireless mobile networks, which suffer from frequent disruption, high latency, and the lack of a complete path from source to destination. Vehicular Delay Tolerant Network (VDTN) is a special type of DTNs with vehicles as nodes. In VDTN, most nodes have specific movement patterns, however, traditional routing algorithms in DTNs do not take this characteristic into considerations very well. In this paper, a new routing algorithm based on Bayesian Network (BN) is proposed to construct the prediction model, which intends to predict the movement patterns of nodes in the real VDTN scenarios. Firstly, a comprehensive BN model is established, where more attributes of nodes are selected to improve the accuracy of the model prediction. Then, considering the complexity of the structure learning problem of BN, a novel structure learning algorithm, K2 algorithm based on Genetic algorithm (K2-GA), is proposed to search the optimal BN structure efficiently. At last, Junction Tree algorithm (JTA) is adopted in the inference of BN, which can accelerate the inference process through variable elimination and calculation sharing for large scale BN. The simulation results show that the proposed VDTN routing algorithm based on the BN model can improve the delivery ratio with a minor forwarding overhead.

关键词： Vehicular delay tolerant network routing algorithm Bayesian network genetic algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks

引用

COMPUTER NETWORKS 2008年第3期52卷 531-541页

作者： Chang, Tai-Jung Wang, Kuochen Hsieh, Yi-Ling Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

Wireless sensor networks (WSNs) with nodes spreading in a target area have abilities of sensing, computing, and communication. Since the GPS device is expensive, we used a small number of fixed anchor nodes that are aware of their locations to help estimate the locations of sensor nodes in WSNs. To efficiently route sensed data to the destination (the server), identifying the location of each sensor node can be of great help. We adopted a range-free color-theory based dynamic localization (CDL) [Shen-Hai Shee, Kuochen Wang, I.L. Hsieh, Color-theory-based dynamic localization in mobile wireless sensor networks, in: Proceedings of Workshop on Wireless, Ad Hoc, Sensor Networks, August 2005] approach, to help identify the location of each sensor node. Since sensor nodes are battery-powered, we propose an efficient color-theory-based energy efficient routing (CEER) algorithm to prolong the life time of each sensor node. The uniqueness of our approach is that by comparing the associated RGB values among neighboring nodes, we can efficiently choose a better routing path with energy awareness. Besides, the CEER has no topology hole problem. Simulation results have shown that our CEER algorithm can save up to 50-60% energy than ESDSR [Mohammed Tarique, Kemal E. Tepe, Mohammad Naserian, Energy saving dynamic source routing for ad hoc wireless networks, in: Proceedings of Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, April 2005, pp. 305-310] in mobile wireless sensor networks. In addition, the latency per packet of CEER is 50% less than that of ESDSR. (c) 2007 Elsevier B.V. All rights reserved.

关键词： color-theory-based energy saving localization mobile wireless sensor network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Low Power and Low Area Router With Congestion-Aware routing algorithm for Spiking Neural Network Hardware Implementations

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2021年第1期68卷 471-475页

作者： Pu, Junran Goh, Wang Ling Nambiar, Vishnu P. Anh Tuan Do Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore ASTAR IC Design Dept Inst Microelect IME Singapore Singapore

Neuromorphic (NC) designs have gained significant interest in recent hardware research due to its low-power consumption. Low-power and low-latency router design is one of the most critical component to ensure NC hardware's scalability and energy efficiency. Various router designs have been proposed to achieve high performance. However, this leads to complex router architectures and thus high area and power consumption. Furthermore, non-uniform traffic patterns of spiking neurons can cause network congestion and unnecessary power consumption. In this brief, we propose a congestion-aware routing algorithm to alleviate the congestion of routers in the middle and reduce network latency. Besides, a globally asynchronous, locally synchronous low-cost router architecture is deployed to relax the global clock tree constraint at chip level. Finally, a novel clock gating circuit is proposed to reduce the dynamic power consumption of routers. Our results show that averagely it reduces the router power consumption by more than 50%. The proposed router achieves ultra-low energy consumption of 2.3x 10(-2) pJ/bit and a small area of only 0.007 mm(2).

关键词： Network-on-chip routing algorithm arbitration scheme clock gating spiking neural network

来源：评论

学校读者我要写书评

暂无评论

A Novel Graph-Based routing algorithm in Residential Multimicrogrid Systems

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2021年第3期17卷 1774-1784页

作者： Razi, Reza Pham, Minh-Cong Hably, Ahmad Bacha, Seddik Tran, Quoc Tuan Iman-Eini, Hossein Univ Tehran Coll Engn Sch Elect & Comp Engn Tehran *** Iran Univ Grenoble CNRS G2Elab Grenoble INP F-38031 Grenoble France Univ Grenoble Grenoble INP CNRS GIPSA Lab F-38400 St Martin Dheres France Alternat Energies & Atom Energy Commiss Natl Inst Solar Energy F-73370 Le Bourget Du Lac France

The complementary energy exchange between residential microgrids aims at decreasing the dependence on the main grid, reducing the size and cost of the energy storage units, and increasing energy efficiency. In this regard, the use of a power router interface to connect the microgrids to the power system is necessary for controlling bidirectional power and data flow, which will build the core of the future Energy Internet. In fact, the power router is served as an energy exchange center that enables energy flow between microgrids. One of the most important factors in determining multimicrogrid system performance is the energy routing algorithm strategy. In this article, a new routing algorithm is proposed based on the graph theory. The objective of the proposed algorithm is to minimize the overall power losses with respect to congestion and reliability. Therefore, the best set of loads, optimal sources, and no-congestion minimum loss paths are determined. Various analysis cases have been investigated to confirm the performance and flexibility of the proposed algorithm. A novel case study with multisources and multiloads is addressed, which has not been previously analyzed with the application of power routers. In addition, the developed algorithm is compared with other existing algorithms in terms of power loss minimization, different scenarios, congestion management, computation time, and complexity.

关键词： routing Microgrids Informatics Peer-to-peer computing Graph theory Electronic mail Energy storage Energy Internet (EI) graph theory power losses power router (PR) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on WSN Intelligent routing algorithm based on Bayesian Learning and Particle Swarm Optimization

引用

RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING 2024年第3期17卷 304-315页

作者： Jia, Songhao Yang, Cai Yang, Jizheng Zhang, Haiyu Chen, Xing Nanyang Normal Univ Coll Comp Sci & Technol Nanyang Peoples R China Henan Polytech Inst Fac Elect Informat Engn Nanyang Peoples R China

Background Wireless sensor networks have the characteristics of strong scalability, easy maintenance, and self-organization, but the energy of nodes is limited and it is difficult to replace the energy supply module. The survival time of the network has always been the key to restricting the development of wireless sensor *** Aiming at the problems of short network lifetime and low coverage, a multi-objective optimization routing algorithm has been proposed, focusing on how to balance the communication energy consumption of each node in the network and improve the coverage area of the remaining *** Firstly, the node region was divided into several fan ring subregions. Then, the particle swarm optimization algorithm was used to find the fan angles and radii of each fan ring subregion. Next, Bayesian learning was used to select the appropriate cluster *** The simulation results showed the convergence speed of the proposed algorithm to be improved, solving the problems of cluster head election and node routing planning, improving the utilization of node energy, and verifying the *** The particle swarm optimization algorithm and Bayesian learning have been introduced to cluster network nodes, and a multi-objective fitness function compatible with the energy consumption and coverage of network nodes has been designed. By optimizing the selection method of convergence nodes, the network communication cost of each node can be effectively balanced, and the speed of network coverage area reduction can be effectively reduced in the later period of node communication.

关键词： Wireless sensor network routing algorithm particle swarm optimization Bayesian learning method regional segmentation dynamic nodes multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm FOR MPLS TRAFFIC ENGINEERING IN LEO SATELLITE CONSTELLATION NETWORK

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2013年第10期9卷 4139-4149页

作者： Pan, Chengsheng Du, Huanhuan Liu, Qingli Dalian Univ Univ Key Lab Commun & Signal Proc 10 Xuefu St Dalian 116622 Peoples R China Dalian Univ Key Lab Commun Networks & Informat Proc Dalian 116622 Peoples R China Dalian Univ Coll Informat Engn Dalian 116622 Peoples R China

With regard to the limited link time of the inter-satellite links in LEO satellite constellation network, this paper proposes a routing algorithm which takes the limited link time into account, and supports traffic engineering. The routing algorithm is based on MPLS satellite network. The initial weight of links is defined to be function of residual bandwidth and link time. And during the weight adjustment period, link weight is dynamically changed by its critical degree. The algorithm can improve short communication time and limited total network traffic that caused by the link handover. Simulation results show that the algorithm has a good performance in terms of request rejection rate, average traffic per node and total network traffic.

关键词： LEO satellite constellation network routing algorithm MPLS Minimum interference algorithm

来源：评论

学校读者我要写书评

暂无评论

Variable ferry routing algorithm for sparse wireless sensor networks

引用

INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS 2016年第2-3期8卷 196-205页

作者： Tong Ning Zhang Xue Wang ChunShuang Hun Jiexu Dalian Jiaotong Univ Software Technol Inst 216 Xingfa Rd Dalian 116051 Liaoning Peoples R China Dalian Jiaotong Univ Sch Foreign Languages 794 Huanghe Rd Dalian 116028 Liaoning Peoples R China

In this paper, a ferry-based sparse wireless sensor network is considered, in which information is transferred between ferries and sensors. And a triangulation algorithm and triangular mesh colouring strategy for constructing a ferry route are presented. A moving ferry, while moving along the predetermined route, can cover the entire network, and the related theorems are presented. We propose a variable ferry routing scheme (VFR) in order to reduce the energy consumption of ferries. Through theoretical analysis, the relationship is discussed between key parameters of the system, including message generation interval, message delivery probability and the number of ferries. During the routing process, the number of active ferries is adjusted. Compared to other existing routing algorithms, the simulation results of our scheme demonstrate that VFR minimises the message delivery delay and the overhead radio. Moreover, VFR reduces the energy consumption of ferries.

关键词： wireless sensor networks WSNs ferry routing algorithm triangulation algorithm energy consumption queuing theory

来源：评论

学校读者我要写书评

暂无评论

An improved AODV routing algorithm based on energy consumption for Ad Hoc networks

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2023年第2期23卷 887-898页

作者： Cai, Zengyu Chen, Xi Wang, Zhikun Zhang, Jianwei Zhengzhou Univ Light Ind Sch Comp & Commun Engn Zhengzhou Henan Peoples R China Zhengzhou Univ Light Ind Software Engn Coll Zhengzhou 450002 Henan Peoples R China China Unicom Luoyang Branch Luoyang Henan Peoples R China Henan Key Lab Food Safety Data Intelligence Zhengzhou Henan Peoples R China

The Ad Hoc networks solves the problem of quickly establishing a temporary Ad Hoc network without the need for fixed facilities. However, problems such as network performance degradation, delay increase, and link interruption are endless. Aiming at the problem of shortening the survival time of Ad Hoc networks nodes, this paper proposes an improved AODV routing algorithm EC-MAODV (Energy Consumption-Modification AODV) based on energy consumption. EC-MAODV takes energy as the starting point, determines the time extension based on the residual energy of the current node, balance the power consumption of each node, and extends the networks lifetime. The effectiveness of EC-MAODV routing algorithm is proved by network simulator NS-3. The simulation results show that compared with the AODV routing protocol, the algorithm in this paper has more than 7% improvement and 19% increase in average delay and node lifetime. It can effectively prolong the life of the network, reduce the number of dead nodes, effectively solve the energy consumption problem of the wireless Ad Hoc network, and improve the overall performance of the network.

关键词： Ad Hoc networks AODV energy consumption NS-3 simulation EC-MAODV protocol routing protocol routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：