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

A QoS routing algorithm Based on Ant Colony Optimization and Mobile Agent

Procedia Engineering 2012年 29卷 1208-1212页

作者： CAO Huaihu School of Information of the Central University Finance and Economics Beijing China 100081

The current Internet can only provide “best effort” transport service, so it is becoming a very urgent task how to provide QoS guarantees for growing video on demand, multimedia conferencing and other multimedia applications based on the existing network architecture. This paper proposes a QoS routing algorithm based on mobile agent and ant colony (QR2A). The QR2A algorithm combines various constraints and network load conditions with the ant colony algorithm in the pheromone, while not only meets the QoS requirements, and solve the problem of network load balancing effectively, and the algorithm is less cost. Meanwhile, the paper also gives formal description, correctness and convergence analysis of QR2A algorithm. Finally practical effect of the algorithm is verified through by the simulation experiment.

关键词： QoS routing algorithm Ant Colony Optimization,Agent

来源：评论

学校读者我要写书评

暂无评论

The study of distributed routing algorithm in Ad hoc network

The study of distributed routing algorithm in Ad hoc network

引用

7th World Congress on Intelligent Control and Automation

作者： Wang, Yong Dong, Ying Yang, Yongjian Jin, Fushou Jilin Univ Coll Comp Sci & Technol Changchun 130025 Peoples R China Jilin Univ Coll Commun Engn Changchun 130012 Peoples R China

ISBN: (纸本)9781424421138

routing protocol is a key problem and critical to Mobile wireless ad hoc networks. These instructions give you basic guidelines for preparing papers for conference proceedings. routing, as an important part of Ad hoc network its performance has a vital effect on the system. In this paper, we discuss the all distributed routing algorithm and simulated this algorithm by using Matlab language. Layered structure and layered routes are used for expanding the network. But in he planar structure in a layer, the routing algorithm in group is similar to the all distributed routing algorithm. The emulation and analysis results indicate that the all distributed routes algorithm is totally suitable in ad hoc network of the small-scale plane structure.

关键词： Ad hoc network all distributed routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Machine Learning-based Hybrid Intrusion Detection System and Intelligent routing algorithm for MPLS Network

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2023年第4期14卷 94-107页

作者： Ridwan, Mohammad Azmi Radzi, Nurul Asyikin Mohamed Azmi, Kaiyisah Hanis Mohd Abdullah, Fairuz Ahmad, Wan Siti Halimatul Munirah Wan Univ Tenaga Nas Inst Power Engn Coll Engn Dept Elect & Elect Engn Kajang 43000 Selangor Malaysia Multimedia Univ Fac Engn Cyberjaya 63100 Malaysia

Machine Learning (ML) is seen as a promising application that offers autonomous learning and provides optimized solutions to complex problems. The current Multiprotocol Label Switching (MPLS)-based communication system is packed with exponentially increasing applications and different Quality-of-Services (QoS) requirements. As the network is getting complex and congested, it will become challenging to satisfy the QoS requirements in the MPLS network. This study proposes a hybrid ML-based intrusion detection system (ML-IDS) and ML-based intelligent routing algorithm (ML-RA) for MPLS network. The research is divided into three parts, which are (1) dataset development, (2) algorithm development, and (3) algorithm performance evaluation. The dataset development for both algorithms is carried out via simulations in Graphical Network Simulator 3 (GNS3). The datasets are then fed into MATLAB to train ML classifiers and regression models to classify the incoming traffic as normal or attack and predict traffic delays for all available routes, respectively. Only the normal traffic predicted by the ML-IDS algorithm will be allowed to enter the network domain, and the route with the fastest delay predicted by the ML-RA is assigned for routing. The ML-based routing algorithm is compared to the conventional routing algorithm, routing Information Protocol version 2 (RIPv2). From the performance evaluations, the ML-RA shows 100 percent accuracy in predicting the fastest route in the network. During network congestion, the proposed ML outperforms the RIPv2 in terms of delay and throughput on average by 57.61 percent and 46.57 percent, respectively.

关键词： Machine learning intrusion detection system routing algorithm quality of service communication system

来源：评论

学校读者我要写书评

暂无评论

