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

Real-time Threshold routing algorithm Based on Wireless Sensor Network

Agricultural Science & Technology 2012年第4期13卷 917-920,F0003页

作者：罗桂兰左国超冯立波大理学院数学与计算机学院物联网实验室云南大理671003

[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network （WSN）, the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy （LEACH）, a Real- time Threshold routing algorithm （RTRA） was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops＇ requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.

关键词： Internet of Things Wireless sensor network Intelligent greenhouse mon- itoring Real time routing algorithm

来源：评论

学校读者我要写书评

暂无评论

New routing algorithm for communication networks

Nanjing Youdian Xueyuan Xuebao/Journal of Nanjing Institute ...

引用

Nanjing Youdian Xueyuan Xuebao/Journal of Nanjing Institute of Posts and Telecommunications 2005年第2期25卷 7-11页

作者： Dai, Fu-Sheng Song, Li-Zhong Department of Information Engineering Harbin Institute of Technology Weihai 264209 China

With the advancement of high reliability, high availability rate and high service quality of communication networks, the existing routing algorithm is hard to meet the requirement and it is necessary to find a new one. In this paper, a fast routing algorithm is proposed. It is suitable for parallel calculation of multi-processor. The logic algebraic calculation rules are applied and the calculations are performed by transforming step by step, integrating or deleting the middle nodes and grouping based on relation. For a network with n nodes, all the routes between two nodes of the network can be obtained through incorporating calculation of n-2 times. The closed loop problem, which disobeys the transmission rule, will not appear. The validity and the feasibility of the algorithm are demonstrated and parallel calculation is illustrated. The calculation procedure is shown in details by an example.

关键词： Communication networks Graph theory Logic algebra routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm for Schismatic Communication Network Based on UAV

A Routing Algorithm for Schismatic Communication Network Bas...

引用

2013 IEEE 4th International Conference on Electronics Information and Emergency Communication

作者： Chi Xu Xiaolin Zhang School of Electronics and Information Engineering BeiHang University

ISBN: (纸本)9781467349345

Modern battlefield communications environment is very complex, the sensor network is extremely prone to splitting, in this situation the traditional routing protocols will fail, and opportunistic routing is regarded as the most promising techniques. While there have been some routing protocols such as Epidemic, Prophet Router, First Contact Router to use, none of these protocol allows multiple sending connections for any node. In this paper, we study the potential benefits of the multiple sending connections between any two nodes which move into each other's communication range. We develop a new protocol named MSC which is based on Epidemic routing. The simulations show that MSC has benefits in terms of the transmission delay and the delivery success rate compared to Epidemic, Prophet Router, and First Contact Router.

关键词： splitting networks wireless networks opportunistic networks multiple sending connections routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A multicast routing algorithm

引用

Systems and Computers in Japan 1999年第10期30卷

作者： Takayuki Yamagata Akihiro Fujii Yoshiaki Nemoto NTT Data Communication Inc. Tokyo Japan 135 School of Project Design Miyagi University Miyagi Japan 981-36 Graduate School of Information Science Tohoku University Sendai Japan 980-77

With the advent of the multicast communication function, it is expected that a wide range of applications will be realized, such as the delivery of video information through networks. It is thus important from the viewpoint of communication cost to compose the optimum route for multicast communication. Some of the considered methods of routing are the method where the edges are weighted and the route is determined so that the total weight is minimized, and the method where the generation tree is constructed based on the shortest route to the destination. In multicast communication, the packet is copied at the switch and is transmitted. Thus, an overhead is produced due to the packet copying process. This paper proposes an algorithm to determine the route considering the number of copies at the switch, so that (1) the concentration of the packet copying process at a particular node is avoided and (2) the route to the farthest destination is guaranteed to be the shortest. The performance of the algorithm is evaluated from the viewpoint of computational complexity, and it is shown that the proposed algorithm is suited to multicast communication. © 1999 Scripta Technica, Syst Comp Jpn, 30(10): 69–75, 1999

关键词： multicast routing algorithm switching network

来源：评论

学校读者我要写书评

暂无评论

Research on routing Equalization algorithm of Inter-Satellite Partition for Low-Orbit Micro-Satellites

引用

FUTURE INTERNET 2022年第7期14卷 207-207页

作者： Cheng, Hengfei Xu, Zhaobin Guo, Xiaoxu Yang, Jia Xu, Kedi Liu, Shuqin Jin, Zhonghe Jin, Xiaojun Zhejiang Univ Microsatellite Res Ctr Hangzhou 310007 Peoples R China Zhejiang Univ Microsatellite Res Ctr Zhejiang Microsatellite Res Lab Hangzhou 310007 Peoples R China

Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the following indexes of the classic inter-satellite routing algorithms and the balanced partition routing algorithm: computation complexity, single-node computation pressure, routing path delay, path delay variance (data in Topo table satisfy mu = 5, sigma(2) = 10). The results reveal that the balanced partition routing algorithm achieves better performance. In this paper, two optimization directions of the balanced partition routing algorithm are simulated under conditions that the data in the Topo table satisfy mu = 5, sigma(2) = 6, sigma(2) = 10 and sigma(2) = 15, respectively, when comparing their performance indicators. The experiments show that these two optimization methods can be adapted to various application scenarios and can further reduce the hardware cost of satellite nodes.

关键词： low orbit micro-satellite technology star chain routing algorithm partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

P2P routing Advanced algorithm Using Super-Nodes and Self-Organizing Clustering

P2P Routing Advanced Algorithm Using Super-Nodes and Self-Or...

引用

The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

作者： Zhao-Kui Li Yan Wang Computer College Shenyang Institute of Aeronautical Engineering Shenyang China

ISBN: (纸本)9781424458219;9781424458240

To the question of topology mismatch in structured P2P network, this paper presents a routing advanced algorithm using super-nodes and self-organizing clustering. The algorithm adds self-organizing clustering based on physical location information in structured P2P system, and each node decides whether it can become clustering header according to its ability. In this algorithm, a series of powerful nodes are chose as the super-nodes, which mainly take charge of clustering header nodes of self-organizing clustering and non-clustering nodes. The experiment results show the advanced routing algorithm can evidently improve routing performance, and preferably solve topology mismatch.

关键词： P2P routing algorithm topology mismatch selforganizing clustering super-node

来源：评论

学校读者我要写书评

暂无评论

Unmanned aerial vehicle routing based on frog-leaping optimization algorithm

引用

SCIENTIFIC REPORTS 2025年第1期15卷 1-17页

作者： Maleki, Farhad Jamali, Mohammad Ali Jabraeil Heidari, Arash Siraj Inst Higher Educ Dept Comp Engn Tabriz Iran Islamic Azad Univ Dept Comp Engn Shabestar Branch Shabestar Iran Qatar Univ Dept Comp Sci & Engn Doha Qatar

routing in Unmanned Aerial Vehicle (UAV) networks is critical for effective data transfer and overall network performance. However, current UAV routing algorithms exhibit high latency, poor route selection, excessive energy consumption, and limited flexibility in changing network topologies. To overcome these limitations, this paper proposes a new routing strategy that uses the Shuffled Frog Leaping algorithm (SFLA) to improve UAV network routing. Using a two-phase optimization approach considering Quality of Service (QoS), our system combines global exploration with local exploitation, unlike previous techniques. This hybrid method enables UAVs to dynamically change their trajectories, helping to choose the best path even in fast-changing surroundings. Our approach's self-adaptive population-based search mechanism accelerates convergence and removes a common weakness in traditional metaheuristic algorithms-premature standstill elimination-which determines its effectiveness. By constantly adjusting UAV routing patterns depending on energy economy, latency, and throughput characteristics, SFLA guarantees that UAV networks transmit effectively and consistently. Based on experimental data, our method outperforms benchmark alternatives in terms of energy use by 3.11%, latency by 5.14%, and network lifetime by 2.25%. These developments make our approach ideal for real-time applications including aerial surveillance and disaster response that call for high data transfer speeds and great energy economy.

关键词： Unmanned aerial vehicle (UAV) routing algorithm Frog-leaping algorithm Aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

Inter-mesh routing algorithms in LEO satellite constellations networks

引用

COMPUTING 2025年第2期107卷 1-26页

作者： Elbehiry, Eman Adel Fares, Ahmed Elhalawany, Basem M. Tageldein, Heba A. Benha Univ Fac Engn Shoubra Elect Engn Dept Cairo 11672 Egypt Giza Engn Inst Commun Engn Dept Giza Egypt Benha Natl Univ Commun Syst Engn Dept Cairo 11828 Egypt Eypt Japan Univ Sci & Technol E JUST Fac Engn Sch Elect Commun & Comp Engn ECCE Alexandria 21934 Egypt Kuwait Coll Sci & Technol Elect & Commun Engn Dept Block 4 Doha 93004 Kuwait

With a worldwide research race to build the sixth-generation (6 G) mobile communication system, it is imperative to seek technologies that can provide the ultimate global coverage for all environments. To this end, the low-earth orbit (LEO) satellite constellation (SatCon) is a key pillar for such a vision. Walker-Delta SatCon is one of the promising architectures, where Satellites are arranged into two meshes traveling in opposite directions. However, as a consequence of the relative high speed, inter-mesh connections between satellites in different meshes are often ignored, which limits the end-to-end delay performance. In this work, multiple inter-mesh link scheduling algorithms are investigated, including the uniform cost search (UCS) and the Bellman-Ford (BMF) algorithms in order to improve the constellation performance. A collection of possible inter-mesh links satisfying the link distance and angular velocity constraints are first filtered for a given set of satellites to maximize topological duration. Then, inter-mesh linkages are constructed using either Edmond's, UCS, or BMF algorithms. Finally, the end-to-end route is determined using the Dijkstra algorithm. We consider several key factors including the connection distance, rotational velocity, link setup time, and link switching frequency. The benefits of the suggested technique are demonstrated by simulation, where the average end-to-end time is dramatically decreased with tolerable system overhead.

关键词： Inter-mesh scheduling LEO satellite constellations networks routing algorithm Starlink

来源：评论

学校读者我要写书评

暂无评论

THCA: Three-Hop Congestion Awareness routing Mechanism in WiNoC

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2025年第4期34卷

作者： Xu, Dongyu Zhang, Tianbao Zhou, Wu Anhui Polytech Univ Sch Comp & Informat Wuhu 241000 Anhui Peoples R China

Wireless on-chip networks suffer from serious congestion problems due to the expansion of their network size and the joining of wireless nodes, and token passing is very inefficient in the case of low network injection. Aiming at the congestion problem and the inefficiency of token passing in wireless on-chip networks, this paper designs a three-hop congestion-aware routing mechanism in WiNoC. In the scheme of this paper, first, the congestion information is written into Head Flit for propagation through the information piggybacking method, in which the information piggybacking method does not introduce congestion information propagation overhead, second, the port with the smallest congestion value is selected for transmission through the three-hop congestion-aware routing algorithm to reduce the congestion within the subnetwork, and then the wireless node congestion is mitigated through the new wired and wireless packet division method, and finally, the power of wireless nodes is reduced through the dynamic MAC mechanism to reduce the power consumption of wireless nodes. The experimental results show that this paper's scheme can reduce the intra-subnet congestion, balance the inter-subnet load, reduce the power consumption of wireless nodes, and reduce the latency by 44.6% compared with the basic wireless on-chip network using adaptive routing algorithm, and reduce the latency by 21.8% compared with the wireless on-chip network using global congestion-aware routing algorithm;in different traffic patterns, this paper achieves the highest saturation throughput in different traffic patterns, and the additional hardware overhead of the router increases by only 0.04%.

关键词： Wirelsee network on chip congestion-aware routing algorithm media access control

来源：评论

学校读者我要写书评

暂无评论

Iris: Toward Intelligent Reliable routing for Software-Defined Satellite Networks

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2025年第1期73卷 454-468页

作者： Wei, Wenting Fu, Liying Gu, Huaxi Lu, Xueyu Liu, Lei Mumtaz, Shahid Guizani, Mohsen Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Natl Key Lab Adv Commun Networks Shijiazhuang 050081 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Xidian Univ Guangzhou Inst Technol Xian 710071 Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710122 Shaanxi Peoples R China Nottingham Trent Univ Dept Comp Sci Nottingham NG11 8NS England Kyung Hee Univ Dept Elect Engn Yongin 17104 Gyeonggi Do South Korea Mohamed Bin Zayed Univ Artificial Intelligence MBZ Dept Machine Learning Abu Dhabi U Arab Emirates

Satellite networks have long been regarded as a vital component of space communication systems, which provide integrated satellite-terrestrial broadband access in seamless coverage and cost-effective manner. The inter-satellite routing design for low earth orbit (LEO) satellite constellations is critical for achieving low-latency and high-reliability communication in the space communication systems. However, the inherent dynamic nature of LEO satellites, coupled with the variability in inter-satellite connectivity, imposes significant challenges for routing efficiency and network dependability. Existing routing schemes cannot handle such topological fluctuations due to their insensitivity to real-time network changes, thus suffering from performance degradations in highly dynamic space environments. This paper presents Iris, an intelligent reliable routing scheme for inter-satellite communication, aiming at increasing efficiency and reliability of the packet transmission process. Specifically, we propose a comprehensive deep reinforcement learning (DRL) framework that learns a policy to select routing paths automatically under the emerging software-defined satellite networking (SDSN) architecture. To strengthen fault-tolerance in fluctuating environments, we train an agent in an incremental manner by gradually increasing scenario complexity. Simulation results indicate that our solution significantly outperforms baselines and exhibits advances in adaptability and reliability, especially under dynamic environments with frequent topology changes.

关键词： Satellites routing Low earth orbit satellites Satellite broadcasting Reliability Iris Topology Software-defined satellite networking routing algorithm deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：