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

An energy-efficient routing algorithm for dual-energy harvesting-assisted wireless sensor networks based on whale optimization strategy

引用

JOURNAL OF SUPERCOMPUTING 2025年第1期81卷 1-29页

作者： Sheng, Hao Jun, Chen Cui, Jianqun Fan, Xiying Zhen, Li Cent China Normal Univ Sch Comp Sci Wuhan 430079 Peoples R China Wuhan Inst Technol Hubei Key Lab Intelligent Robot Wuhan 430079 Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710121 Shaanxi Peoples R China Univ Sci & Technol Beijing Beijing Peoples R China

Energy harvesting (EH) wireless sensor networks (WSNs) have wide applications in various fields due to their ability to sense and transmit environmental information, while current routing algorithms on EH-WSN generally rely on a single EH method, such as solar or wind. Due to the uncertainty of EH efficiency, a single-type EH technique may not be able to meet the energy demand of WSNs. In light of this, we propose an energy-efficient dual EH routing algorithm based on whale optimization (WO) strategy (DEHRA-WO). In the modeling process, we firstly propose a dual EH (including solar EH and radio frequency charging (RFC) techniques) switching mechanism. Namely, if the collected solar energy is not enough to maintain the operation of WSNs, RFC is employed to harvest additional energy, in which the collected solar energy is predicted using Kalman filter theory. With this, a residual energy model is constructed to measure the energy status of nodes. Secondly, we provide a communication range model to confirm the transmission area of nodes, where the wireless fading environment is considered. After that, a data link layer model is established to reflect the node blocking state. Based on the above models, we define the evaluation function to indicate the possibility of a node to be selected as the next hop and then propose the overall path selection scheme using WO strategy. Moreover, we also prove the convergence of DEHRA-WO and analyze its complexity. Through extensive simulation experiments, we demonstrate the superior performance of DEHRA-WO in terms of packet loss rate and energy utilization.

关键词： Wireless sensor networks Dual-energy harvesting Kalman filter theory routing algorithm Whale optimization strategy

来源：评论

学校读者我要写书评

暂无评论

Social relationships and location information based routing algorithm in opportunistic networks

引用

INTERNET OF THINGS 2025年 29卷

作者： Wei, Guanghui Zhang, Feng Xu, Gang Seah, Winston K. G. Yuan, Zixuan Shi, Yongqiang Shanxi Univ Sch Comp & Informat Technol Taiyuan 030006 Shanxi Peoples R China Inner Mongolia Univ Coll Comp Sci Hohhot 010021 Inner Mongolia Peoples R China Victoria Univ Wellington Sch Engn & Comp Sci Wellington 6140 New Zealand

In opportunistic networks, the lack of a stable route between nodes necessitates the use of relay nodes for message transmission. In social attribute-based routing, the selection of relay nodes is mainly done according to historical encounter information among nodes. This historical information is used to compute utility values between nodes, which are then used to select relay nodes. However, when there is insufficient historical encounter information between source and destination nodes, the utility value between nodes may not be accurately calculated by traditional social routing strategies. This results in difficulties in selecting appropriate relay nodes and hence a low delivery ratio. To address this shortcoming, a routing algorithm based on social relationships and location information (SRLI) is proposed. Initially, historical encounter information among nodes is used to identify social relationships among nodes. Messages are forwarded to the relay nodes possessing higher social relationships with the destination nodes. To enhance the coverage of messages, the geographic cosine similarity between nodes is calculated. Messages are preferentially transmitted to adjacent nodes with lower similarity to the current node. In addition, a dynamic buffer management strategy is utilized to facilitate the appropriate discarding of messages. Lower priority messages are prioritized for deletion when a node buffer is full. Experimental results demonstrate that the proposed routing algorithm significantly outperforms the Epidemic, Prophet, and CHOP-NET algorithms in terms of message delivery ratio, average message forwarding latency and routing overhead. Our proposed SRLI is superior to CHOP-NET, Prophet and Epidemic by at least 16.9% in terms of average message forwarding latency and 7.7% in terms of message delivery ratio, while still being able to achieve 1.5% lower routing overhead.

关键词： Opportunistic networks routing algorithm Social relationships Cosine similarity Buffer management

来源：评论

学校读者我要写书评

暂无评论

Multi-QoS routing algorithm based on reinforcement learning for LEO satellite networks

引用

Journal of Systems Engineering and Electronics 2025年第1期36卷 37-47页

作者： ZHANG Yifan DONG Tao LIU Zhihui JIN Shichao School of Integrated Circuit and Electronics Beijing Institute of TechnologyBeijing 100081China State Key Laboratory of Space-Ground Integrated Information Technology Space Star Technology Co.Ltd.Beijing 100095China

Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing *** satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite *** paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite *** auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing *** results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.

关键词： low Earth orbit(LEO)satellite network reinforcement learning multi-quality of service(QoS) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Load balancing routing algorithm of industrial wireless network for digital twin

引用

COMPUTER NETWORKS 2025年 258卷

