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

An efficient routing algorithm based on segment routing in software-defined networking

COMPUTER NETWORKS 2016年第Jul.5期103卷 44-55页

作者： Lee, Ming-Chieh Sheu, Jang-Ping Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan

Software-defined networking (SDN) is an emerging architecture that offers advantages over traditional network architecture. Segment routing (SR) defines the path of information through the network via an ordered list of multi-protocol label switching (MPLS) mechanisms on the packet headers at the ingress device, and this system makes SDN routing management more simple and efficient. SR can also solve some scalability issues in SDN. In this paper, we propose a routing algorithm for SDN with SR that can meet the bandwidth requirements of routing requests. Our algorithm considers the balance of traffic load and reduces the extra cost of packet header size in a network. Simulation results show that the performance of our algorithm is better than that of previously developed algorithms in terms of the average network throughput and the average rejection rate of routing requests. (C) 2016 Elsevier B.V. All rights reserved.

关键词： routing algorithm Software-defined networking Segment routing Traffic engineering

来源：评论

学校读者我要写书评

暂无评论

A Learning Automata Based Stable and Energy-Efficient routing algorithm for Discrete Energy Harvesting Mobile Wireless Sensor Network

引用

WIRELESS PERSONAL COMMUNICATIONS 2019年第1期107卷 437-469页

作者： Hao, Sheng Zhang, Hu-yin Wang, Jing Wuhan Univ Sch Comp Wuhan 430079 Hubei Peoples R China

Wireless sensor networks (WSN) have been widely used in urban network system and networked monitoring system, which provide easy connectivity and high physical data rate. Considering the battery-limited property of sensor nodes, recently, energy harvesting (EH) technology is introduced into WSN, which can alleviate traditional WSN problems (energy consumption, energy equilibrium, transmission efficiency, etc.). Current EH-WSN routing algorithms generally use the continuous energy harvesting mode, therefore, how to design an efficient routing algorithm for discrete energy harvesting mode and ensure the overall energy balance and conservation is still a great challenge and needs to be solved. Especially, under the mobile environment, the impact of route stability needs to be considered, which makes the design more complicated. To address the above problems, we propose a learning automata (LA) theory based stable and energy-efficient routing algorithm for discrete EH-mobile WSN (DEH-LA-SERA, for short). Firstly, we construct a multi-factors measurement model for sensor nodes, which contains node stability model, energy ratio function, expected harvesting energy model (using Markov decision process method) and direction judgement model. On this basis, we derive the node weighted value, i.e., selecting probability, which can be used to determine whether a node can be chosen as relay node. Secondly, with the help of LA theory, we construct a feedback mechanism to adjust the optimal path. With this solution, we can ensure the overall energy balance and conservation while holding the stability of selected path. As demonstrated in simulation experiments, our algorithm, DEH-LA-SERA, achieved the best performance in route survival time, energy consumption, energy balance and acceptable performance in end-to-end delay and packets delivery ratio.

关键词： Energy harvesting wireless sensor network Mobile environment routing algorithm Multi-factors measurement model Markov decision process Learning automata theory Stability and energy optimization

来源：评论

学校读者我要写书评

暂无评论

An ad-hoc network routing algorithm based on improved neural network under the influence of COVID-19

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2020年第6期39卷 8767-8774页

作者： Kai, Cui Nanjing Univ Informat Technol Serv Ctr Nanjing 210093 Jiangsu Peoples R China

Under the influence of COVID-19, an efficient Ad-hoc network routing algorithm is required in the process of epidemic prevention and control. Artificial neural network has become an effective method to solve large-scale optimization problems. It has been proved that the appropriate neural network can get the exact solution of the problem in real time. Based on the continuous Hopfield neural network (CHNN), this paper focuses on the study of the best algorithm path for QoS routing in Ad-hoc networks. In this paper, a new Hopfield neural network model is proposed to solve the minimum cost problem in Ad-hoc networks with time delay. In the improved version of the path algorithm, the relationship between the parameters of the energy function is provided, and it is proved that the feasible solution of the network belongs to the category of progressive stability by properly selecting the parameters. The calculation example shows that the solution is not affected by the initial value, and the global optimal solution can always be obtained. The algorithm is very effective in the prevention and control in COVID-19 epidemic.

