# Multiconstrained QoS Routing Using a Differentially Guided Krill Herd Algorithm in Mobile Ad Hoc Networks

Authors: D. Kalaiselvi; R. Radhakrishnan
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

This paper presents a multiconstrained quality-of-service routing (QoSR) based on a differentially guided krill herd (DGKH) algorithm in mobile ad hoc networks (MANETs). QoSR is a NP-complete and significant problem with immense challenges in determining an optimum path that simultaneously satisfies various constraints in MANETs, where the topology varies constantly. Various heuristic algorithms are widely used to solve this problem with compromise on excessive computational complexities and/or low performance. This paper proposes a krill herd based algorithm called DGKH, where the krill individuals do not update the position in comparison with one-to-one (as usual), but instead it uses the information from various krill individuals and then searches to determine a feasible path. Experiment results on MANETs with different number nodes (routes) are considered with three constraints which are maximum allowed delay, maximum allowed jitter, and minimum requested bandwidth. It is demonstrated that the proposed DGKH algorithm is an effective approximation algorithm exhibiting satisfactory performance than the KHA and existing algorithms in the literature by determining an optimum path that satisfies more than one QoS constraint in MANETs.


---

## Body

## 1. Introduction

Mobile ad hoc networks (MANETs) are class of wireless communication networks without a fixed infrastructure. The MANET nodes do not provide reliable services and QoS (quality of service) guarantees as compared to other wireless networks such as WiFi, WiMAX, GSM, and CDMA [1]. The QoS parameters to be guaranteed for multimedia group communication are bandwidth, delay, packet loss rate, jitters, and bandwidth-delay product. QoS is one of the significant components to evaluate MANET performance since QoS restricts the bounds on bandwidth, delay, bandwidth delay product, jitter, and packet loss [2, 3]. The violation of these parameters degrades the overall performance of an application.Its primary goal is to allocate network resources efficiently while the different QoS requirements are satisfied simultaneously. The QoS requirements can be classified into link constraints (e.g., band width), path constraints (e.g., end to end delay), and tree constraints (e.g., delay-jitter). The interdependency and confliction among multiple QoS parameters, however, make the problem very difficult and NP-complete [4, 5]. For the reason that the QoS multicast routing problem is NP-complete, several heuristic algorithms have been deployed to address this problem. For example, simulated annealing (SA), a powerful global optimization procedure, was utilized to solve the QoSR problem [6]. Unlike other heuristic techniques SA involves single candidate to search for the solution that make the method inefficient while solving large dimension problems.Subsequently another powerful population based technique called genetic algorithms (GAs) has been engaged to solve the QoSR problem [7–9]. GA assures a larger possibility of locating a global optimum by starting with multiple random search points and processing several candidate solutions simultaneously. Perhaps, it is always criticized that genetic algorithms encounters some faults such as lack of local search ability, premature convergence, and slow convergence speed. Similarly, due to the advent of swarm intelligence theory, a category of stochastic search methods for solving optimization (GO) problems of NP nature, ant colony optimization (ACO), and particle swarm optimization (PSO) is introduced.Similar to GA, these two methods were also shown to be efficient tools for solving the multicast routing problem [10–13]. In [10, 11] the QoS-multiple constrained optimization problem has been solved using ant colony optimization (ACO) algorithm. Here the authors examined the degree and delay-constrained broadcasting problem with minimum cost using an ant colony-based algorithm. After simulations and comparisons with previous ant algorithm, and to two GA-based algorithms, the obtained results exhibited the best cost but again with too long computation time.Consequently PSO [12, 13] was also used to address the QoSR problem. PSO can be easily implemented and is computationally inexpensive, since its memory and CPU speed requirements are low. PSO has been proved to be an efficient approach for many optimization problems with its fast convergence and simple steps to solve a problem. In spite of these merits, a known fact that PSO has a severe drawback in the update of its global best (gbest) particle, which has a crucial role of guiding the rest of the particles, this leads to overcoming better solutions in the course of search.In row of these heuristics, another new metaheuristic called Bees Life Algorithm (BLA) is proposed [14]. As one of the specie colony optimization, BLA is considered as a swarm intelligence algorithm and an approximate optimization method which performs according to collaborative individual behaviors in the population. But still like other probabilistic optimization algorithms, BLA has inherent drawback of premature convergence or stagnation that leads to loss of exploration and exploitation capability. In line to this, other heuristics like tabu search [15] and harmony search algorithm [16] were proposed for QoSR with minimum number of constraints.In fact there is a growing body of literature in the application of emerging heuristics to solve the NP-hard QoSR problem. This paper proposes a krill herd based algorithm for QoSR in MANETS. Krill herd algorithm (KHA) is a recently developed powerful evolutionary algorithm proposed by Gandomi and Alavi [17]. The KHA is based on the herding behavior of krill individuals. Each krill individual modifies its position using three processes, namely, (
1
) movement induced by other individuals, (
2
) foraging motion, and (
3
) random physical diffusion. The motion induced by other individuals and foraging motion contain global and local strategies, respectively, which make KHA a powerful technique. However, sometimes, KHA is unable to generate global optimal solutions on some high-dimensional nonlinear optimization problems.Thus this paper proposes a differentially guided krill herd (DGKH) algorithm where the krill individuals do not update the position in comparison with one-to-one (as usual) instead it uses the information from various krill individuals and then searches to determine a feasible path. Thus the induction stage uses the position information from various krill individuals at random, making the search exhaustive, and leads to quick search of better solutions.The rest of the paper is organized as follows. In Section2, the problem statement of QoS routing problem in MANETS is introduced. The overview of KHA is briefly explained in Section 3 with description of the proposed differential guiding mechanism. Section 4 presents the numerical experiments with a standard QoS multicast routing problem. A detailed discussion about the proposed method in theoretical perspective is detailed in Section 5. The paper is concluded in Section 6.


