An Algorithm to Improve MAODV Multicast Routing in MANET

2015 ◽  
Vol 713-715 ◽  
pp. 2427-2430
Author(s):  
Yue Li ◽  
Shu Chen Yang ◽  
Yin Hui Liu ◽  
Zhong Bao Luo
Keyword(s):  
Cost Function ◽  
Heuristic Algorithm ◽  
High Efficiency ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Delay Constraint ◽  
Routing Overhead ◽  
Simulation Results ◽  
The Cost ◽  
Multicast Routing Algorithm

By studying multicast routing algorithm for MANET, this paper proposes a new heuristic algorithm to improve MAODV performance. Algorithm calculate the cost function under the delay constraint conditions, dynamically adjust the leader node, thus reducing crowded areas produce, for MAODV provide Qos. Simulation results show that when the expansion of the network, this algorithm has less routing overhead, high efficiency.

A Multicast Routing Algorithm with Cost, Delay and Bandwidth Constraints

2013 ◽  
Vol 756-759 ◽  
pp. 1850-1854
Author(s):  
Yuan Chen Li ◽  
Guo Fang Kuang
Keyword(s):  
Communication Networks ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Routing Problem ◽  
Qos Parameters ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

Quality of service (QoS) generally assumes more than one QoS measure which implies that routing can be categorized as an instance of routing subject to multiple constraints: such as cost, delay, bandwidth, etc. The problem of constructing multicast trees is studied to meet the QoS requirements where it is necessary to provide bounded constraints among the source and all destinations while keeping the cost of the multicast tree low. So, a kind of source-destination QoS multicast routing problem is addressed about communication networks. The algorithm we presented takes bandwidth, delay and loss rate as premise, constructs routing selected function based on shortest path, modifies selected path according to the function above so as to fit multi-QoS parameters. Simulation results show that the algorithm has both lower delay and better performance and can be extended to cases of multiple QoS parameters conveniently.

A Multicast Routing Algorithm with Sparse Light Splitting Constrained

2010 ◽  
Vol 159 ◽  
pp. 412-419
Author(s):  
Li Du ◽  
Xiao Jing Wang ◽  
Li Lin ◽  
Han Yuan Zhang
Keyword(s):  
Multicast Routing ◽  
Blocking Probability ◽  
Routing Algorithm ◽  
Virtual Source ◽  
Minimum Path ◽  
Average Maximum ◽  
Path Cost ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Path Calculation

This paper investigates the defects that exist in the blocking probability and the cost of establishing light-tree in the multicast routing algorithm with sparse splitting capability constraint based on the Virtual Source (VS). It proposes a new multicast routing algorithm N_VSBA (New Virtual Source Based Algorithm). By introducing the minimum interference routing algorithm in the path calculation among the VS nodes, this new algorithm solves the problem of blocking caused by establishing the light-tree through a pre-computed path when two VS nodes concentrate. This algorithm also solves the problem of VS-based algorithm’s not being able to utilize the TaC (Tap and Continue) capability of indecomposable optical nodes by introduction of MPH (Minimum Path-cost Heuristic) algorithm into the process of adding light-tree into indecomposable nodes. Simulation results show that the new algorithm has improvements of different degrees in aspects of blocking probability, average number of wavelength links and average maximum number of wavelength.

Several Non-Rearranged Dynamic Multicast Routing Algorithms

2013 ◽  
Vol 397-400 ◽  
pp. 1107-1112
Author(s):  
Yin Fei Dai ◽  
Nian Feng Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Performance Testing ◽  
Routing Algorithms ◽  
Delay Constraint ◽  
Advantages And Disadvantages ◽  
Routing Optimization ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

In this paper, dynamic multicast routing and routing optimization criteria have been described.By comparing and analyzing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms, the advantages of the non-rearranged dynamic multicast routing algorithm based on the delay constraint have been further confirmed and a conclusion has been drawn by performance testing.

A DISTRIBUTED DYNAMIC HEURISTIC FOR DELAY-CONSTRAINED LEAST-COST MULTICAST ROUTING

2000 ◽  
Vol 01 (04) ◽  
pp. 331-344 ◽  
Author(s):  
Zhengying Wang ◽  
Bingxin Shi ◽  
Wei Liu
Keyword(s):  
Group Membership ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Network Resources ◽  
End To End Delay ◽  
Dynamic Multicast ◽  
Simulation Results ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distributed dynamic delay-constrained least-cost multicast routing algorithm (DDDCLCMR) to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.

Research on Optimal Routing Algorithm with End-to-End Delay Bounded

2014 ◽  
Vol 556-562 ◽  
pp. 4159-4162
Author(s):  
Yuan Chen Li ◽  
Wei Qun Liu
Keyword(s):  
Time Complexity ◽  
Multicast Routing ◽  
Low Cost ◽  
Routing Algorithm ◽  
Optimal Routing ◽  
End To End Delay ◽  
Comprehensive Performance ◽  
Simulation Results ◽  
End To End ◽  
Multicast Routing Algorithm

This paper researches the problem of minimization of delay under the multicast end-to-end delay bounded and presents a new multicast routing algorithm. This algorithm using anew strategy based on Optimized_Floyd algorithm modifies the paths from the source node to the destinations, the nodes whose delay are smaller than the average achieves a new delay as big as possible and the nodes whose delay are above the average achieves a new delay as small as possible. So it also offers a good balance between tree cost and delay. Simulation results show that the algorithm has low cost, less time complexity and good comprehensive performance, can be used in actual network environment.

Overlay multicast routing algorithm with minimum overlay cost

2009 ◽  
Vol 28 (10) ◽  
pp. 2569-2572
Author(s):  
Long-xin LIN ◽  
Jie ZHOU ◽  
Ling ZHANG ◽  
Zhao YE
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Overlay Multicast ◽  
Multicast Routing Algorithm
Sign in / Sign up

Export Citation Format

Share Document