检索结果-南通市图书馆

multicast routing Based on Hybrid Genetic Algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Beijing Institute of Technology 2005年第2期14卷 130-134页

作者：曹元大蔡刿 School of Software Beijing Institute of Technology Beijing100081 China School

A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.

关键词： multicast routing hybrid genetic algorithm(HGA) simulation algorithm Steiner tree

Core-based Shared Tree multicast routing Algorithms for LEO Satellite IP Networks

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2007年第4期20卷 353-361页

作者： Cheng Lianzhen Zhang Jun Liu Kai School of Electronics and lnformation Engineering Beijing University of Aeronautics and Astronautics Beijing 100083 China

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.

关键词： satellite IP networks LEO multicast routing shared tree core

DRMR： Dynamic-Ring-Based multicast routing Protocol for Ad Hoc Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2004年第6期19卷 909-919页

作者： YuanZhou Guang-ShengLi Yong-ZhaoZhan Qi-RongMao Yi-BinHou SchoolofComputerandCommunicationEngineering JiangsuUniversityZhenjiang212013P.R.China SchoolofComputerSoftware BeijingUniversityofTechnologyBeijing100083P.R.China iaotongUniversity Xi＇an710071P.R.China

Recently a number of multicast routing protocols for ad hoc networks have been proposed, however, most of them do not provide proper tradeoffs between effectiveness, efficiency and scalability. In this paper, a novel multicast routing protocol is presented for ad hoc networks. The protocol, termed as dynamic-ring-based multicast routing protocol (DRMR), uses the concept of dynamic ring whose radius can be adjusted dynamically and DRMR configures this type of ring for all group member nodes. According to the principle of zone routing, two nodes whose rings overlap can create route to each other, thus, when the ring graph composed of all rings is connected, each member node has one or more routes to others. DRMR uses the method of expanding ring search (ERS) to maintain the connected ring graph, and also can decrease the radius of the ring to reduce the overhead. The performances of DRMR were simulated and evaluated with NS2, and results show that DRMR has a high data packet delivery ratio, low control overhead and good scalability.

关键词： ad hoc wireless network multicast routing protocol dynamic ring

A Heuristic Algorithm for Core Selection in multicast routing

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2011年第6期26卷 954-961页

作者： Manas Ranjan Kabat Manoj Kumar Patel Chita Ranjan Tripathy Department of Computer Science and Engineering Veer Surendra Sai University of Technology

With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.

关键词： QoS routing multicast routing delay-variation end-to-end delay

Optimized multicast routing Algorithm Based on Tree Structure in MANETs

在线全文

学校读者我要写书评

暂无评论

China Communications 2014年第2期11卷 90-99页

作者： LI Xu LIU Tianjiao LIU Ying TANG Yan State Key Laboratory of Rail Traffic Control and Safety School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044 China

Mobile Ad hoc Networks(MANETs) play an important role in emergency communications where network needs to be constructed temporarily and *** the nodes move randomly,routing protocols must be highly effective and reliable to guarantee successful packet *** on the data delivery structure,most of the existing multicast routing protocols can be classified into two folders:tree-based and *** observe that tree-based ones have high forwarding efficiency and low consumptions of bandwidth,and they may have poor robustness because only one link exists between two *** a treebased multicast routing protocol,MAODV(multicast Ad hoc On-demand Vector) shows an excellent performance in lightweight ad hoc *** the load of network increases,QoS(Quality of Service) is degraded *** this paper,we analyze the impact of network load on MAODV protocol,and propose an optimized protocol MAODV-BB(multicast Ad hoc On-demand Vector with Backup Branches),which improves robustness of the MAODV protocol by combining advantages of the tree structure and the mesh *** not only can update shorter tree branches but also construct a multicast tree with backup *** analysis and simulation results both demonstrate that the MAODV-BB protocol improves the network performance over conventional MAODV in heavy load ad hoc networks.

关键词： multicast routing MAODV treestructure backup branch

Distributed QoS multicast routing protocol in ad hoc networks

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2006年第3期17卷 692-698页

作者： Sun Baolin Li Layuan School of Computer Science and Technology Wuhan Univ. of Technology Wuhan 430063 P. R. China Dept. of Mathematics and Physics Wuhan Univ. of Science and Engineering Wuhan 430073 P. R. China

Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.

关键词： ad hoc network multicast routing routing protocol QoS.

Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2008年第3期18卷 331-336页

作者： Baolin Sun a,c, Shangchao Pi b, Chao Gui a, Yue Zeng d, Bing Yan a, Wenxiang Wang c, Qianqing Qin c a School of Computing, Hubei University of Economics, Wuhan 430205, China b College of Science, Zhongyuan University of Technology, Zhengzhou 450007, China c State Key Laboratory of Information Engineering in Surveying, Mapping & Remote Sensing, Wuhan University, Wuhan 430079, China d Department of Computing, Jiangxi Vocational College of Finance and Economics, Jiangxi 332000, China School of Computing Hubei University of Economics Wuhan 430205 China State Key Laboratory of Information Engineering in Surveying Mapping & Remote Sensing Wuhan University Wuhan 430079 China College of Science Zhongyuan University of Technology Zhengzhou 450007 China Department of Computing Jiangxi Vocational College of Finance and Economics Jiangxi 332000 China

Usually multiple quality of service (QoS) guarantees are required in most multicast applications. This paper presents a multiple con-straints algorithm for multicast traffic engineering in mobile ad hoc networks (MANET). The proposed algorithm is a new version of multiple constraints QoS multicast routing optimization algorithm in MANET based on genetic algorithm (MQMGA). The proposed MQMGA can optimize the maximum link utilization, the cost of the multicast tree, the selection of the long-life path, the average delay and the maximum end-to-end delay. Experimental result shows that the approach is efficient, has promising performance in multicast traffic engineering and for evaluating the route stability in dynamic mobile networks.

关键词： Ad hoc network multicast routing QoS Genetic algorithm

Ant Colony Optimization for Multi-Objective multicast routing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2020年第6期63卷 1159-1173页

作者： Ahmed Y.Hamed Monagi H.Alkinani M.R.Hassan Department of Computer Science Faculty of Computers and InformationSohag UniversitySohag82524Egypt Department of Computer Science and Artificial Intelligence College of Computer Science and EngineeringUniversity of JeddahJeddah21959Saudi Arabia Department of Mathematics and Computer Science Faculty of ScienceAswan UniversityAswan81528Egypt

In the distributed networks,many applications send information from a source node to multiple destination *** support these applications requirements,the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer *** proposed algorithm simultaneously optimizes total weight(cost,delay and hop)of the multicast *** results prove the proposed algorithm outperforms a recently published Multi-objective multicast Algorithm specially designed for solving the multicast routing ***,it is able to find a better solution with fast convergence speed and high reliability.

关键词： Multimedia communication multicast routing multicast tree quality of service ant colony

Tree-based differential evolution algorithm for QoS multicast routing

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第4期18卷 76-81页

作者： KONG Sun CHEN Zeng-qiang Department of Automation Nankai University Tianjin 300071 China

Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimization problem, a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node. This method maybe obtains the better result, but it can consume a lot of computational time. To solve the problem, a tree-based DE algorithm is introduced in this paper. The central operations of the algorithm are realized with tree structure. This method saves the time of finding paths and integrating them to construct a multicast tree. The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.

关键词： quality of service (QoS) multicast routing DE tree structure