## 2. Problem Statement

LetG
=
(
V
,
E
) be an undirected graph representing the network topology, where V is the set of nodes and E is the set of links. The source node and the multicast destination node set containing r destinations are the routes for multicast [18]. The end-to-end QoS requirements are expressed as constraints from the source to the destinations and are given by the following.The delay (DL) is the maximum delay along any branch of the tree. A penalty is added if no link is found between two nodes. Consider(1)
D
p
s
,
t
=
∑
e
∈
p
s
,
t
d
e
l
a
y
e
+
∑
n
∈
p
s
,
t
d
e
l
a
y
n
.The bandwidth (BW) of the multicast tree is the average bandwidth requirement of all the tree branches. Consider(2)
B
p
s
,
t
=
m
i
n
b
a
n
d
w
i
d
t
h
e
,
e
∈
p
s
,
t
.The delay-jitter (DJ) is the maximum delay variation along any branch of the tree. Consider(3)
D
J
p
s
,
t
=
∑
e
∈
p
s
,
t
d
e
l
a
y
_
j
i
t
t
e
r
e
+
∑
n
∈
p
s
,
t
d
e
l
a
y
_
j
i
t
t
e
r
n
.The packet loss rate is the average packet loss along the tree branches. The cutoff for PLR is set at 10%. If a branch is having more than 10% packet loss, then a penalty is assigned, such that the model tries to search a path less than 10% PLR:(4)
P
L
p
s
,
t
=
1
-
∏
n
∈
p
s
,
t
1
-
p
a
c
k
e
t
_
l
o
s
s
n
.The above QoS criteria have to be fulfilled with an objective to minimize cost function of the multicast tree as given by (5)
C
T
s
,
M
=
∑
e
∈
T
s
,
M
c
o
s
t
e
+
∑
n
∈
T
s
,
M
c
o
s
t
n
.Thus the QoS routing problem is formulated as an optimization problem whose goal is to find a multicast tree T
(
s
,
M
) such that the cost function C
(
T
(
s
,
M
)
) is minimized subject to the constraints as follows: (6)
M
i
n
i
m
i
z
e
C
T
s
,
M
s
.
t
.
D
p
s
,
T
≤
Q
D
B
p
s
,
T
≥
Q
B
D
J
p
s
,
T
≤
Q
D
J
P
L
p
s
,
T
≤
Q
P
L
.Subsequently the fitness function is defined as the sum of the cost function and penalized constraints as follows: (7)
M
i
n
i
m
i
z
e
f
T
s
,
M
=
f
c
+
ω
1
f
b
+
ω
2
f
d
+
ω
3
f
d
j
+
ω
4
f
p
l
,where(8)
f
c
=
c
o
s
t
T
s
,
M
,
f
b
=
∑
t
∈
M
m
a
x
Q
B
-
B
p
s
,
t
,
0
,
f
d
=
∑
t
∈
M
m
a
x
D
p
s
,
t
-
Q
D
,
0
,
f
d
j
=
∑
t
∈
M
m
a
x
D
J
p
s
,
t
-
Q
J
,
0
,
f
p
l
=
∑
t
∈
M
m
a
x
P
L
p
s
,
t
-
Q
P
L
,
0
,where QD is delay constraint, QB is bandwidth constraint, QDJ is delay-jitter constraint, and QPL is packet loss constraint. Also ω
1
,
ω
2
,
ω
3
,
ω
4, are the weights of bandwidth, delay, delay-jitter, and packet loss, respectively. In the next section, the solution methodology to solve the multicast QoS routing problem is explained in detail.


