Minimum power multicasting with delay bound constraints in Ad Hoc wireless networks

In this paper, we design a new heuristic for an important extension of the minimum power multicasting problem in ad hoc wireless networks. Assuming that each transmission takes a fixed amount of time, we impose constraints on the number of hops allowed to reach the destination nodes in the multicasting application. This setting would be applicable in time critical or real time applications, and the relative importance of the nodes may be indicated by these delay bounds. We design a filtered beam search procedure for solving this problem. The performance of our algorithm is demonstrated on numerous test cases by benchmarking it against an optimal algorithm in small problem instances, and against a modified version of the well-known Broadcast Incremental Power (BIP) algorithm 20 for relatively large problems

Analysis of Performance of Dynamic Multicast Routing Algorithms

In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the Source Optimised Tree algorithm achieves a significant improvement in terms of delay and link usage when compared to the Core Based Tree, and greedy algorithm

GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Abstract Th

An Efficient Algorithm for Delay and Delay- Variation Bounded Core Based Tree Generation

Many multimedia group applications require the construction of multicast tree satisfying the quality of service (QoS) requirements. To support real time communication, computer networks need to optimize the Delay and Delay-Variation Bounded Multicast Tree (DVBMT). The problem is to satisfy the end-to-end delay and delay-variation within an upper bound. The DVBMT problem is known to be NP complete. In this paper, we propose an efficient core selection algorithm for satisfying the end-to-end delay and delay-variation within an upper bound. The efficiency of the proposed algorithm is validated through the simulation. The simulation results reveal that our algorithm performs better than the existing heuristic algorithms

A heuristic multicast algorithm to support QoS group communications in heterogeneous network

2005-2006 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

An algorithm for join/prune mechanisms for improving handoff using mobility prediction in wireless networks

In this paper, we provide a detailed description of an algorithm that implements join and prune mechanisms, which will help to build an optimal multicast tree with QoS requirements during handoff. An analysis is presented to show how mobility prediction can help in the selection of potential access routers (AR) with QoS requirements that affect multicast group size and bandwidth cost in the multicast tree. The proposed technique tries to minimise the number of multicast tree join and prune operations. We have examined the performance of this algorithm using simulations in various environments and obtained good performance results. Our results show that the expected multicast group increases linearly with the increase in the number of selected destination access routers (AR) for multicast during handoff. We observe that the expected number of joins and prunes from the multicast tree increases with group size. Thus, for an increased number of destinations, the estimated cost of the multicast tree in a cellular network also increases

On the characterization of the source-to-all-terminal diameter-constrained reliability domination

Let G = (V;E) be a digraph with a distinguished set of terminal vertices K V and a vertex s 2 K . We de ne the s;K-diameter of G as the maximum distance between s and any of vertices of K. If the arcs fail randomly and independently with known probabilities (vertices are always operational), the Diameter-constrained s;K-terminal reliability of G, Rs;K(G;D), is de ned as the probability that surviving arcs span a subgraph whose s;K- diameter does not exceed D [5, 11]. A graph invariant called the domination of a graph G was introduced by Satyanarayana and Prabhakar [13] to generate the non-canceling terms of the classical reliability expres- sion, Rs;K(G), based on the same reliability model (i.e. arcs fail randomly and indepen- dently and where nodes are perfect), and de ned as the probability that the surviving arcs span a subgraph of G with unconstrained nite s;K-diameter. This result allowed the generation of rapid algorithms for the computation of Rs;K(G). In this paper we present a characterization of the diameter-constrained s;K-terminal reliability domination of a digraph G = (V;E) with terminal set K = V , and for any diameter bound D, and, as a result, we solve the classical reliability domination, as a speci c case. Moreover we also present a rapid algorithm for the evaluation of Rs;V (G;D).Eje: Teoría (TEOR)Red de Universidades con Carreras en Informática (RedUNCI

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

Within the development of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast communication. Multicast IP routing is an important topic, covering both theoretical and practical interest in different networks layers. In network layer, there are several multicast routing protocols using multicast routing trees different in the literature. However PIM-SM and CBT protocols remains the most used multicast routing protocols; they propose using a shared Core-based Tree CBT. This kind of tree provides efficient management of multicast path in changing group memberships, scalability and performance. The prime problem concerning construction of a shared tree is to determine the best position of the core. QoS-CS’s problem (QoS constraints core Selection) consists in choosing an optimal multicast router in the network as core of the Shared multicast Tree (CBT) within specified QoS constraints associated. The choice of this specific router, called RP in PIM-SM protocol and core in CBT protocol, affects the structure of multicast routing tree, and therefore influences performances of both multicast session and routing scheme. QoS-CS is an NP complete problem need to be solved through a heuristic algorithm, in this paper, we propose a new core Selection algorithm based on Variable Neighborhood Search algorithm and new CMP fitness function. Simulation results show that good performance is achieved in multicast cost, end-to-end delay, tree construction delay and others metrics