检索结果-南通市图书馆

An Energy-Efficient routing and Self-Organization algorithm in Wireless Sensor Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2005年第2期12卷 87-93页

作者： LIU Li-feng ZOU Shi-hong ZHANG Lei CHENG Shi-duan State Key Laboratory of Networking and Switching Beijing University of Posts and Telecommunications Beijing 100876 P.R. China

Energy efficiency is the most important goal in wireless sensor network routing and self-organization algorithms. To achieve this goal, our paper first presents a distributed energy-aware routing algorithm Nearest to Theoretical Point（NTP）. Then it applies NTP to self-organization of sensor networks to form an energy-efficient self-organization algorithm Shortest Path Tree-NTP（SPT-NTP）. Theoretic analysis and simulation show that NTP and SPT-NTP can ensure less network energy consumption than other related algorithms.

关键词： wireless sensor networks routing algorithm

A practical interconnection network RP(k) and its routing algorithms

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2001年第6期44卷 461-473页

作者：刘方爱刘志勇乔香珍 Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Department of Computer Science Shandong Normal University Jinan China

Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus net-work. Especially when the number of nodes in an optimal node group is between 6 and 100, the diam-eter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Further-more based on the RP(k) network we design a set of routing algorithms which are point-to-point rout-ing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [ k/2] +2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.

关键词： RP(k) interconnection network the optimal node group routing algorithm Petersen graph the network diameter.

A new quantum key distribution resource allocation and routing optimization scheme

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2024年第3期33卷 244-259页

作者：毕琳袁晓同吴炜杰林升熙 School of Computer Science and Technology Changchun University of Science and TechnologyChangchun 130012China Key Laboratory of Network and Information Security in Jilin Province Changchun 130012China

Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic ***,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical *** this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet ***,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot ***,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key ***,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key *** results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.

关键词： quantum key distribution(QKD) resource allocation key storage routing algorithm

Reinforcement learning based dynamic distributed routing scheme for mega LEO satellite networks

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2023年第2期36卷 284-291页

作者： Yixin HUANG Shufan WU Zeyu KANG Zhongcheng MU Hai HUANG Xiaofeng WU Andrew Jack TANG Xuebin CHENG School of Aeronautics and Astronautics Shanghai Jiao Tong UniversityShanghai 200240China School of Astronautics Beihang UniversityBeijing 100191China School of Aerospace Mechanical and Mechatronic EngineeringThe University of SydneyCamperdown 2006Australia X-Laboratory The Second Academy of China Aerospace Science and Industry CorporationBeijing 100854China

Recently,mega Low Earth Orbit(LEO)Satellite Network(LSN)systems have gained more and more attention due to low latency,broadband communications and global coverage for ground *** of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance,due to LSN constellation scale and dynamic network topology *** order to seek an efficient routing strategy,a Q-learning-based dynamic distributed routing scheme for LSNs(QRLSN)is proposed in this *** achieve low end-toend delay and low network traffic overhead load in LSNs,QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data *** results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service(QoS)optimization during the routing maintenance *** addition,comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.

关键词： LEO satellite networks Mega constellation Multi-objective optimization routing algorithm Reinforcement learning

Multi-hop routing for energy-efficiency enhancement in relay-assisted device-to-device communication

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2015年第2期22卷 1-6,51页

作者： Zhao Jingyi Li Xi Xu Quansheng Key Laboratory of Universal Wireless Communications Beijing University of Posts and Telecommunications

Financial and environment considerations present new trends in wireless network known as green communication. As one of the most promising network architectures, the device-to-device （D2D） communication should take seriously account to the energy-efficiency. Most of the existing work in the area of D2D communication only focus on the direct communication, however, the direct link D2D communication has to be limited in practice because of long distance, poor propagation medium and cellular interference, etc. A new energy-efficient multi-hop routing algorithm was investigated for multi-hop D2D system by jointly optimizing channel reusing and power allocation. Firstly, the energy-efficient multi-hop routing problem was formulated as a combinatorial optimization problem. Secondly, to obtain a desirable solution with reasonable computation cost, a heuristic multi-hop routing algorithm was presented to solve the formulated problem and to achieve a satisfactory energy-efficiency performance. Simulation shows the effectiveness of the proposed routing algorithm.