关键词： Ad-hoc Network routing algorithm Neural Network COVID-19

来源：评论

学校读者我要写书评

暂无评论

A shortest path routing algorithm for unmanned aerial systems based on grid position

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2018年第Feb.期103卷 215-224页

作者： Lin, Qinying Song, Houbing Gui, Xiaolin Wang, Xiaoping Su, Saiyu Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Shaanxi Peoples R China Air Force Engn Univ Aeronaut & Astronaut Engn Coll Xian 710038 Shaanxi Peoples R China Embry Riddle Aeronaut Univ Dept Elect Comp Software & Syst Engn Daytona Beach FL 32114 USA

The unmanned aerial system (UAS), as a typical aeronautical Ad-hoc network (AANET) system, which is composed of unmanned aerial vehicle clusters has a lot of advantages such as flexible deployment, excellent cost-benefit ratio and free from the effect of environment. It will be an important part of the space-sky information network in the future. Due to the fast-moving of nodes in AANET/UAS, the topology changes frequently. The routing overhead becomes huge and inefficient, and connectivity keeping becomes difficult. In this paper, a shortest path routing algorithm based on grid position no center(GPNC-SP algorithm) is proposed, which uses the logical grid distance to replace the original Euclidean distance to reduce the sensitivity of fast-moving nodes. This algorithm automatically computes and maintains the adjacency relationship and topology structure by perception and updating algorithm and adopts Dijkstra algorithm to achieve the shortest routing path. Also, a regional reconstruction strategy(RSS) is designed to optimize the routing path dynamically. At the same time, two metrics, i.e., the percentage of the effective communication area(P-eca %) and the sensitivity with logical grid size (Se) are used to determine the optional scope of logical grid width. Comparing with the two traditional typical routing protocols (DREAM and DSDV algorithms), this algorithm sacrifices a certain degree of communication distance to achieve better performances of network overhead, link stability, and calculating speed. The final simulation experiments under the Matlab environment demonstrate the effectiveness and practicality of this algorithm.

关键词： Unmanned aerial system Aeronautical ad-hoc network routing algorithm Grid position Regional reconstruction strategy

来源：评论

学校读者我要写书评

暂无评论

A Radio-Aware routing algorithm for Reliable Directed Diffusion in Lossy Wireless Sensor Networks

引用

SENSORS 2009年第10期9卷 8047-8072页

作者： Kim, Yong-Pyo Jung, Euihyun Park, Yong-Jin Anyang Univ Dept Comp Sci Inchon 417833 South Korea Hanyang Univ Dept Elect & Comp Engn Seoul 133791 South Korea

In Wireless Sensor Networks (WSNs), transmission errors occur frequently due to node failure, battery discharge, contention or interference by objects. Although Directed Diffusion has been considered as a prominent data-centric routing algorithm, it has some weaknesses due to unexpected network errors. In order to address these problems, we proposed a radio-aware routing algorithm to improve the reliability of Directed Diffusion in lossy WSNs. The proposed algorithm is aware of the network status based on the radio information from MAC and PHY layers using a cross-layer design. The cross-layer design can be used to get detailed information about current status of wireless network such as a link quality or transmission errors of communication links. The radio information indicating variant network conditions and link quality was used to determine an alternative route that provides reliable data transmission under lossy WSNs. According to the simulation result, the radio-aware reliable routing algorithm showed better performance in both grid and random topologies with various error rates. The proposed solution suggested the possibility of providing a reliable transmission method for QoS requests in lossy WSNs based on the radio-awareness. The energy and mobility issues will be addressed in the future work.