作者： Xiao, Linjie Li, Shining Wen, Qin Liang, Xiao Li, Yiming Wang, Wanbao Fu, Yuntao Northwestern Polytech Univ Xian 710129 Shaanxi Peoples R China

Digital twin is a transformative technology with the power to reshape the future of industries, which enables accurate simulation and optimization of the production process by creating virtual copies of physical entities. Industrial wireless network such as ISA100.11a, as an indispensable communication bridge in digital twin, provides a stable and reliable data transmission pathway for all-element connectivity. However, the access of a large number of nodes increases the risk of network congestion and poses a challenge to the real-time network transmission. Therefore, the intention of our research is to deal with network congestion by establishing a load balancing routing algorithm. First, considering the time-triggered characteristic of industrial scenarios, a directed acyclic graph model is established for multi-periodic communication streams. We analyze the causes of load imbalance in multi-source single-sink topology, and prove that choosing optimal path scheme is an NP- hard problem by generalizing to the multidimensional bin packing problem. Then, we theoretically derive the average load of the hierarchy, establish a loss function characterizing the degree of hierarchical load balancing, and propose a hierarchical load balancing strategy based on the black-winged kite algorithm by establishing a mapping relationship. Finally, a scheduling constraint model is introduced to evaluate the superiority of the proposed algorithm. Experimental validation shows that the proposed algorithm reduces 70.80%, 27.15%, 15.57%, 14.01% in terms of loss function value and 23.52%, 4.71%, 5.19%, 4.64% in terms of total delay as compared to Dijkstra algorithm, Greedy algorithm, Bat algorithm and Deep Q-Networks respectively.

关键词： Digital twin Industrial wireless network routing algorithm Load balancing Real-time transmission

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm for dynamic multicast trees with end-to-end path length control

引用

COMPUTER COMMUNICATIONS 2000年第2期23卷 101-114页

作者： Fujinoki, H Christensen, KJ Univ S Florida Dept Comp Sci & Engn Tampa FL 33620 USA

The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum path length bounds for each receiver. The PLC algorithm can be implemented as a distributed algorithm, can tradeoff end-to-end delay and bandwidth consumption, and can be implemented for polynomial time execution. Analysis and simulation show that (a) the PLC algorithm generates multicast trees which consume less bandwidth than chose generated by the SPT algorithm while guaranteeing the same shortest path length and (b) consume less bandwidth than trees generated by the Greedy algorithm with only a moderate increase in path length. The PLC algorithm is more flexible and has a lower cost than a combined SPT and Greedy algorithm. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： multicast dynamic multicast routing algorithm path length control

来源：评论

学校读者我要写书评

暂无评论

routing algorithm for Energy Efficiency Optimizing of Wireless Sensor Networks based on Genetic algorithms

引用

WIRELESS PERSONAL COMMUNICATIONS 2023年第3期133卷 1373-1396页

作者： Albuquerque, Kaique Rhuan de Azevedo de Medeiros, Rafael Pereira Duarte, Rafael Moura Villanueva, Juan Moises Mauricio de Macedo, Euler Cassio Tavares Univ Fed Paraiba Joao Pessoa PB Brazil

With the popularization of wireless sensor networks (WSN) and the concept of IoT (Internet-of-things), several applications have emerged in the industrial, scientific and engineering sectors. However, energy consumption is a challenge, because the demands for improvement in transmission rates and latency limitations. In particular, increasing the lifetime of wireless sensor networks has been a common goal in recent research. A viable alternative to solve this problem consists in reducing the data traffic defined by the routing protocol, which optimizes the number of messages that travel through the network. These protocols can also be optimized using evolutive algorithms, such as genetic algorithms. In the present work, is proposed a routing algorithm for WSN based on genetic algorithms, with the purpose of minimizing the total distance from the sensor node to the sink, which would allow optimized use of energy by sensor nodes and extend the lifetime of the WSN. The proposed algorithm includes a form of chromosome coding that had not yet been used in the context of routing and a new multi-objective fitness function. Performance analyzes were carried out establishing exhaustive search (ES) and opportunistic routing (OR) algorithms as comparison references and considering two scenarios: an open field and the other in a closed residential area. Proposed algorithm revealed superior performance when compared to reference algorithms. In open space and in the residential scenario, the lifetime provided by the proposed algorithm was 7320 and transmissions greater than that provided by OR. It was also observed that, with the increase in the number of transmissions, the standard deviation of the nodes ' residual energy is smaller when GAEA-RP is applied, which means the predictability of the energy consumed by them. After 1.8x10(5) transmissions, it was 0.105 J for GAEA-RP versus 0.188 J for OR in the first scenario. In the second scenario, in addition to the smaller standard

关键词： Wirelles sensor network routing algorithm Genetic algorithm Energy balancing Optimize energy efficiency

来源：评论

学校读者我要写书评

暂无评论

routing algorithm with Virtual Topology Toward to Huge Numbers of LEO Mobile Satellite Network Based on SDN

引用

MOBILE NETWORKS & APPLICATIONS 2018年第2期23卷 285-300页