## 3. Proposed Methodology

### 3.1. Krill Herd Algorithm: An Overview

Krill herd algorithm (KHA) is a recently developed heuristic algorithm based on the herding behavior of krill individuals. It has been first proposed by Gandomi and Alavi [17]. It is a population based method consisting of a large number of krill in which each krill moves through a multidimensional search space to look for food. In this optimization algorithm, the positions of krill individuals are considered as different design variables and the distance of the food from the krill individual is analogous to the fitness value of the objective function. In KHA, the individual krill alters its position and moves to the better positions. The movement of each individual is influenced by the three processes, namely, (i) induction process, (ii) foraging activity, and (iii) random diffusion. These operators are briefly explained and mathematically expressed as follows.(i) Induction. In this process, the velocity of each krill is influenced by the movement of other krill individuals of the multidimensional search space and its velocity is dynamically adjusted by the local, target, and repulsive vector. The velocity of the ith krill at the mth movements may be formulated as follows [17]:(
9
)
v
i
m
=
α
i
v
i
m
a
x
+
ω
n
v
i
m
-
1
,
(
10
)
α
i
=
∑
j
=
1
N
S
f
i
-
f
j
f
w
-
f
b
×
Z
i
-
Z
j
Z
i
-
Z
j
+
r
a
n
d
0,1
+
2
r
a
n
d
0,1
+
i
i
m
a
x
f
i
b
e
s
t
Z
i
b
e
s
t
,where V
i
m
a
x is the maximum induced motion; V
i
m and V
i
m
-
1 are the induced motion of the ith krill at the mth and (
m
-
1
)
t
h movement; ω
n is the inertia weight of the motion induced; f
w and f
b are the worst and the best position, respectively, among all krill individuals, of the population; f
i, f
j are the fitness value of the ith and jth individuals, respectively; N
S is the number of krill individuals surrounding the particular krill; i and i
m
a
x are the current iteration and the maximum iteration number.A sensing distance (S
D
i) parameter is used to identify the neighboring members of each krill individual. If the distance between the two krill individuals is less than the sensing distance, that particular krill is considered as neighbor of the other krill. The sensing distance may be represented by [17](11)
S
D
i
=
1
5
n
p
∑
k
=
1
n
p
Z
i
-
Z
k
,where n
p is the population size; Z
i and Z
k are the position of the ith and k
t
h krill, respectively.(ii) Foraging Action. Each individual krill updates its foraging velocity according to its own current and previous food location. The foraging velocity of the ith krill at the m
t
h movement may be expressed by [17](12)
V
f
i
m
=
0.02
2
1
-
i
i
m
a
x
f
i
∑
k
=
1
N
S
Z
k
/
f
k
∑
k
=
1
N
S
1
/
f
k
+
f
i
b
e
s
t
X
i
b
e
s
t
+
ω
x
V
f
i
m
-
1
,where ω
X is the inertia weight of the foraging motion; V
f
i
m
-
1 and V
f
i
m are the foraging motion of the ith krill at the (
m
-
1
)th and m movement.(iii) Random Diffusion. In KHA algorithm, in order to enhance the population diversity, random diffusion process is incorporated in krill individuals. This process maintains or increases the diversity of the individuals during the whole optimization process. The diffusion speed of krill individuals may be expressed as follows [17]:(13)
v
D
i
m
=
μ
v
D
m
a
x
,where V
D
m
a
x is the maximum diffusion speed; μ is a directional vector uniformly distributed between (−1, 1).(iv) Position Update. In KHA, the krill individuals fly around in the multidimensional space and each krill adjusts its position based on induction motion, foraging motion, and diffusion motion. In this way, KHA combines local search with global search for balancing the exploration and exploitation. The updated position of the ith krill may be expressed as [17](14)
Z
i
m
+
1
=
Z
i
m
+
V
i
m
+
V
f
i
m
+
V
D
i
m
P
t
∑
j
=
1
N
d
u
j
-
l
j
,where N
d is the number of control variables; u
j and l
j are the maximum and minimum limits of the jth control variable; P
t is the position constant factor. The above procedure will be used to optimize (7) for MANET routing optimization.