关键词： WSNs lossy WSNs radio-aware directed diffusion routing algorithm reliability cross-layer

来源：评论

学校读者我要写书评

暂无评论

An Unequal Clustering Energy Consumption Balancing routing algorithm of UAV Swarm Based on Ultraviolet Secret Communication

引用

WIRELESS PERSONAL COMMUNICATIONS 2024年第1期137卷 221-235页

作者： Zhao, Taifei Cheng, Minhua Lyu, Xinzhe Zhang, Haijun Wang, Lu Xian Univ Technol Sch Automat & Informat Engn Xian 710048 Shaanxi Peoples R China

Focusing on the tasks collaboration requirements of Unmanned Aerial Vehicle (UAV) swarm in complex battlefield environment, it is especially important to ensure the reliability of routing communication within the formation. Wireless ultraviolet (UV) secret communication can meet the reliable and secret communication needs of UAV swarm in the complex atmospheric environment. Moreover, considering the limited energy carried by UAVs, in order to maximize the flight time of UAVs, this paper proposes an unequal clustering energy consumption balancing routing algorithm (UCEBRA) of UAV swarm based on UV secret communication. Combined the advantages of wireless UV scattering communication, this algorithm improves the selection threshold of candidate cluster heads (CHs) and the clustering conditions of nodes according to the performance of UAV nodes. Furthermore, a function, which can comprehensively reflect both distance and remaining energy of UAVs, is built in the process of inter-cluster routing, to balance the energy consumption of the CHs. The simulation results show that compared with low-energy adaptive clustering hierarchy (LEACH) and energy-efficient unequal clustering (EEUC), the energy efficiency of the UAV network is increased by 21.7% and 4.6% respectively, and the lifetime of the network prolongs by 26.2% and 7.8% under UCEBRA algorithm. Therefore, the algorithm proposed in this paper can efficiently balance the energy consumption of nodes and thus prolong the lifetime of UAV swarm.

关键词： UAV swarm Wireless UV communication routing algorithm Energy consumption balancing

来源：评论

学校读者我要写书评

暂无评论

Topological properties and routing algorithm for semi-diagonal torus networks

引用

The Journal of China Universities of Posts and Telecommunications 2011年第5期18卷 64-70页

作者： WANG Ya-gang DU Hui-min SHEN Xu-bang School of Computer Xidian University Xi＇an 710071 China School of Electronic Engineering Xi＇an University of Posts and Telecommunications Xi＇an 710121 China

To improve the scalability and reduce the implementation complexity of Mesh and Mesh-like networks, the semi-diagonal Torus （SD-Torus） network, a regular and symmetrical intercormection network is proposed. The SD-Torus network is a combination of a typical 2D-Torus network with two extra diagonal links from northwest to southeast direction for each node. The topological properties of SD-Torus networks are discussed, and a load balanced routing algorithm for SD-Torus is presented. System-C based simulation result shows that, compared with diagonal Mesh （DMesh）, diagonal Torus （DTorus） and XMesh networks, the SD-Torus network can achieve high performance with a lower network cost. It makes the SD-Torus network a powerful candidate for the high performance interconnection networks.

关键词： interconnection networks routing algorithm load balance SD-Toms networks direct networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic detection of wireless interface faults and fault-tolerant routing algorithm in WiNoC

引用

INTEGRATION-THE VLSI JOURNAL 2023年第1期90卷 236-244页

作者： Ouyang, Yiming Xu, Dongyu Qian, Chang Zhou, Wu Wang, Qi Liang, Huaguo Hefei Univ Technol Sch Comp Sci & Informat Engn 485 Danxia Rd Hefei 230601 Anhui Peoples R China Hefei Univ Technol Sch Elect Sci & Appl Phys 485 Danxia Rd Hefei 230601 Anhui Peoples R China