作者： Jia, Min Zhu, Siyu Wang, Linfang Guo, Qing Wang, Haitao Liu, Zhihui Harbin Inst Technol Sch Elect & Informat Engn Commun Res Ctr Harbin Heilongjiang Peoples R China State Key Lab Space Ground Integrated Informat Te Beijing Peoples R China

SDN network is a dynamic, controllable, cost-effective and adaptable system. It is suitable for communication networks with high bandwidth and high dynamic characteristics. Therefore, combining SDN ideas with the new generation of LEO satellite networks can achieve more flexible monitoring and management of the network, and can make the network expansion more convenient. Joint the Depth-First-Search (DFS) idea and Dijkstra algorithm for the huge numbers of LEO mobile satellite network based on SDN is proposed to improve the computational efficiency and the reliability of calculation result. Moreover, the communication performance of space-based network based on SDN and traditional space-based network is compared and analyzed. The simulation results show that the huge numbers of LEO mobile satellite network based on SDN breaks through the performance limitations of the traditional network architecture, and it can achieve better performance of the network.

关键词： LEO satellite network Virtual topology routing algorithm SDN Huge numbers of LEO satellites

来源：评论

学校读者我要写书评

暂无评论

routing algorithm of minimizing maximum link congestion on grid networks

引用

WIRELESS NETWORKS 2015年第5期21卷 1713-1732页

作者： Xu, Jun Yang, Jianfeng Guo, Chengcheng Lee, Yann-Hang Lu, Duo Wuhan Univ Sch Elect Informat Wuhan 430072 Hubei Peoples R China Arizona State Univ Dept Comp Sci Tempe AZ 85287 USA

As regular topology networks, grid networks are widely adopted in network deployment. Link congestion and routing path length are two critical factors that affect the delay and throughput of a network. In this paper, we study the routing problem in grid networks concerning these two factors. The main objective of our routing algorithms is to minimize the maximum link congestion. The shortest path minimum maximum (SPMM) link congestion and non-shortest path minimum maximum (NSPMM) link congestion routing problems are studied. The two problems are first formulated as integer optimization problems. Then, corresponding routing algorithms (SPMM and NSPMM routing algorithms) are proposed. For SPMM routing algorithm, the path length is optimal, while for NSPMM routing algorithm, the path is limited in a submesh. Thus, the path length can be bounded. At last, we compare the proposed routing algorithms under different scenarios with other popular routing algorithms (RowColumn, ZigZag, Greedy, Random routing algorithms). The performances are evaluated through different metrics including link congestion, path length, path congestion, path congestion to path length ratio, delay and throughput.

关键词： Grid networks Link congestion routing algorithm Scheduling

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm for row-based FPGAs

引用

MICROPROCESSORS AND MICROSYSTEMS 1997年第7期20卷 401-407页

作者： Kagaris, D Electrical Engineering Department Southern Illinois University Carbondale IL 62901 USA

A row-based Field Programmable Gate Array (FPGA) consists of rows of identical processing modules separated by segmented tracks that are used for routing nets between specified module pins. The problem of finding a feasible routing of a given set of nets onto a set of segmented tracks is NP-complete. We present an enumeration algorithm for the problem that uses matching arguments to improve the time complexity while requiring polynomial space. The algorithm serves as the basis of powerful practical heuristics and its additional advantage is that it is directly parallelizable.

关键词： FPGA routing algorithm maximal independent set

来源：评论

学校读者我要写书评

暂无评论

routing algorithm based on triangular fuzzy layer model and multi-layer clustering for opportunistic network

引用

IET COMMUNICATIONS 2020年第17期14卷 2905-2914页

作者： Li, Zhuoyang Chen, Zhigang Wu, Jia Liu, Kanghuai Cent South Univ Sch Comp Sci & Engn Changsha 410075 Peoples R China Mobile Hlth Minist Educ China Mobile Joint Lab Changsha 410083 Peoples R China

With the development of 5G network and big data and the popularity of mobile intelligent devices, the opportunistic social network has been further developed. At present, several existing routing algorithms based on node similarity use the context information of the node to select the best relay node. However, most opportunistic social algorithms only consider the social properties of nodes and ignore the importance of the similarity of the moving trajectories of the nodes. The transmission opportunity of messages in the opportunity social network is generated by the movement of the nodes, so this feature must betaken into account in the designing of the routing algorithm. Therefore, this study proposes a routing algorithm based on the triangular fuzzy layer model and multi-layer clustering for the opportunistic social network. In this study, the authors use the fuzzy analytic hierarchy process model to analyse the social similarity and trajectory similarity to determine the best message transmission node. This study compares the other four opportunistic social network routing algorithms in the simulation environment. In general, among the five routing algorithms, the transmission rate of the TFMC algorithm is the best. The average end-to-end delay and average network overhead are also the lowest.

关键词： social networking (online) fuzzy set theory mobile computing routing protocols telecommunication network routing routing algorithm triangular fuzzy layer model opportunistic social network fuzzy analytic hierarchy process model social similarity message transmission node TFMC algorithm opportunistic network existing routing algorithms node similarity relay node opportunistic social algorithms social properties opportunity social network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：