### 3.2. Differentially Guided Procedure

This procedure is incorporated in the movement induced by other krill individuals. In the original KHA, the velocity of theith krill at the mth run is given in (10). The vectors show the induced directions by different neighbors and each value presents the effect of a neighbor. The neighbors’ vector can be attractive or repulsive since the normalized value can be negative or positive. For choosing the neighbor, in original KHA a sensing distance (S
D
i) is adopted. Instead of such choice, where the krill individuals update the position in comparison with one-to-one (as in original KHA), this research proposes a new mechanism whence the induction stage uses the position information from various krill individuals at random.Differential Guiding Mechanism. All krill individuals can generate new positions in the search space using the information derived from different krill individuals’ using best information. To ensure that a krill individual learns from good exemplars and to minimize the time wasted on poor directions, we allow the krill individual to learn from the exemplars until the krill individual ceases improving for a certain number of generations called the refreshing gap. We observe three main differences between the DGKH algorithm and the original KHA [17].(1)
Once the sensing distance is used to identify the neighboring members of each krill individual, as exemplars to update the position, this mechanism utilizes the potentials of all krill individualsas exemplars to guide a krill individual’s new position.
(2)
Instead of learning from the same exemplar krill individual’s for all dimensions, each dimension of a krill individual in general can learn from different krill individuals for different dimensions to update its position. In other words, each dimension of a krill individual may learn from the corresponding dimension of different krill individual based on the proposed equation (15).
(3)
Finding the neighbor for different dimensions to update a krill individual position is done randomly (with a vigil that repetitions are avoided). This improves the thorough exploration capability of the original KHA with large possibility to avoid premature convergence in complex optimization problems.Compared to the original KHA, DGKH algorithm searches more promising regions to find the global optimum. The difference between KHA and DGKH is that the differential operator applied to only accept the basic KHA generating new better solution for each krill instead of accepting all the krill updating adopted in KH. This is rather greedy. The original KHA is very efficient and powerful but is highly prone to premature convergence. Therefore, to evade premature convergence and further improve the exploration ability of the original KHA, a differential guidance is used to tap useful information in all the krill individuals to update the position of a particular krill individual. The following expresses the differential mechanism:(15)
Z
i
-
Z
j
=
z
i
1
z
i
2
z
i
3
⋯
z
i
n
-
z
ρ
1
z
ρ
2
z
ρ
3
⋯
z
ρ
n
,where z
i
1 is the first element in the n dimension vector Z
i, z
i
n is the nth element in the n dimension vector Z
i, z
ρ
1 is the first element in the n dimension vector Z
p, and ρ is the random integer generated separately for each z, between 1 to n, but ρ
≠
i.Figure1 shows the differential mechanism for choosing the neighbor krill individual for (10). This assumes that the dimension of the problem as 5 and assumes krill size as 6 are in the search. Once the neighbor krill individuals are identified using the sensing distance, the ith individual position will be updated (with all neighbor krill individuals) as shown in Figure 1. This is in an effort to avoid premature convergence and explore a large promising region in the prior run phase to search the whole space extensively.Figure 1
Differential mechanism illustrated.