A Quantum Ant Colony Multi-Objective routing algorithm in WSN and Its Application in a Manufacturing Environment

引用

SENSORS 2019年第15期19卷 3334-3334页

作者： Li, Fei Liu, Min Xu, Gaowei Zhejiang Univ City Coll Dept Comp Sci Hangzhou 310015 Zhejiang Peoples R China Tongji Univ Coll Elect & Informat Engn Shanghai 201804 Peoples R China

In many complex manufacturing environments, the running equipment must be monitored by Wireless Sensor Networks (WSNs), which not only requires WSNs to have long service lifetimes, but also to achieve rapid and high-quality transmission of equipment monitoring data to monitoring centers. Traditional routing algorithms in WSNs, such as Basic Ant-Based routing (BABR) only require the single shortest path, and the BABR algorithm converges slowly, easily falling into a local optimum and leading to premature stagnation of the algorithm. A new WSN routing algorithm, named the Quantum Ant Colony Multi-Objective routing (QACMOR) can be used for monitoring in such manufacturing environments by introducing quantum computation and a multi-objective fitness function into the routing research algorithm. Concretely, quantum bits are used to represent the node pheromone, and quantum gates are rotated to update the pheromone of the search path. The factors of energy consumption, transmission delay, and network load-balancing degree of the nodes in the search path act as fitness functions to determine the optimal path. Here, a simulation analysis and actual manufacturing environment verify the QACMOR's improvement in performance.

关键词： wireless sensor network (WSN) energy ant colony optimization (ACO) routing algorithm quantum-inspired evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

The Study of Lighting Controller routing algorithm Design

The Study of Lighting Controller Routing Algorithm Design

引用

International Conference on Broadcast Technology and Multimedia Communication(BTMC 2010)

作者： Zhang Jun-chao Chen Jun-jie College of Computer Science and Technology TaiYuan University of Technology Taiyuan,China

City street light system is an important part of the city construction,and its intelligence reflects the city's modernization,which the important part is the street light *** lamp controller design part includes hardware design and software *** this paper,the main research is the algorithm research of the software part,we design of a street lamp controller in the new routing algorithm,the algorithm combined with ant colony optimization and routing algorithm,make the performance of the network to play the best as far as *** paper describes the new routing algorithm for a concrete realization of the process,and designed a new routing scheme,Finally,establishment of a specific mathematical model,verify the effectiveness of the improved algorithm with the detailed mathematical reasoning.

关键词： Lighting controller routing algorithm ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

The Minimum Delay routing algorithm for WOBAN

The Minimum Delay Routing Algorithm for WOBAN

引用

3rd International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)

作者： Ke Geng Ma Ying-ping Cao Wen-ting PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China PLAUST Postgrad Team ICE 1 Nanjing 210007 Jiangsu Peoples R China PLAUST Postgraduate Team ICE 3 Nanjing 210007 Jiangsu Peoples R China

ISBN: (纸本)9780769551227

The hybrid wireless-optical broadband access network (WOBAN) is a novel promising hybrid access network. We can improve its performance effectively by improving the wireless network routing algorithm of it. This paper proposes a novel routing algorithm - the minimum delay routing algorithm (MDRA). In the algorithm, A time delay estimation method is combined with the Dijkstra algorithm used in the routing algorithm for front-end wireless Mesh network (WMN) of WOBAN. Simulation results show that the delay and TDR performances of MDRA are better than that of the minimum hop algorithm (MHRA) in high load conditions in WOBAN.

关键词： WOBAN Dijkstra routing algorithm time delay the shortest path

来源：评论

学校读者我要写书评

暂无评论

An Energy Aware Cellular Learning Automata Based routing algorithm for Opportunistic Networks

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2016年第2期9卷 255-272页

作者： Zhang, Feng Wang, Xiaoming Li, Peng Zhang, Lichen Shaanxi Normal Univ Sch Comp Sci Xian 710062 Shaanxi Peoples R China

