Fast determination of QoS-based multicast routes in wireless networks using genetic algorithm

Abstract

Abs/ruc/-In this paper, we propose a novel multicast route discovery scheme for wireless networks, satisfying quality of service (QoS) constraints such as bandwidth requirement and end-to-end delay guarantees. The underlying approach is based on a genetic algorithm (GA). The problem of (optimal) multicast route discovery is NP-Hard when the network state information is inaccurate, which is so common in the wireless domain. In general, this makes it difficult to determine multicast routes on demand, and hence the network resources are never used to their full potential. The proposed GA based method, however, is shown to discover multicast routes for large networks within few iterations, even with imprecise network information, and thus it can he used for an on-demand basis. We observed an approximate linear relationship between the computation time and the number of nodes in a network. In addition we have studied the effects of choosing the fitness function of the GA.

Genetic Algorithms for Network Optimization

“…In our version of a genetic algorithm XCG for multicast sessions the constraints form a part of the fitness function (11) and unfeasible paths appear there meanwhile.…”

“…Using earlier limitations we The objective (fitness) function aggregates all optimization conditions and at the same time is responsible for our assumptions and limitations introduced earlier. It possesses three components [11,13]:…”

“…One of algorithms is a small improvement of Banerjee and Dass multicriterion algorithm [11], called BD algorithm, another is Xianwei, Changjia and Gang algorithm, called XCG algorithm [12] that is based on Steiner tree. In the Polish literature the position [13] contains comprehensive description of both original algorithms as well as two others.…”

Media Streams Planning with Uncertain Link Capacities

“…Again, the genetic algorithms were used to solve the problems with uncertain link delays and bandwidths or link costs [32]. Similar problems were studied for wireless networks for single multicast tree [33] or multiple groups [34]. Aim of these algorithms is to build multicast trees under given QoS constraints while maintaining required level of reliability.…”

On Routing for Multiple Description Video Over Wireless Ad Hoc Networks

“…For example, GA has been explored to address various networking problems such as routing [18], [30], [31], admission control [32], channel assignment [33], network design [34], scheduling [35] and buffer management [36]. These efforts have made the important step in exploring the potential of GA for network optimization.…”