## 3.1. Krill Herd Algorithm: An Overview

Krill herd algorithm (KHA) is a recently developed heuristic algorithm based on the herding behavior of krill individuals. It has been first proposed by Gandomi and Alavi [17]. It is a population based method consisting of a large number of krill in which each krill moves through a multidimensional search space to look for food. In this optimization algorithm, the positions of krill individuals are considered as different design variables and the distance of the food from the krill individual is analogous to the fitness value of the objective function. In KHA, the individual krill alters its position and moves to the better positions. The movement of each individual is influenced by the three processes, namely, (i) induction process, (ii) foraging activity, and (iii) random diffusion. These operators are briefly explained and mathematically expressed as follows.(i) Induction. In this process, the velocity of each krill is influenced by the movement of other krill individuals of the multidimensional search space and its velocity is dynamically adjusted by the local, target, and repulsive vector. The velocity of the ith krill at the mth movements may be formulated as follows [17]:(
9
)
v
i
m
=
α
i
v
i
m
a
x
+
ω
n
v
i
m
-
1
,
(
10
)
α
i
=
∑
j
=
1
N
S
f
i
-
f
j
f
w
-
f
b
×
Z
i
-
Z
j
Z
i
-
Z
j
+
r
a
n
d
0,1
+
2
r
a
n
d
0,1
+
i
i
m
a
x
f
i
b
e
s
t
Z
i
b
e
s
t
,where V
i
m
a
x is the maximum induced motion; V
i
m and V
i
m
-
1 are the induced motion of the ith krill at the mth and (
m
-
1
)
t
h movement; ω
n is the inertia weight of the motion induced; f
w and f
b are the worst and the best position, respectively, among all krill individuals, of the population; f
i, f
j are the fitness value of the ith and jth individuals, respectively; N
S is the number of krill individuals surrounding the particular krill; i and i
m
a
x are the current iteration and the maximum iteration number.A sensing distance (S
D
i) parameter is used to identify the neighboring members of each krill individual. If the distance between the two krill individuals is less than the sensing distance, that particular krill is considered as neighbor of the other krill. The sensing distance may be represented by [17](11)
S
D
i
=
1
5
n
p
∑
k
=
1
n
p
Z
i
-
Z
k
,where n
p is the population size; Z
i and Z
k are the position of the ith and k
t
h krill, respectively.(ii) Foraging Action. Each individual krill updates its foraging velocity according to its own current and previous food location. The foraging velocity of the ith krill at the m
t
h movement may be expressed by [17](12)
V
f
i
m
=
0.02
2
1
-
i
i
m
a
x
f
i
∑
k
=
1
N
S
Z
k
/
f
k
∑
k
=
1
N
S
1
/
f
k
+
f
i
b
e
s
t
X
i
b
e
s
t
+
ω
x
V
f
i
m
-
1
,where ω
X is the inertia weight of the foraging motion; V
f
i
m
-
1 and V
f
i
m are the foraging motion of the ith krill at the (
m
-
1
)th and m movement.(iii) Random Diffusion. In KHA algorithm, in order to enhance the population diversity, random diffusion process is incorporated in krill individuals. This process maintains or increases the diversity of the individuals during the whole optimization process. The diffusion speed of krill individuals may be expressed as follows [17]:(13)
v
D
i
m
=
μ
v
D
m
a
x
,where V
D
m
a
x is the maximum diffusion speed; μ is a directional vector uniformly distributed between (−1, 1).(iv) Position Update. In KHA, the krill individuals fly around in the multidimensional space and each krill adjusts its position based on induction motion, foraging motion, and diffusion motion. In this way, KHA combines local search with global search for balancing the exploration and exploitation. The updated position of the ith krill may be expressed as [17](14)
Z
i
m
+
1
=
Z
i
m
+
V
i
m
+
V
f
i
m
+
V
D
i
m
P
t
∑
j
=
1
N
d
u
j
-
l
j
,where N
d is the number of control variables; u
j and l
j are the maximum and minimum limits of the jth control variable; P
t is the position constant factor. The above procedure will be used to optimize (7) for MANET routing optimization.


## 3.2. Differentially Guided Procedure