Wireless network-on-chip (WiNoC) face serious reliability challenges, and the fault-tolerant design of wireless routers (WRs) has a significant impact on the transmission efficiency of the overall on-chip network. Due to the continuous shrinking of CMOS technology and the integration of wireless technology in complex circuits, WRs appear to become more prevalent. In this paper, we propose a dynamic detection strategy for wireless interface faults in WiNoC, which classifies the fault scenarios of wireless interfaces in WRs, implements wireless interface fault detection in WiNoC operation, and updates the fault scenarios. Meanwhile, a fault-free WR table-based nearest route algorithm is also presented to maximize the network performance. The Evaluations show that the proposed scheme can effectively guarantee the network performance when WR faults occur in the network and is also effective under the case of moderate WR fault rate.

关键词： Wireless network on chip Fault tolerate routing algorithm Wireless interface

来源：评论

学校读者我要写书评

暂无评论

EDXY - A low cost congestion-aware routing algorithm for network-on-chips

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2010年第7期56卷 256-264页

作者： Lotfi-Kamran, P. Rahmani, A. M. Daneshtalab, M. Afzali-Kusha, A. Navabi, Z. Univ Tehran Sch Elect & Comp Engn Nanoelect Ctr Excellence Tehran 14174 Iran Univ Turku Comp Syst Lab Turku Finland Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

In this paper, an adaptive routing algorithm for two-dimensional mesh network-on-chips (NoCs) is presented. The algorithm, which is based on Dynamic XY (DyXY), is called Enhanced Dynamic XY (EDXY). It is congestion-aware and more link failure tolerant compared to the DyXY algorithm. On contrary to the DyXY algorithm, it can avoid the congestion when routing from the current switch to the destination whose X position (Y position) is exactly one unit apart from the switch X position (Y position). This is achieved by adding two congestion wires (one in each direction) between each two cores which indicate the existence of congestion in a row (column). The same wires may be used to alarm a link failure in a row (column). These signals enable the routing algorithm to avoid these paths when there are other paths between the source and destination pair. To assess the latency of the proposed algorithm, uniform, transpose, hotspot, and realistic traffic profiles for packet injection are used. The simulation results reveal that EDXY can achieve lower latency compared to those of other adaptive routing algorithms across all workloads examined, with a 20% average and 30% maximum latency reduction on SPLASH-2 benchmarks running on a 49-core CMP. The area of the technique is about the same as those of the other routing algorithms. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Network-on-chip routing algorithm Adaptive Dynamic XY Bursty traffic Non uniform traffic Low latency routing Link failure tolerant

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Load Balancing Ant Based routing algorithm for Wireless Sensor Networks

引用

IEEE ACCESS 2019年 7卷 113182-113196页

作者： Li, Xinlu Keegan, Brian Mtenzi, Fredrick Weise, Thomas Tan, Ming Hefei Univ Inst Appl Optimizat Dept Comp Sci Hefei 230601 Anhui Peoples R China Technol Univ Dublin Sch Comp Dublin D08 X622 Ireland

Wireless Sensor Networks (WSNs) are a type of self-organizing networks with limited energy supply and communication ability. One of the most crucial issues in WSNs is to use an energy-efficient routing protocol to prolong the network lifetime. We therefore propose the novel Energy-Efficient Load Balancing Ant-based routing algorithm (EBAR) for WSNs. EBAR adopts a pseudo-random route discovery algorithm and an improved pheromone trail update scheme to balance the energy consumption of the sensor nodes. It uses an efficient heuristic update algorithm based on a greedy expected energy cost metric to optimize the route establishment. Finally, in order to reduce the energy consumption caused by the control overhead, EBAR utilizes an energy-based opportunistic broadcast scheme. We simulate WSNs in different application scenarios to evaluate EBAR with respect to performance metrics such as energy consumption, energy efficiency, and predicted network lifetime. The results of this comprehensive study show that EBAR provides a significant improvement in comparison to the state-of-the-art approaches EEABR, SensorAnt, and IACO.

关键词： Ant colony optimization energy efficiency load balancing routing algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：