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

Energy Efficient Region based Source distributed routing algorithm for Sink Mobility in Underwater Sensor Network

EXPERT SYSTEMS WITH APPLICATIONS 2023年第1期233卷

作者： Pradeep, Shanmugam Bapu, Tapas Bapu Bathey Ramesh Rajendran, Radhika Anitha, Ramachandran SA Engn Coll Dept Elect & Commun Engn Chennai India SA Engn Coll Dept Comp Applicat Chennai India

The residual nodes energy consumption is a primary factor to extend the lifespan of network. Utilizing a sensor node's very low-power battery in Underwater Wireless Sensor Networks (UWSNs) is still a difficult task. To increase the network lifespan, this paper proposes an Energy Efficient Region based Source distributed routing algorithm for Sink Mobility in Underwater Sensor Network (EERSDRA-GCOP-UWSN). The proposed work consists of three Phases that are initialization phase, routing Phase and Data transmission. For initialization phase, sinks and the sensor nodes are initialized. For routing phase, Energy EERSDRA with sink mobility is employed to identify the region of sensor nodes. For data transmission phase, Geographic and Cooperative Opportunistic Protocol is proposed to select the best relay node on the basis of depth fitness factor. The proposed EERSDRA-GCOP-UWSN is evaluated with the performance metrics. Then performance of the EERSDRA-GCOPUWSN proposed method provides 18.409%, 13.843% and 23.768% high Network lifetime, 27.744%, 24.881% and 19.703% low energy consumption, 17.346%, 20.852% and 26.347% high throughput and 16.385%, 20.416% and 22.907% high PDR when compared to the existing methods such as, Energy-efficient regional based cooperative routing protocol with sink mobility for UWSN (EERCRP-UWSN), a safe energy efficient and cooperative routing protocol for UWSN (SEECRP-UWSN), geo-opportunistic routing protocols for improving the residual energy range (EEGORP-UWSN) methods respectively. Finally, the performance of the proposed method achieves better result while compared to the existing methods.

关键词： Energy Efficient Region based Source distributed routing algorithm Underwater wireless sensor networks Cooperative opportunistic protocol

来源：评论

学校读者我要写书评

暂无评论

Two-level distributed clustering routing algorithm based on unequal clusters for large-scale Internet of Things networks

引用

JOURNAL OF SUPERCOMPUTING 2020年第3期76卷 2158-2190页

作者： Amini, S. M. Karimi, A. Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Islamic Azad Univ Qazvin Branch Fac Comp & Informat Technol Engn Qazvin Iran

According to the recent advancements in communication technologies and the widespread use of smart devices, our environment can be transforming into the Internet of Things (IoT) because it can connect the physical, cyber, and biological world via smart sensors for different purposes. Wireless sensor networks are considered as one of the main infrastructures in the IoT systems. Therefore, decreasing the total energy consumption of sensor nodes and prolonging the network longevity are two important challenges that should be considered. To increase energy efficiency and to improve the network longevity, a two-level distributed clustering routing algorithm based on unequal clusters has been proposed for large-scale IoT systems. The main idea is to decrease the data transmission distances between member nodes and cluster heads to mitigate the hot spot problem by distributing two cluster heads in each cluster, which in turn leads to energy conservation and load balancing. The clustering method is two level due to the benefits it offers for the sensor nodes. First, each node can transfer its data to the nearest cluster head because a primary cluster head and a secondary cluster head have been considered for each cluster. Therefore, the nodes far from the primary cluster head can be organized based on their distances to the closest cluster head to reduce their data transmission distances to the cluster heads. Second, two cluster heads can be replaced with each other in different circumstances. This reduces the overhead of the cluster head selection algorithm in the proposed scheme. Third, the sensor nodes can benefit from the primary and secondary cluster heads to transfer the data to the sink through different paths with the minimum energy consumption. Simulation results indicate that the proposed algorithm has better performance in terms of total energy consumption, total network energy, and network longevity compared to previous similar schemes.

关键词： Wireless sensor network distributed routing algorithm Two-level clustering Unequal clusters Internet of Things

来源：评论

学校读者我要写书评

暂无评论

A distributed routing algorithm for Data Collection in Low-Duty-Cycle Wireless Sensor Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2017年第5期4卷 1420-1433页

作者： Liu, Feng Wang, Yufei Lin, Mu Liu, Kai Wu, Dapeng Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan 430079 Hubei Peoples R China Beijing Key Lab Network Based Cooperat Air Traff Beijing 100191 Peoples R China Beijing Lab Gen Aviat Technol Beijing 100191 Peoples R China Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