This procedure is incorporated in the movement induced by other krill individuals. In the original KHA, the velocity of theith krill at the mth run is given in (10). The vectors show the induced directions by different neighbors and each value presents the effect of a neighbor. The neighbors’ vector can be attractive or repulsive since the normalized value can be negative or positive. For choosing the neighbor, in original KHA a sensing distance (S
D
i) is adopted. Instead of such choice, where the krill individuals update the position in comparison with one-to-one (as in original KHA), this research proposes a new mechanism whence the induction stage uses the position information from various krill individuals at random.Differential Guiding Mechanism. All krill individuals can generate new positions in the search space using the information derived from different krill individuals’ using best information. To ensure that a krill individual learns from good exemplars and to minimize the time wasted on poor directions, we allow the krill individual to learn from the exemplars until the krill individual ceases improving for a certain number of generations called the refreshing gap. We observe three main differences between the DGKH algorithm and the original KHA [17].(1)
Once the sensing distance is used to identify the neighboring members of each krill individual, as exemplars to update the position, this mechanism utilizes the potentials of all krill individualsas exemplars to guide a krill individual’s new position.
(2)
Instead of learning from the same exemplar krill individual’s for all dimensions, each dimension of a krill individual in general can learn from different krill individuals for different dimensions to update its position. In other words, each dimension of a krill individual may learn from the corresponding dimension of different krill individual based on the proposed equation (15).
(3)
Finding the neighbor for different dimensions to update a krill individual position is done randomly (with a vigil that repetitions are avoided). This improves the thorough exploration capability of the original KHA with large possibility to avoid premature convergence in complex optimization problems.Compared to the original KHA, DGKH algorithm searches more promising regions to find the global optimum. The difference between KHA and DGKH is that the differential operator applied to only accept the basic KHA generating new better solution for each krill instead of accepting all the krill updating adopted in KH. This is rather greedy. The original KHA is very efficient and powerful but is highly prone to premature convergence. Therefore, to evade premature convergence and further improve the exploration ability of the original KHA, a differential guidance is used to tap useful information in all the krill individuals to update the position of a particular krill individual. The following expresses the differential mechanism:(15)
Z
i
-
Z
j
=
z
i
1
z
i
2
z
i
3
⋯
z
i
n
-
z
ρ
1
z
ρ
2
z
ρ
3
⋯
z
ρ
n
,where z
i
1 is the first element in the n dimension vector Z
i, z
i
n is the nth element in the n dimension vector Z
i, z
ρ
1 is the first element in the n dimension vector Z
p, and ρ is the random integer generated separately for each z, between 1 to n, but ρ
≠
i.Figure1 shows the differential mechanism for choosing the neighbor krill individual for (10). This assumes that the dimension of the problem as 5 and assumes krill size as 6 are in the search. Once the neighbor krill individuals are identified using the sensing distance, the ith individual position will be updated (with all neighbor krill individuals) as shown in Figure 1. This is in an effort to avoid premature convergence and explore a large promising region in the prior run phase to search the whole space extensively.Figure 1
Differential mechanism illustrated.


## 4. Experimental Analysis