关键词： device-to-device (D2D) communication energy-efficiency multi-hop relay-assisted transmission routing algorithm

STTAR: A Traffic- and Thermal-Aware Adaptive routing for 3D Network-on-Chip Systems

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第9期72卷 5531-5545页

作者： Juan Fang Yunfei Mao Min Cai Li’ang Zhao Huijie Chen Wei Xiang Faculty of Information Technology Beijing University of TechnologyBeijing100124China La Trobe University MelbourneVIC 3086Australia James Cook University CainsQLD 4878Australia

Since the three-dimensional Network on Chip(3D NoC)uses through-silicon via technology to connect the chips,each silicon layer is conducted through heterogeneous thermal,and 3D NoC system suffers from thermal *** alleviate the seriousness of the thermal problem,the distribution of data packets usually relies on traffic information or historical temperature ***,thermal problems in 3D NoC cannot be solved only based on traffic or temperature ***,we propose a Score-Based Traffic-and Thermal-Aware Adaptive routing(STTAR)that applies traffic load and temperature information to ***,the STTAR dynamically adjusts the input and output buffer lengths of each router with traffic load information to limit routing resources in overheated areas and control the rate of temperature ***,STTAR adopts a scoring strategy based on temperature and the number of free slots in the buffer to avoid data packets being transmitted to high-temperature areas and congested areas and to improve the rationality of selecting routing output *** our experiments,the proposed scoring Score-Based Traffic-and Thermal-Aware Adaptive routing(STTAR)scheme can increase the throughput by about 14.98%to 47.90%and reduce the delay by about 10.80%to 35.36%compared with the previous works.

关键词： Buffer allocation thermal 3D NoC routing algorithm

A Novel Method for routing Optimization in Software-Defined Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2022年第12期73卷 6393-6405页

作者： Salem Alkhalaf Fahad Alturise Department of Computer College of Science and Arts in ArRass Qassim UniversityAr RassQassimSaudi Arabia

Software-defined network(SDN)is a new form of network architecture that has programmability,ease of use,centralized control,and protocol *** has received high attention since its *** SDN network architecture,network management becomes more efficient,and programmable interfaces make network operations more flexible and can meet the different needs of various *** mainstream communication protocol of SDN is OpenFlow,which contains aMatch Field in the flow table structure of the protocol,which matches the content of the packet header of the data received by the switch,and completes the corresponding actions according to the matching results,getting rid of the dependence on the protocol to avoid designing a new *** order to effectively optimize the routing forSDN,this paper proposes a novel algorithm based on reinforcement *** proposed technique canmaximize numerous objectives to dynamically update the routing strategy,and it has great generality and is not reliant on any specific network *** control of routing strategy is more complicated than many Q-learning-based algorithms due to the employment of reinforcement *** performance of the method is tested by experiments using the OMNe++*** experimental results reveal that our PPO-based SDN routing control method has superior performance and stability than existing algorithms.

关键词： Reinforcement learning routing algorithm software-defined network optimization

An Addressing and routing Scheme Based on Modified Euclidean Space for Hexagonal Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2015年第5期12卷 94-99页

作者： GONG Jiezhong LI Lin CHEN Gongliang WU Yue LI Jianhua Information Security Research Center China Electronics Standardization Institute Information Security Engineering School Shanghai Jiaotong University

The addressing and routing algorithm on hexagonal networks is still an open problem so *** many related works have been done to resolve this problem to some extent,the properties of hexagonal networks are still not explored *** this paper,we first create an oblique coordinate system and redefine the Euclidean space to address the hexagonal *** an optimal routing algorithm using vectors and angles of the redefined Euclidean space is *** with the traditional 3-directions scheme and the Cayley graph method,the proposed routing algorithm is more efficient and totally independent of the scale of networks with two-tuples *** also prove that the path(s) obtained by this algorithm is always the shortest one(s).

关键词： hexagonal network euclidean space addressing routing algorithm cayley graph

Quantum Key Distribution Network： Optimal Secret- Key- Aware routing Method for Trust Relaying

在线全文

学校读者我要写书评

暂无评论

China Communications 2018年第2期15卷 33-45页

作者： Chao Yang Hongqi Zhang Jinhai Su Science and Technology Information Research Institute Zhengzhou Henan China

Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.

关键词： quantum key distribution QKDnetwork routing algorithm