Beruflich Dokumente
Kultur Dokumente
I. INTRODUCTION
139
II. PRELIMINARIES
jG
jG
140
follows:
All the bats can detect the distance away from the food
according to echolocation, and also can distinguish the
difference between food and obstacles.
At iteration t, each bat k flies from position X kt at velocity
router ri , for i = 1, 2, , n;
Vkt = (vkt 1 , vkt 2 ,..., vkt (2 n ) ) records the velocity of bat k;
f ( X kt ) records the fitness of X kt ;
Because all the mesh routers are placed within a W H
deployment area, they have to satisfy the following
constraints: i {1,, n} ,
emitted pulse.
If bat k is close to the food, the pulse loudness become
smaller, and the rate of pule emission gets greater.
At first, the position X k0 , velocity vk0 , frequency fk0 , pulse
loudness Ak0 , and pulse emission rate rk0 of each bat k for k
{1, 2, , } are initialized randomly within the assumed
ranges. Next, in each iteration of the BA main loop, each bat k
randomly determines its frequency fkt according to Equation
(3), updates its velocity and position according to Equations
(4) and (5).
(3)
f kt = fmin + ( f max f min )
Vkt = Vkt 1 + ( X * X kt 1 ) f kt
0 xkt (2 i 1) W
0 x
t
k ( 2i )
W v
H v
(10)
t
k ( 2 i 1)
t
k ( 2i )
(9)
(11)
(12)
(4)
(13)
(5)
t
k
t 1
k
t
k
X = X +V
where is a random number from uniform distribution U(0,
1); X* denotes the best solution found so far.
The BA consists of two main parts. In the first part, for
each bat k, if a random number from U(0, 1) is greater than its
rate rkt of pulse emission, then we randomly choose one of
In the second part, each bat k executes its own local search
according to Equation (6) to produce a new position. If the
fitness value of the new solution is better and a random
number from U(0, 1) is less than its pulse loudness Akt , then
where = = 0.9. Finally, the fitness values of all the bats are
sorted, and the best fitness value is recorded.
where the parameter falls into the range [0, 1], which is
used to control the balance between the two measures, which
are normalized.
Take a simple example to explain the objective function in
Figure 1, in which mesh routers (black dot) and mesh clients
(white dot) are labeled by their weighted values. The first
term (Gt , k ) of the objective function is to count the
weighted size of the greatest component of the WMN
topology which is the one grouped by red dashed lines in
Figure 1. The second term (Gt , k ) is to count the total sum of
141
10
5
10
5
10
10
7
4:
10
10
5:
6:
10
if > 0 then
X k0 is replaced by the position of bat k at ( 1)-th
time step, and calculate its fitness f ( X k0 )
(G ) = 138
(G ) = 75
10
2:
3:
Edge
Mesh routers
Mesh clients
10
C. Local Search
Local search is often used for improving solutions of
heuristics. Our approach considers the following three local
search schemes:
Standard: Randomly select a mesh router and move it to a
random position within a circle centered at the mesh
router.
Random: Move each mesh router to a random position
within the circle centered at the mesh router.
Iterated: Randomly select a mesh router, move it to a new
position within the deployment area, and then move it to a
random position within the circle centered at the new
position. This scheme differs from the Standard scheme in
the sense that the selected mesh router does not search the
local area of the original position, but the local area of the
new position. The goal of doing so is to avoid that the
proposed scheme falls into a local optimal solution.
7:
8:
9:
10:
randomly
11: end for
12: f ( X * ) max k f ( X kt ) and update X *
13: while ( t < max number of iterations) do
14: for each bat k {1, 2,...,} do
15:
randomize the bat ks frequency f kt by Equation (3)
16:
17:
18:
19:
20:
23:
24:
25:
26:
27:
then
accept the new solution
increase rkt and reduce Akt by Equations (7)
21:
22:
E. Algorithm
Our BA is given in Algorithm 1. BA is operated on a group
of bats. In the dynamic scenario, if time step = 0, the
position and pulse frequency of each bat are generated
randomly (lines 2-4); else (i.e., > 0), the position and pulse
frequency of each bat inherit their values in the ( 1)-th time
step (lines 5-8). The velocity, pulse emission rate, and pulse
loudness of each bat k is updated (lines 9-10). Then, the best
position is computed (line 12). Next, bats iterate to apply
echolocation to search their food (the best solution) in lines
13-33. Each bat moves at a velocity updated according to the
frequency of its previous iteration (lines 15-19). Then, each
bat searches the local area of the global best position and its
current position according to its pulse loudness and rate of
pulse emission (lines 20-28), where the pulse loudness and
rate of pulse emission are adjusted in line 27. Our proposed
dynamic probability adjustment scheme is proposed in lines
30-31.
142
instance
1
2
3
4
5
6
7
8
9
10
Average
1.0
0.9
0.8
0.7
0.6
PSO
PSO
0.5
BA
Our
BA
0.4
BA()
The BA
0.3
0
10
20
30
40
50
60
70
80
90 100 110 120 130 140 150 160 170 180 190 200
Iteration
Fig. 2. The plot of the best fitness values versus the number of iterations in
the dynamic scenario where all the mesh clients have mobility and have 1% to
switch their network access.
B. Experimental Results
Table 1 gives the experimental comparison between PSO
and the proposed BA on 10 problem instances, in which the
best, average, worst fitness values are recorded; the results
are computed by running 20 times of the algorithm on
different problem instances; each entry on the bottom row
records the average of the results of the 10 values on the
corresponding column. From Table 1, we observe that our
proposed BA performs better than PSO in all cases.
TABLE I
STATISTICS OF 10 INSTANCES
Best fitness
Average fitness
PSO
Our
PSO
Our
.692
.788
.584
.682
.807
.884
.737
.795
.827
.884
.741
.735
.846
.865
.666
.784
.793
.890
.664
.785
.726
.846
.611
.756
.846
.884
.705
.776
.807
.807
.692
.709
.798
.827
.667
.713
.827
.827
.698
.753
.797
.850
.677
.749
V. CONCLUSION
This paper proposes a bat-inspired algorithm (BA) for
dynamic router node placement with weighed mesh clients in
WMNs, where three local search schemes are designed, and a
dynamic probability selection scheme is used for choosing
the three schemes. Experimental results show that the
proposed BA can obtain better solutions, as compared to the
previous approaches. As compared to our previous PSO
approach, our proposed BA approach always performs better.
In the future, we intend to consider the concerned problem
with gateways [2, 4], which support the network access to the
outside Internet. It is also of interest to continue improving
our algorithm to achieve better solutions.
Worst fitness
PSO
Our
.441
.595
.634
.653
.624
.635
.460
.567
.518
.653
.466
.615
.518
.711
.460
.576
.499
.567
.595
.654
.522
.623
REFERENCES
[1]
143