Numerical Simulations were carried out to validate the performance of the proposed DGKH based QoSR algorithm and experimental analysis is performed on a test network [12] as shown in Figure 2, on three different cases. For Case (
1
) constraint Set1, delay constraint Q
D
=
20, delay-jitter constraint Q
D
J
=
30, and bandwidth constraint Q
B
=
40. In Case (
2
) constraint Set2, delay constraint Q
D
=
25, delay-jitter constraint Q
D
J
=
35, and bandwidth constraint Q
B
=
40. In Case (
3
) in addition to the constraints Set 2, packet loss rate constraints are also taken into account. For the packet loss rate constraint, we set Q
P
L
=
30 as used in [4], since ad hoc networks are high mobility networks with limited resources. Also considering all these parameters can indicate timeliness and precision which is used to measure the output performances of a routing algorithm.Figure 2
Network used as test bench for Cases1 and 2.First two cases are studied to establish the superiority of the proposed DGKH based QoSR in comparison to the existing QPSO method. The proposed DGKH algorithm was executed for 30 trials on each case. The performance of the proposed algorithm from the perspectives of the best multicast tree obtained, best fitness value, average fitness value, convergence speed, and so forth is demonstrated.The multicast tree with the best fitness value of Cases1 and 2 that satisfies the constraints estimated out of 30 runs of each algorithm is shown in Figure 3. The least cost, delay, and delay-jitter of each identified multicast tree are summarized in Table 1.Table 1
Summary of performance metrics by various methods for multiconstrained QoSR for various cases.
Index
Methods
Best cost
Average delay
Average delay-jitter
Average cost
Standard deviation
Average packet loss rate
Case  1 [12]
GA
138
18.5
30.2
145.29
3.73
NA
PSO
140
19.6
30.8
143.83
3.59
NA
QPSO
122
21.6
33.0
135.20
3.25
NA
DGKH
122
22.1
33.3
125.37
3.20
NA
Case  2 [12]
GA
134
21.8
31.2
142.93
3.26
NA
PSO
131
20.4
31.6
138.67
2.80
NA
QPSO
127
21.8
32.2
131.89
2.19
NA
DGKH
127
21.3
32.4
129.21
2.16
NA
Case   3
KHA
135
21.8
32.2
131.89
2.19
0.9442
DGKH
127
21.3
32.4
129.21
2.16
0.9370Figure 3
Best multicast tree generated by DGKH algorithm constraint, (a) Set 1 and (b) Set 2.
(a)
(b)In addition the mean and standard deviation of the best fitness values in 30 trial runs of all algorithms under consideration are also listed. The averaged values are obtained for delay and delay-jitter over all the paths of the multicast tree from the source node to the end nodes. It is proved that for both cases of the constraint sets, the best fitness value of the multicast trees generated by both QPSO [12] and proposed DGKH have the same least costs with the considered constraints, informing that DGKH algorithm could guarantee better multicast tree than QPSO, PSO and GA [12].To demonstrate the convergence properties of the algorithms under considerations, the convergence graph of both KHA and DGKH algorithm on the problem is experimented and plotted. Since this research did not implement other algorithms which are used for comparison, the KHA and DGKH algorithms are considered. Figure3 traces the dynamic changes of cost, average delay, and average delay-jitter with the development of iteration for two algorithms, that is, QPSO [12] and the proposed DGKH algorithm. As evident from Figure 3, the convergence speed of DGHK is better. It conveys that proposed DGKH algorithm has stronger search ability than QPSO on the tested problem.To validate the proposed algorithm with additional constraints as mentioned in Case(
3
), the network under consideration is amended by including the packet loss rate constraint in the last part of the representation. Thus the features of the edges in the proposed network, as shown in Figure 4, are arranged by a pentuple (D, DJ, B, C, PL) with the components representing delay, delay-jitter, band width, cost, and packet loss, respectively. The multicast tree as shown in Figure 5, with the best fitness value of Case 3, that satisfies the constraints estimated out of 30 runs of each algorithm, is shown in Figure 5. The least cost, delay, delay-jitter, and packet loss of each identified multicast tree for Case 3 are also summarized in Table 1.Figure 4
Network used as test bench for Case3.Figure 5
Best multicast tree generated by DGKH algorithm constraint, (a) Set 1 and (b) Set 2 for Case3.
(a)
(b)


## 5. Experiments on Scalability