In order to prolong the lifetime of wireless sensor networks (WSNs), a low-duty-cycle mode is widely used to save the energy for sensor nodes. Under this mode, sensor nodes switch between active and dormant states, which incurs a high latency for traditional routing algorithms. To mitigate this, in this paper, the data collection problem in low-duty-cycle WSNs is formulated as a delay optimization problem of traffic flow with consideration of both congestion and collision, which is solved by a distributed algorithm based on network utility maximization. Our proposed distributed routing algorithm achieves a better tradeoff between latency and energy conservation than existing schemes, and our schemes can find a nearly global-optimal-path to achieve almost minimum average end-to-end (E2E) delay with less energy consumption. The computation complexity and energy consumption of the distributed algorithm are analyzed and evaluated in detail. The simulation results show that the proposed algorithm can achieve almost the same average E2E delay performance as the global optimal algorithm with less energy, and reduce the average E2E delay by about 30% than the shortest path algorithm when the data generation rate is high.

关键词： Data collection distributed routing algorithm low-duty-cycle wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

Research on distributed QoS routing algorithm Fallback++ Based on Transaction and Multiobjective Programming

Research on Distributed QoS Routing Algorithm Fallback++ Bas...

引用

2016 2nd International Conference on Mechanical,Electronic and Information Technology Engineering(ICMITE 2016)

作者： Feng Jie Deng Jin Yang Wang Qin Dalian Naval Academy

Transaction classification and QoS parameter Constraints are first researched. Then distributed QoS routing algorithm Fallback++ based on transaction and multiobjective programming is designed. Finally the time complexity and space complexity of the algorithm are analyzed. Simulation results show that Fallback++ is more efficient than Fallback and Fallback+.

关键词： Transaction classification distributed routing algorithm QoS Time complexity Simulation

来源：评论

学校读者我要写书评

暂无评论

distributed routing and self-balancing algorithm for Medical IoNT

引用

SIMULATION MODELLING PRACTICE AND THEORY 2023年 129卷

作者： Gulec, Omer Pamukkale Univ Dept Management Informat Syst Denizli Turkiye

Continuity of data flow from the body to the medical devices takes an important role in order to follow the results of the patients in real-time. The nano-sensors that undertake these tasks consume energy during the processes and become offline when they run out of energy. This causes disconnection of the nodes and interruption of the data flow. Therefore, the network connection should be provided by the remaining nodes. In this paper, a novel distributed routing and self-balancing Wireless Nano-Sensor Networks (WNSNs) algorithm for Medical Internet of Nano-Things (MIoNT)-based healthcare applications, namely SECAMENT, is proposed. The backbone of the network is built by clustering the nodes and selecting cluster heads (CHs) iteratively. For balancing the network, SECAMENT binds the nodes whose CHs become offline to the nearest available clusters or selects new CHs amongst them. According to the simulation results, SECAMENT provides connectivity of WNSNs up to 46.548% and longer network uptime up to 44.963% on average compared to a clustering-based distributed routing and coordinate algorithm for WNSNs and unbalanced networks in MIoNT healthcare applications.

关键词： Internet of nano -things Wireless nano -sensor networks distributed routing algorithm Healthcare Self balancing networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive routing Mechanism for LEO Satellite Network Based on Control Domain Partition

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING

引用

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2025年第1期9卷 70-82页

作者： Zhang, Puning Xian, Ziyun Liao, Mingjun Huang, Haiyun Yang, Junyan Chongqing Univ Posts & Telecommun Sch Commun & Informat Engn Adv Network & Intelligent Connect Technol Key Lab Chongqing Educ Commiss China Chongqing 400065 Peoples R China Chongqing Univ Posts & Telecommun Chongqing Key Lab Ubiquitous Sensing & Networking Chongqing 400065 Peoples R China

Low Earth Orbit (LEO) satellite network has the characteristics of low delay, low propagation loss, high bandwidth, and seamless coverage, which is the cornerstone of space-air-ground integrated network. However, the complex topology and time-varying link state of LEO lead to extremely unstable data routing. Existing routing research faces the challenges of large link information update delay, high routing table storage, and query overhead, which seriously affect satellite data transmission, onboard computing, and storage efficiency. To address the above issues, an adaptive routing mechanism based on control domain partition is proposed, considering the dynamic time-varying characteristics of LEO satellite constellation topology and inter-satellite link. Specifically, a non-dominated sorting-based control domain partition architecture is designed to manage the satellite domain for reducing control delay and improving link information update efficiency. Then a distributed routing method for control domain division is proposed to sense the link status of adjacent control domains rather than the entire satellite network, so as to alleviate the problems of high storage and query complexity and slow update of link information. Furthermore, a link situation aware routing decision-making method is devised to accurately perceive the link situation and achieve optimal path decision-making. The simulation results demonstrate that the proposed mechanism respectively improves the network performance by about 12%, 22%, and 14% in terms of end-to-end average delay, packet loss rate, and throughput.