Message transmission in opportunistic networks is accomplished via the encounters of mobile nodes while moving around. The distributing of nodes greatly impacts the performance of message delivery ratio due to their sparse encounter opportunities. Nodes with exhaust energy can't participate in message transfer process. So it is very meaningful to make nodes energetic and balance the energy consumption between nodes. In this paper, a novel dynamic irregular cellular multiple learning automata (DICMLA) model and the corresponding routing algorithm are proposed to optimize the energy consumption of nodes. The proposed routing algorithm utilizes the characteristics of cellular learning automata to reduce the energy consumption of nodes and improve the delivery ratio of message transmission. The simulation results show that the proposed algorithm can obviously balance energy consumption of nodes and thus prolong the lifetime of the network.

关键词： Opportunistic networks routing algorithm Cellular learning automata (CLA) Energy efficient

来源：评论

学校读者我要写书评

暂无评论

An Efficient routing algorithm in Fat-tree Data Center Networks

An Efficient Routing Algorithm in Fat-tree Data Center Netwo...

引用

IEEE Global Communications Conference

作者： Zhemin Qian Bing Hu Kwan L. Yeung College of Information Science and Electronic Engineering Zhejiang University Department of Electrical and Electronic Engineering The University of Hong Kong

ISBN: (纸本)9781509013296

In fat-tree data center networks, routing a packet from its source to destination includes two phases, upstream (i.e. from source to watershed switch) and downstream (i.e. from watershed switch to destination). The throughput/non-blocking performance of networks hinges much on the effects of two phases above. In this paper, we propose a new routing algorithm called Global Round Robin (GRR) for fat-tree data center networks. In the upstream of GRR, each packet is sent to a toppest switch based on the GRR relationship between its source and toppest switches. Then the packet can arrive at a toppest switch in a single time slot without any blocking and buffering en route. In the downstream of GRR, the packet is routed to its destination using self-routing. The simulation results show that GRR provides the best delay/throughput performance among the existing routing algorithms for data center networks.

关键词： Data center network Fat-tree routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Personalized Indoor routing algorithm

Research on Personalized Indoor Routing Algorithm

引用

The 13th International Symposium on Distributed Computing and Applications to Business,Engineering and Science(DCABES 2014)(第十三届分布式计算及其应用国际学术研讨会)

作者： Weijun Bian Yucheng Guo Qizhi Qiu School of Computer Science and Technology Wuhan University of Technology WuhanChina

ISBN: (纸本)9781479941681

As the mature GPS positioning technology cannot work well in indoor environment,there is no mature indoor navigation system for civil *** indoor maps and indoor positioning technology,indoor routing algorithm is an important part of indoor navigation *** paper first discusses the problem of cross-storey in buildings and gives a *** outdoor routing,shortest path is usually not the best path indoors,a personalized path considering user preference and interest can be *** achieve personalized routing,this paper comes up with a way to model and acquire user *** this basis,this paper improves traditional A* algorithm by considering user preference and then gives an example to show the advantage of the personalized A* *** results show that the improved algorithm can find a better path by considering path length and user preference synthetically.

关键词： indoor navigation routing algorithm user preference personalized

来源：评论

学校读者我要写书评

暂无评论

RLbRR: A Reliable routing algorithm Based on Reinforcement Learning for Self-organizing Network

RLbRR: A Reliable Routing Algorithm Based on Reinforcement L...

引用

作者： Liyuan Zhang Lanlan Rui Yang Yang Yuejia Dou Min Lei Cyberspace Security Academy Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

With wireless communication rapid development, self-organizing network has been applied widely in various fields. Self-organizing network routing algorithm is a significant research direction. This work explores a reinforcement learning approach applied to self-organizing network packet routing. It is found that the existing routing algorithms for self-organizing network always use a single metric for next hop selection and fail to consider the influence of neighboring nodes on the forwarding nodes. The selection of the next hop does not have a comprehensive and long-term consideration, which is detrimental to promote routing reliability. Reinforcement learning can be used to solve this problem. In this paper,a Reinforcement Learning based Reliable routing(RLbRR) algorithm is designed after studying to the existing methods in the literatures. RLbRR algorithm evaluates the quality of the forwarding node by reinforcement learning algorithm and combines with multi components. In this way, the selection of the next hop can become all-sided, so as to establish a stable and reliable routing path. The simulation results show that RLbRR algorithm performs well in reliability.

关键词： routing algorithm Reinforcement learning Self-organizing network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：