In this section, numerical simulations were conducted in order to investigate the scalability of the proposed DGKH algorithm. To achieve this objective, we used the network topologies created by Salama stochastic network topology generation [4, 12]. The data is adopted from [12] for comparison purpose and is shown in Table 2. Here the packet loss rate constraints are relaxed as the purpose of this section is to demonstrate the scalability of the proposed DGKH algorithm for QoSR. The number of nodes of each network was set randomly from 10 to 100. Table 3 summarizes the results of the proposed algorithm. Due to the space limitation, we only show in Figure 6 the convergence properties of the algorithms averaged over 30 runs on the problem under constraint Set 2 for Case 3.Table 2
Network data.
Parameter
Range
Cost of link
2–10
Bandwidth
50–200 kb/s
Delay-jitter
5–15 ms
Bandwidth constraint
100–170
Delay constraint
60–180
Delay-jitter constraint
20–50Table 3
Performance metrics on the random networks of 10–100 nodes by the proposed DGKH algorithm.
Nodes
Best cost
Average delay
Average delay-jitter
Average cost
Standard deviation
10
148.25
21.3
34.2
148.89
3.52
20
301.41
21.2
34.6
302.63
4.21
30
480.36
21.2
34.2
481.52
3.96
40
562.47
21.5
34.1
563.31
4.52
50
775.23
21.4
33.9
776.24
5.01
60
925.62
21.3
33.9
926.22
3.67
70
1052.31
21.3
34.5
1053.54
4.23
80
1218.32
21.1
34.2
1218.89
3.87
90
1384.95
21.1
34.1
1385.62
5.31
100
1572.34
21.2
34.3
1573.05
6.54Figure 6
Convergence plot for the KHA and DGKH algorithm while optimizing the fitness function.The other parameters of each algorithm were configured as in the first group of experiments. The algorithms were evaluated from angles of least cost of obtained multicast tree, execution time, and routing request success ratio.By simulation, scalability of the algorithm with the problem size was evaluated according to execution time and least cost of the obtained multicast tree. For comparison purpose the plots of the proposed DGKH algorithm is merged with the plots of the QPSO method. We did not implement the QPSO at any part of this research. The values of QPSO [12] are taken from the simulation software. Figure 7 shows the least cost generated by each algorithm that is averaged over different constraints for the problems with different numbers of network nodes. It can be observed that the multicast tree obtained by DGKH on each problem has best fitness value compared to the QPSO method; establishing it can generate the higher-quality solutions on the multicast routing problems in MANETS. Figure 8 shows the execution time of the two algorithms in comparison to the problems with different numbers of network nodes. The results convey the superiority of the proposed method, as the QPSO is more time consuming than DGKH on the problems with the same network scale. In summary both the DGKH and the QPSO, algorithms for QoSR in MANETS, seem to consume almost the same amount of simulation time on the problem with the same scale. In conclusion, when comparing two algorithms for OoS in multicast routing problem of MANETs, DGKH method could generate best multicast trees (with best fitness (cost) values) compared to QPSO. Additionally to find out the solutions with same quality, the DGKH algorithm has consumed (comparatively) least computational time among its contestant algorithm QPSO.Figure 7
The average cost in 30 runs of each algorithm on the problems with different number of network nodes.Figure 8
The execution time of each algorithm on the problems with different number of network nodes.The performance of the algorithm can also be evaluated by the routing request success ratioξ
r
e
q given by (16)
ξ
r
e
q
=
N
a
c
k
N
r
e
q
,where N
a
c
k is the number of successful routing requests and N
r
e
q is the number of all routing requests.Successful routing request means that the multicast tree obtained by the algorithm satisfies the bandwidth, delay, and delay-jitter constraints [18]. It is, however, too complicated to compare all of the QoS parameters synchronously. Therefore, the performance is verified by each of QoS parameters. The comparison of routing request success ratios among DGKH and QPSO is curved and shown in Figure 9. It is proved that DGKH has the highest success ratio according to each QoS parameter and thus has the best convergence performance.Figure 9
Comparisons of routing request success ratio. (a) Delay, (b) bandwidth, and (c) delay-jitter.
(a)
(b)
(c)


## 6. Conclusion

A QoS multicast routing method based on a modified krill herd algorithm is proposed in this paper. Searching for the feasible/optimal route after simultaneously satisfying more than one QoS constraint in wireless mobile ad hoc networks is classified as an NP-complete problem. This research considers four different constraints while optimizing the total cost of the multicast tree. Hence the original krill herd algorithm is refined to perform the thorough exploration of the search space by differentially guided mechanism to update their krill individual positions. Experimental result reveals the proposed that DGKH algorithm can search the solution space in a very effective and efficient manner. Simulation results also shows that the proposed algorithm can search the better multicast trees with rapider convergence speed effectively compared with other algorithms.As a future work, we plan to consider other heuristic techniques for estimation of multicast routing considering other constraints like queuing delays, propagation error, maximum link utilization, bandwidth consumption parameters, blocking probability, and so forth as multiobjective optimization problem.



---

*Source: 862145-2015-09-01.xml*