关键词： LEO satellite network distributed routing algorithm control domain partition deep Q network LEO satellite network distributed routing algorithm control domain partition deep Q network

来源：评论

学校读者我要写书评

暂无评论

A Bio-inspired Method to Realize Fault-tolerance Online

A Bio-inspired Method to Realize Fault-tolerance Online

引用

International Conference on High Performance Big Data and Intelligent Systems (HPBD&IS)

作者： Xiao, Yi Lu, Huaxiang Chen, Gang Mao, Wenyu Chinese Acad Sci Inst Semicond Beijing Peoples R China Chinese Acad Sci Ctr Excellence Brain Sci & Intelligence Technol Beijing Peoples R China

ISBN: (纸本)9781728104669

A multi-layered array inspired by biological processes and structures to support the self-diagnosis and self-healing of circuits is proposed. A dedicated distributed dynamic maximum flow (DDMF) algorithm is carefully designed to run on the array with an acceptable cost of time and hardware resources which makes self-adaptive online recovery possible. The array consists of three layers logically. Cells of the Programmable Logic Layer can be configured to different circuit functions. The Immune Layer, which cooperates with cells to detect and locate faults, is inspired by the human body's powerful immune system. Reconfiguration Manage Layer executes the dynamic routing algorithm to map the circuit function to spare cells automatically to realize online recovery. A fault-tolerance hardware platform is built based on the array. As the simulation and synthesis results show, the array performs well as a programmable platform and has the ability of distributed online self-diagnosis and self-healing.

关键词： fault-tolerance bionic hardware self-healing self-diagnosis distributed routing algorithm intelligent system

来源：评论

学校读者我要写书评

暂无评论

A distributed Energy-Aware routing algorithm in Software-Defined Networks 14th

A Distributed Energy-Aware Routing Algorithm in Software-Def...

引用

14th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS)

作者： Fernandez-Fernandez, Adriana Cervello-Pastor, Cristina Ochoa-Aday, Leonardo Univ Politecn Catalunya UPC Dept Network Engn Esteve Terradas 7 Castelldefels 08860 Spain

ISBN: (纸本)9783319401591;9783319401584

In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale software-defined networks (SDN) with multiple domains. The solution proposed, called DEAR (distributed energy-aware routing), tackles the problem of minimizing the number of links that can be used to satisfy a given traffic demand under performance constraints such as control traffic delay and link utilization.

关键词： distributed routing algorithm SDN Energy-aware routing

来源：评论

学校读者我要写书评

暂无评论

An improved distributed routing algorithm for Benes based optical NoC

An improved distributed routing algorithm for Benes based op...

引用

Conference on International Conference on Image Processing and Pattern Recognition in Industrial Engineering

作者： Zhang, Jing Gu, Huaxi Yang, Yintang Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Xidian Univ Inst Microelect Xian Peoples R China

ISBN: (纸本)9780819483294

Integrated optical interconnect is believed to be one of the main technologies to replace electrical wires. Optical Network-on-Chip (ONoC) has attracted more attentions nowadays. Benes topology is a good choice for ONoC for its rearrangeable non-blocking character, multistage feature and easy scalability. routing algorithm plays an important role in determining the performance of ONoC. But traditional routing algorithms for Benes network are not suitable for ONoC communication, we developed a new distributed routing algorithm for Benes ONoC in this paper. Our algorithm selected the routing path dynamically according to network condition and enables more path choices for the message traveling in the network. We used OPNET to evaluate the performance of our routing algorithm and also compared it with a well-known bit-controlled routing algorithm. ETE delay and throughput were showed under different packet length and network sizes. Simulation results show that our routing algorithm can provide better performance for ONoC.

关键词： ONoC Benes network distributed routing algorithm bit-controlled routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel routing algorithm based on virtual topology snapshot in LEO satellite networks 17

A novel routing algorithm based on virtual topology snapshot...

引用

IEEE 17th International Conference on Computational Science and Engineering (CSE)

作者： Tan, Haichao Zhu, Lidong Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China

ISBN: (纸本)9781479979813

Nowadays, communication technology is changing rapidly and satellite communication, as an important communication pattern, is playing a more and more important role. Due to lower system delay and lower power consumption in mobile terminal, LEO satellite communication will undoubtedly become an important development direction in satellite communication system in the future. In satellite communication networks, routing algorithms determine average delay and the average of traffic load thereby have significant influences on the performance of the system. In this paper, a novel routing algorithm based on virtual topology snapshot has been proposed and it inherits the advantage of lower delay in topology snapshot as well as solves the problems of poor robustness and adaptability. This algorithm has been proved more excellent performance than topology snapshot routing and distributed routing algorithm via simulation.

关键词： LEO satellite topology snapshot routing distributed routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：