# A Swarm Intelligent Algorithm Based Route Maintaining Protocol for Mobile Sink Wireless Sensor Networks

Authors: Xiaoming Wu; Yinglong Wang; Yifan Hu
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Recent studies have shown that mobile sink can be a solution to solve the problem that energy consumption of sensor nodes is not balanced in wireless sensor networks (WSNs). Caused by the sink mobility, the paths between the sensor nodes and the sink change frequently and have profound influence on the lifetime of WSN. It is necessary to design a protocol that can find efficient routings between the mobile sink and nodes but does not consume too many network resources. In this paper, we propose a swarm intelligent algorithm based route maintaining protocol to resolve this issue. The protocol utilizes the concentric ring mechanism to guide the route researching direction and adopts the optimal routing selection to maintain the data delivery route in mobile sink WSN. Using the immune based artificial bee colony (IABC) algorithm to optimize the forwarding path, the routing maintaining protocol could find an alternative routing path quickly and efficiently when the coordinate of sink is changed in WSN. The results of our extensive experiments demonstrate that our proposed route maintaining protocol is able to balance the network traffic load and prolong the network lifetime.


---

## Body

## 1. Introduction and Related Work

Wireless sensor network (WSN) is an intelligent monitoring self-organized network consisting of many microsensor nodes with the capabilities of communication, sensing, and computing deployed inside or around the monitoring area. It has broad application prospects and great application value in industrial and agricultural control, urban management, environmental testing, hazardous area remote control, and other fields. WSN involves multiple frontier research fields; it is considered as one of the top-ten world-changing technologies in the future [1].A typical WSN is composed of many sensor nodes and one or several sinks. The sink collects data from the sensing environment. However, if the sink involved in collecting data is static, the sensors connected directly to a sink deplete their energy much faster than the rest of the network since they carry all the data gathered by the sensors [2], which is called “the crowded center effect” [3] or “energy hole problem” [4, 5]. One method to avoid the formation of energy holes is to use sink mobility. The sensor nodes can take turns to become the neighbors of the sink due to the sink mobility in a controlled manner, so the energy is consumed evenly among the nodes. It has been demonstrated that a mobile sink can potentially prolong the network’s lifetime as the mobile sink would cause the sensor nodes to consume less energy [6].Mobile sink can be a solution to solve the problem that energy consumption of nodes is not balanced in WSN; we call it mobile sink WSN (MSWSN); the network architecture is illustrated in Figure1; the source nodes constantly deliver data through multihops relay node path to the mobile sink. But caused by the sink mobility, the paths between the sensor nodes and the sink would change with time [7]. Routing protocol in MSWSN is a great challenge due to the following reasons. Firstly, it is not easy to grasp the whole network topology and it is hard to find a routing path. Secondly, sensor nodes are tightly constrained in terms of energy, processing, and storage capacities. The unpredictable and constant changes in the sink’s location form the obstacle of designing the route maintaining protocols in the energy constrained WSN [8]. It is necessary to design a protocol that can find efficient routes between the mobile sink and sensor nodes but does not consume too many network resources.Figure 1
Mobile sink wireless sensor network model.Various routing protocols have been proposed to address the routing problem of mobile sink. In the literature [9], the TTDD concentrates on efficient data delivery to mobile sinks by clustering nodes into cells. Mobile sinks broadcast request packets only in their local cell, and an overlay routing scheme keeps track of the current cells of the sinks for routing data to them. While effective in high mobility scenarios, the overhead to build and maintain the overlay is significant, especially in periodic reporting scenarios, which are more traffic intensive than event-based reporting. Thus, TTDD is better suited to event-detecting sensor networks with sporadic rather than continuous traffic.SEAD [10] and its developed protocol DEED [11] attempt to optimize routes from a single source to mobile sinks by allowing each sink to select an access sensor node. A data delivery tree is built between the source and all access nodes based on a geographic location heuristic. When the sink moves, a path between its current nearest neighbor and the access node is maintained, eliminating the need to rebuild the tree. However, if the sink moves far away, a new access node would be selected and the tree is rebuilt.An enhanced real time with load distribution (ERTLD) routing protocol for mobile WSN is proposed in literature [12]. ERTLD utilizes corona mechanism and optimal forwarding metrics to forward the data packet in mobile WSN. It ensures high packet delivery ratio and experiences minimum end-to-end delay and enhances the total performance, reliability, and flexibility of data forwarding mechanism in mobile WSN.However, in these classical routing protocols, the route maintaining scheme for the large scale sensor nodes has rarely been considered. Moreover, as the routing optimization problem to find the optimal routing is a NP-hardness problem, the heuristic deterministic methods always fall into local optimum and only get the approximate optimal result. In this paper, we propose a swarm intelligent algorithm optimized route maintaining protocol to optimize the routing path of the MSWSN, and this optimization algorithm would converge to the optimal resolution of the path. Our proposed scheme is developed on the basis of the corona mechanism in ERTLD and differs from the above works. The main contributions of this paper are as follows:(1)
We utilize the concentric ring mechanism to guide the route researching direction and adopt self-adapt feature of our swarm intelligent routing protocol to deal with the dynamic route maintaining problem of MSWSN, which results in saving energy and maximizing packet delivery ratio.
(2)
We analyze and compare our protocol with TTDD [9] and ERTLD [12] in terms of packet delivery and energy consumption. Simulation results show superiority of the protocol.The contributions of this paper are different from the literatures [8, 13], though the network models of them are all the WSNs with mobile sink:(1)
The routing mechanism is different, we provide concentric ring mechanism to detect the relative distance and direction of each node to the mobile sink, in order to efficiently guide the route researching direction from source node to the sink, comparing to the routing researching mechanism without direction guidance in [13] and another different routing mechanism in [8].
(2)
The kernel optimization algorithm of routing protocol is different; our protocol adopts the artificial bee colony (ABC) algorithm to optimize the forwarding path, comparing to the particle swarm optimization algorithm in literature [13] and machine learning-based approach in literature [8]. The tests for several standard functions by [14] have shown that the performance of ABC is better than the other population-based algorithms with the advantage of employing fewer control parameters, such as PSO and other algorithms.The rest of this paper is organized as follows. Section2 formulates our network model and method. Section 3 describes the proposed algorithm in detail, and the routing protocol is analyzed. Section 4 evaluates the performance of the IABC by comparing it with other routing protocols. Finally, the conclusion is presented in Section 5.


## 2. Description of Network Model

### 2.1. Concentric Ring Mechanism

The MSWSN is modeled as a time-dependent connected graphG
(
V
,
E
), where V is a finite set of sensor nodes and E is the set of edges representing connection between these nodes. The mobile sink is a rendezvous point and moves in the network area for the purpose of collecting information of nodes. In our model, the regular moving track of the mobile sink is the rectangular polyline track, as shown in Figure 1, which can efficiently traverse the whole network. The similar traverse track method has been used in the literature [15]. Figure 2 represents a certain time T
0 when the mobile sink has moved to place A in the network model. v
i
(
0
<
i
<
N
-
2
) is the relay sensor node, v
s is the source node, and v
s
i
n
k is the mobile sink. Suppose there exist m
(
0
<
m
<
N
-
1
) source nodes andone mobile sink; these source nodes can route the packets through multihops relay node path to the mobile sink, as illustrated in the right blue dash-line box (b) of Figure 2. After deploying in the middle area of the network, the mobile sink would broadcast the concentric ring (CR) packets to its one-hop neighbors, in order to determine the concentric ring number for all sensor nodes in the network. The main fields of CR are CR_N (the ring number; initial number is zero) and CR_ID (the packet ID sent by sink). Then, the nodes forward the packet to the next-hop neighbors. The sink would not rebroadcast the CR packet until it moves to a new coordinate which is more than D meters away from the previous coordinate. In our assumption, if the moving distance of sink is less than D meters, it is still within the communication range of the closest relay node.Figure 2
The route maintaining model of MSWSN. (a) The process of delivering route maintaining packet through possible paths. (b) The concentric ring number of each node on the path.As shown in Figure2, all circles are concentric at the sink and can form the coordinate system, and the width of each concentric ring is assumed to be equal to the sensor node’s transmission range R. Therefore, each sensor node would belong to exactly one concentric ring. The data would be delivered from node v
i with high value of CR_N to node v
j with low value of CR_N and at last to the mobile sink. If there is not any candidate with lower number of CR_N than v
i in the neighbor table of v
i, data would be forwarded to the node with the same number of CR_N. The right blue box (b) of Figure 2 shows the CR_N of each node on the multihop path.When the mobile sink moves to the random position, the coordinate system is also changed. Once the sink moves up toR meters away, it would rebroadcast the CR_N to the network, and each node’s CR_N would be changed. The packet CR would be delivered to all one-hop neighbors. If one relay node receives CR, it would check CR_ID; if it is the same as the node’s previous CR_ID, the node would discard the packet; if not, the node would increase CR_N in CR and save this value as its new concentric ring number. Then, the node would broadcast CR to its neighbors, until the nodes of the whole network are upgraded. With this method, the network can automatically respond to the dynamic topology. Once the sink moves to a certain distance, the previous scenario would be repeated. Using the concentric ring mechanism, the relative distance and direction of each node to the mobile sink can be detected, and the following routing research from source node can be guided toward the direction of sink.Our network routing model is based on the following assumptions: (1) The area is covered by a large number of homogeneous sensor nodes. Sensor nodes are stationary, but sink moves and changes position constantly with a relatively fixed speed. (2) Data is sensed and transmitted from each source node to the mobile sink everyT time period.


### 2.2. Route Maintaining Algorithm

The concentric ring mechanism can calculate the sensor node’s ring number according to its distance to the sink. The following routing algorithm can calculate and decide the optimal forwarding path from the source nodes to the mobile sink, in order to update and maintain the dynamic route.As assumed, the path generated from a given source nodev
s
1 to the mobile sink v
s
i
n
k is denoted by p
j
(
j
∈
1,2
,
…
,
n
). The kth relay node on path p
j is denoted by v
j
k, {
k
∈
1,2
,
…
,
h
j
}, in which h
j is the hop count on path p
j. e
j
m represents the mth direct edge between two neighbor nodes on p
j. Let N
(
p
j
)
=
{
v
j
S
,
v
j
1
,
v
j
2
,
…
,
v
j
k
,
…
,
v
j
n
}
⊂
N
(
v
) be the set of the sensor nodes existing along path p
j, where k represents the distance from the sink to the node on a hop scale. As shown in the right blue box (b) of Figure 2, path p
1 connects source v
s
1 with the sink and contains 6 relay nodes {
v
1
1
,
v
1
2
,
v
1
3
,
v
1
4
,
v
1
5
,
v
1
6
}, and 7 relay edges {
e
1
1
,
e
1
2
,
e
1
3
,
e
1
4
,
e
1
5
,
e
1
6
,
e
1
7
}. Each node v owns its neighbor table, which stores its surrounding neighbor node’s ID v
i and other information (node signal strength R
S
S
I
(
v
i
) from the next-hop node v
i, end-to-end delay D
e
l
a
y
(
v
i
) between the node and v
i).The movement of mobile sink would firstly upgrade all the nodes’ CN_R. Once the sink has moved out of the communication distance of relay nodev
j
n and the data packet cannot be delivered to the sink, the routing failed information packet would be sent backward to the source node v
j
s through path p
j; then, the route maintaining algorithm would be implemented.v
j
s would broadcast the route maintaining (RM) packets to one-hop neighbors, and the packet contains the information of battery voltage and source’s CR_N (called CR_N_S). Our rule is that if the relay node’s CR_N is not higher than the source’s CR_N_S, it can relay RM packet, so RM can be delivered forward of the mobile sink. If the relay node v
i receives RM, it will check its own CR_N; if its CR_N is higher than CR_N_S in RM, v
i will discard the packet; if not, v
i will decrease and save CR_N_S in RM and relay RM to its one-hop neighbors; the packet would contain information of its R
S
S
I
(
v
i
), D
e
l
a
y
(
v
i
), and its battery voltage V
b
a
t
(
v
i
). Then, the node will relay RM to the other neighbors, until the data packet RM is delivered through any multihop path p
j
(
0
<
j
<
n
) to the mobile sink. Thus, the sink would receive several packets RM from these paths, and all the paths delivering RM to the sink are considered as the possible alternative paths set P
a
l
l. The process of delivering packet RM through multihop paths is illustrated in the left red dash-line box (a) of Figure 2.With this method, the optimal pathp
o
p with the suitable relay node sequence {
v
o
p
S
,
v
o
p
1
,
v
o
p
2
,
…
,
v
o
p
k
,
…
,
v
o
p
n
} is among these possible alternative paths set P
a
l
l. The sink collects all the information and extracts R
S
S
I
(
v
i
), D
e
l
a
y
(
v
i
), and V
b
a
t
(
v
i
) of these nodes on the possible alternative paths P
a
l
l and calculates the fitness value of path and selects one optimal alternative path p
o
p with optimal fitness f
i
t
n
e
s
s
(
p
o
p
) (e.g., path {
v
S
1
,
v
1
,
v
2
,
v
3
,
v
4
,
v
5
,
v
6
,
v
7
} in left red box (a) of Figure 2). The nodes sequence of a possible alternative path p
j is {
v
j
S
,
v
j
1
,
v
j
2
,
…
,
v
j
k
,
…
,
v
j
n
}, and the factors affecting the choice of p
j include the nodes’ signal strength, end-to-end delay, and battery voltage on the path. These parameters can determine the fitness function of p
j, f
i
t
n
e
s
s
(
p
j
):(1)
f
i
t
n
e
s
s
p
j
=
max
⁡
λ
1
∑
i
=
1
n
R
S
S
I
t
h
R
S
S
I
v
j
i
+
λ
2
∑
i
=
1
n
D
e
l
a
y
t
h
-
D
e
l
a
y
v
j
i
D
e
l
a
y
t
h
+
λ
3
∑
i
=
1
n
V
b
a
t
v
j
i
V
b
a
t
t
h
,where R
S
S
I
v
j
i is the signal strength of v
j
i from the next-hop node v
j
i
-
1 and its value can indirectly reflect the distance between v
j
i and v
j
i
-
1. R
S
S
I
t
h is the signal strength value at threshold point 1 m which is −45 dBm. D
e
l
a
y
v
j
i is the end-to-end delay between the node and next-hop node; D
e
l
a
y
t
h is the end-to-end delay threshold which is set to 250 ms. V
b
a
t
v
j
i is the node battery voltage; its value can indirectly reflect the remaining energy of v
j
i. V
b
a
t
t
h is the node threshold battery voltage and equals 3.5 v. λ
1, λ
2, and λ
3 are the weights of remaining energy, delay, and distance constraints in the fitness function, respectively, and λ
1
+
λ
2
+
λ
3
=
1. We set λ
1
=
0.4, λ
2
=
0.2, and λ
3
=
0.4. The higher fitness value indicates the more suitable routing path; therefore, the best path p
b with the optimal fitness f
i
t
n
e
s
s
(
p
b
) will be selected.After that if the number of possible alternative paths in the setP
a
l
l is more than 5, the selection of calculated possible alternative paths would be so complex, and we would use the swarm intelligent algorithm to optimize the selection of optimal path, or else the optimal path would be calculated and selected directly. We consider each possible alternative path p
j from source v
s
i to v
s
i
n
k as a solution, and the number of solutions in the population is m. The details of swarm intelligent algorithm are described in the next section.


## 2.1. Concentric Ring Mechanism

The MSWSN is modeled as a time-dependent connected graphG
(
V
,
E
), where V is a finite set of sensor nodes and E is the set of edges representing connection between these nodes. The mobile sink is a rendezvous point and moves in the network area for the purpose of collecting information of nodes. In our model, the regular moving track of the mobile sink is the rectangular polyline track, as shown in Figure 1, which can efficiently traverse the whole network. The similar traverse track method has been used in the literature [15]. Figure 2 represents a certain time T
0 when the mobile sink has moved to place A in the network model. v
i
(
0
<
i
<
N
-
2
) is the relay sensor node, v
s is the source node, and v
s
i
n
k is the mobile sink. Suppose there exist m
(
0
<
m
<
N
-
1
) source nodes andone mobile sink; these source nodes can route the packets through multihops relay node path to the mobile sink, as illustrated in the right blue dash-line box (b) of Figure 2. After deploying in the middle area of the network, the mobile sink would broadcast the concentric ring (CR) packets to its one-hop neighbors, in order to determine the concentric ring number for all sensor nodes in the network. The main fields of CR are CR_N (the ring number; initial number is zero) and CR_ID (the packet ID sent by sink). Then, the nodes forward the packet to the next-hop neighbors. The sink would not rebroadcast the CR packet until it moves to a new coordinate which is more than D meters away from the previous coordinate. In our assumption, if the moving distance of sink is less than D meters, it is still within the communication range of the closest relay node.Figure 2
The route maintaining model of MSWSN. (a) The process of delivering route maintaining packet through possible paths. (b) The concentric ring number of each node on the path.As shown in Figure2, all circles are concentric at the sink and can form the coordinate system, and the width of each concentric ring is assumed to be equal to the sensor node’s transmission range R. Therefore, each sensor node would belong to exactly one concentric ring. The data would be delivered from node v
i with high value of CR_N to node v
j with low value of CR_N and at last to the mobile sink. If there is not any candidate with lower number of CR_N than v
i in the neighbor table of v
i, data would be forwarded to the node with the same number of CR_N. The right blue box (b) of Figure 2 shows the CR_N of each node on the multihop path.When the mobile sink moves to the random position, the coordinate system is also changed. Once the sink moves up toR meters away, it would rebroadcast the CR_N to the network, and each node’s CR_N would be changed. The packet CR would be delivered to all one-hop neighbors. If one relay node receives CR, it would check CR_ID; if it is the same as the node’s previous CR_ID, the node would discard the packet; if not, the node would increase CR_N in CR and save this value as its new concentric ring number. Then, the node would broadcast CR to its neighbors, until the nodes of the whole network are upgraded. With this method, the network can automatically respond to the dynamic topology. Once the sink moves to a certain distance, the previous scenario would be repeated. Using the concentric ring mechanism, the relative distance and direction of each node to the mobile sink can be detected, and the following routing research from source node can be guided toward the direction of sink.Our network routing model is based on the following assumptions: (1) The area is covered by a large number of homogeneous sensor nodes. Sensor nodes are stationary, but sink moves and changes position constantly with a relatively fixed speed. (2) Data is sensed and transmitted from each source node to the mobile sink everyT time period.


## 2.2. Route Maintaining Algorithm

The concentric ring mechanism can calculate the sensor node’s ring number according to its distance to the sink. The following routing algorithm can calculate and decide the optimal forwarding path from the source nodes to the mobile sink, in order to update and maintain the dynamic route.As assumed, the path generated from a given source nodev
s
1 to the mobile sink v
s
i
n
k is denoted by p
j
(
j
∈
1,2
,
…
,
n
). The kth relay node on path p
j is denoted by v
j
k, {
k
∈
1,2
,
…
,
h
j
}, in which h
j is the hop count on path p
j. e
j
m represents the mth direct edge between two neighbor nodes on p
j. Let N
(
p
j
)
=
{
v
j
S
,
v
j
1
,
v
j
2
,
…
,
v
j
k
,
…
,
v
j
n
}
⊂
N
(
v
) be the set of the sensor nodes existing along path p
j, where k represents the distance from the sink to the node on a hop scale. As shown in the right blue box (b) of Figure 2, path p
1 connects source v
s
1 with the sink and contains 6 relay nodes {
v
1
1
,
v
1
2
,
v
1
3
,
v
1
4
,
v
1
5
,
v
1
6
}, and 7 relay edges {
e
1
1
,
e
1
2
,
e
1
3
,
e
1
4
,
e
1
5
,
e
1
6
,
e
1
7
}. Each node v owns its neighbor table, which stores its surrounding neighbor node’s ID v
i and other information (node signal strength R
S
S
I
(
v
i
) from the next-hop node v
i, end-to-end delay D
e
l
a
y
(
v
i
) between the node and v
i).The movement of mobile sink would firstly upgrade all the nodes’ CN_R. Once the sink has moved out of the communication distance of relay nodev
j
n and the data packet cannot be delivered to the sink, the routing failed information packet would be sent backward to the source node v
j
s through path p
j; then, the route maintaining algorithm would be implemented.v
j
s would broadcast the route maintaining (RM) packets to one-hop neighbors, and the packet contains the information of battery voltage and source’s CR_N (called CR_N_S). Our rule is that if the relay node’s CR_N is not higher than the source’s CR_N_S, it can relay RM packet, so RM can be delivered forward of the mobile sink. If the relay node v
i receives RM, it will check its own CR_N; if its CR_N is higher than CR_N_S in RM, v
i will discard the packet; if not, v
i will decrease and save CR_N_S in RM and relay RM to its one-hop neighbors; the packet would contain information of its R
S
S
I
(
v
i
), D
e
l
a
y
(
v
i
), and its battery voltage V
b
a
t
(
v
i
). Then, the node will relay RM to the other neighbors, until the data packet RM is delivered through any multihop path p
j
(
0
<
j
<
n
) to the mobile sink. Thus, the sink would receive several packets RM from these paths, and all the paths delivering RM to the sink are considered as the possible alternative paths set P
a
l
l. The process of delivering packet RM through multihop paths is illustrated in the left red dash-line box (a) of Figure 2.With this method, the optimal pathp
o
p with the suitable relay node sequence {
v
o
p
S
,
v
o
p
1
,
v
o
p
2
,
…
,
v
o
p
k
,
…
,
v
o
p
n
} is among these possible alternative paths set P
a
l
l. The sink collects all the information and extracts R
S
S
I
(
v
i
), D
e
l
a
y
(
v
i
), and V
b
a
t
(
v
i
) of these nodes on the possible alternative paths P
a
l
l and calculates the fitness value of path and selects one optimal alternative path p
o
p with optimal fitness f
i
t
n
e
s
s
(
p
o
p
) (e.g., path {
v
S
1
,
v
1
,
v
2
,
v
3
,
v
4
,
v
5
,
v
6
,
v
7
} in left red box (a) of Figure 2). The nodes sequence of a possible alternative path p
j is {
v
j
S
,
v
j
1
,
v
j
2
,
…
,
v
j
k
,
…
,
v
j
n
}, and the factors affecting the choice of p
j include the nodes’ signal strength, end-to-end delay, and battery voltage on the path. These parameters can determine the fitness function of p
j, f
i
t
n
e
s
s
(
p
j
):(1)
f
i
t
n
e
s
s
p
j
=
max
⁡
λ
1
∑
i
=
1
n
R
S
S
I
t
h
R
S
S
I
v
j
i
+
λ
2
∑
i
=
1
n
D
e
l
a
y
t
h
-
D
e
l
a
y
v
j
i
D
e
l
a
y
t
h
+
λ
3
∑
i
=
1
n
V
b
a
t
v
j
i
V
b
a
t
t
h
,where R
S
S
I
v
j
i is the signal strength of v
j
i from the next-hop node v
j
i
-
1 and its value can indirectly reflect the distance between v
j
i and v
j
i
-
1. R
S
S
I
t
h is the signal strength value at threshold point 1 m which is −45 dBm. D
e
l
a
y
v
j
i is the end-to-end delay between the node and next-hop node; D
e
l
a
y
t
h is the end-to-end delay threshold which is set to 250 ms. V
b
a
t
v
j
i is the node battery voltage; its value can indirectly reflect the remaining energy of v
j
i. V
b
a
t
t
h is the node threshold battery voltage and equals 3.5 v. λ
1, λ
2, and λ
3 are the weights of remaining energy, delay, and distance constraints in the fitness function, respectively, and λ
1
+
λ
2
+
λ
3
=
1. We set λ
1
=
0.4, λ
2
=
0.2, and λ
3
=
0.4. The higher fitness value indicates the more suitable routing path; therefore, the best path p
b with the optimal fitness f
i
t
n
e
s
s
(
p
b
) will be selected.After that if the number of possible alternative paths in the setP
a
l
l is more than 5, the selection of calculated possible alternative paths would be so complex, and we would use the swarm intelligent algorithm to optimize the selection of optimal path, or else the optimal path would be calculated and selected directly. We consider each possible alternative path p
j from source v
s
i to v
s
i
n
k as a solution, and the number of solutions in the population is m. The details of swarm intelligent algorithm are described in the next section.


## 3. Design of the Protocol in MSWSN

### 3.1. The Swarm Intelligent Algorithm of Route Maintaining Protocol

The kernel optimization algorithm of our proposed route maintaining protocol is a swarm intelligent optimization algorithm. This optimization algorithm would compute and select the optimized path from source node to the sink among all the possible paths, in which each possible path represents a solution. As new avenues in the field of optimization, swarm intelligence was defined by Bonabeau as the attempt to design algorithms or distributed problem-solving devices inspired by collective behavior of social insect colonies and other animal societies [16]. Common examples range from flock of birds to colony of bees. The main essence of swarm intelligence is including the functional behavior of these group agents into a practical computational model [13], such as artificial bee colony (ABC) algorithm.The population-based artificial bee colony (ABC) algorithm proposed by Okdem et al. is based on the minimal foraging model of honey bees used in nectar collection from the adjoining environment of their honeycomb [17], with the behavior like self-organization, task allocation, and communication among the individuals. Its advantages of fewer parameter settings, faster convergence speed, and higher convergence precision have attracted the attention of many scholars since it was proposed. The algorithm has been successfully applied in the function optimization problem, WSN, and other areas [18, 19]. The tests for several standard functions by [14] have demonstrated that the performance of ABC is better than the mainstream optimization algorithms, such as GA, PSO, and DE algorithm.In the ABC, bees are categorized into three groups: employed bees, onlooker bees, and scout bees. The employed bees search food sources and share the information to recruit the onlooker bees. The onlooker bees make decision to choose a food source from those found by the employed bees and search food around it. The food source that has more nectar amount (fitness value) would have a higher probability to be selected by onlooker bees. The scout bees are translated from a few employed bees, which discard their food sources and randomly search new ones. For a search problem in aD-dimensional space, the position of a food source represents a potential solution. The nectar amount of a food source is the fitness value of the associate solution. Each food source is exploited by only one employed bee. The number of employed or onlooker bees is equal to the number of solutions in the population.The ABC can use the positive feedback mechanisms of optimized search between bees to effectively speed up the process of global optimization and set fewer parameters. But when searching in the near global optimal solution, the search speed would slow down and the diversity of population would be reduced. Therefore, we draw on outstanding diversity characteristic of immune mechanism and develop the IABC algorithm. Each solution would be considered as an antibody. After the antibody clone and selection step, the better one is reserved and the worse one is discarded, which would increase its diversity.


#### 3.1.1. Artificial Bee Colony Mechanism

X
i
=
x
i
1
,
x
i
2
,
…
,
x
i
D is the ith food source (solution) in the population, and D is the problem dimension size. Each employed bee generates a new food source V
i around the neighborhood of its previous food source position as follows:(2)
v
i
j
=
x
i
j
+
ϕ
i
j
x
i
j
-
x
k
j
,where i
=
1,2
,
3
,
…
,
S
N, S
N is the population size, j
=
1,2
,
…
,
D is a random index, and x
k is a randomly selected solution in the current population (k
≠
i). ϕ
i
j is a random number in the range [
-
1,1
]. If the newV
i is better than its parent X
i, then V
i replaces X
i.After employed bees phase, the probability valueP
r
o
i is calculated according to the food sources fitness as the following: (3)
P
r
o
i
=
f
i
t
n
e
s
s
x
i
∑
i
=
1
S
N
f
i
t
n
e
s
s
x
i
,where f
i
t
n
e
s
s
x
i is the fitness value of the ith solution in the population and P
r
o
i is proportional to f
i
t
n
e
s
s
x
i. A better food source has higher probability to be selected.If a food source cannot be improved further over a predefined number of rounds, the food source is abandoned. Assume that the abandoned source isx
i; the scout bee randomly searches a new food source to be replaced with x
i. The operation is defined as follows: (4)
x
i
j
=
x
j
m
i
n
+
R
a
n
d
0,1
x
j
m
a
x
-
x
j
m
i
n
,where R
a
n
d
0,1 is uniformly distributed in the range [
0,1
] and [
x
j
m
i
n
,
x
j
m
a
x
] is the boundary constraint for the jth variable. Then, if the fitness value of the solution is the optimal fitness or the number of iterations increases from zero to Gen, the optimal path p
o
p (solution) would be output, or else go to the immunization step.


#### 3.1.2. Immunization Mechanism

In this step, each solution would be considered as an antibody. The sequence numberS
N of solution x
i arranged in the optimal solution set X
b is considered as the affinity of solution S
A
i, and S
A
i
=
S
N. Then, the clone number C
N
i is calculated as follows: (5)
C
N
i
=
S
A
i
×
N
p
∑
j
=
1
m
j
,where N
p is the solution number,m is the size of optimal solution set X
b, and the total cloned solution number is S
u
m
=
∑
j
=
1
m
C
N
i. Thus, the cloned solution number is proportional to the fitness. Then, the solution mutation is used in the clone populations and the mutation rule is as follows:(6)
C
S
i
=
x
i
+
γ
R
a
n
d
0,1
,where x
i is the original antibody, γ represents mutation factors and γ
=
0.5, and C
S
i is the clone solution individual. In the solution restrain rule, we calculate the antigen stimulus degree of solution in N
(
X
b
) and the mutation solution. The Euclidean distance between solution N
(
C
S
t
) and antigen (fitness) f
i
t
n
e
s
s
(
x
t
) is D
(
i
,
j
)
=
∑
i
=
1
n
(
C
S
i
t
-
f
i
t
n
e
s
s
(
x
i
t
)
)
2.Therefore, the stimulus degree of antibody (solution) is(7)
S
D
i
,
j
=
1
D
i
,
j
=
1
∑
i
=
1
n
C
S
i
t
-
f
i
t
n
e
s
s
x
i
t
2
.After comparing each solution with the stimulus thresholdT
h, the better solution (
S
D
(
i
,
j
)
>
T
h
) would be reserved in the memory cell, and the worse one is discarded. The detailed process of the proposed IABC algorithm is shown in Figure 3.Figure 3
The flowchart of the IABC algorithm for route maintaining.The IABC optimization algorithm is the kernel algorithm of our route maintaining protocol of the MSWSN. To deal with the path maintaining problem due to the movement of sink, the proposed algorithm would optimize the path fitness function to provide the fast routing recovery mechanism with an alternative optimal-fitness path. Apparently, the more suitable alternative path selected from source to the mobile sink would contain nodes with stronger signal strength, less end-to-end delay, and higher battery voltage.


### 3.2. Assumption of Energy Model

The calculation of minimum energy consumption emphasizing the effect of distances will be as in (8) and (9) expressing sum of the energy consumptions of network [9]. The abbreviations j, E
n
e
j, E
n
e
T
X, E
n
e
R
X, E
n
e
e
l
e
c, E
n
e
a
m
p, k, and d in (9) are node index, energy consumption of the jth node, transmit energy, receive energy, radio electronics parameter, transmit amplifier parameter, number of bits of the transmitting data, and distance value between jth node and next-hop node, respectively:(8)
E
n
e
j
≥
E
n
e
R
X
+
E
n
e
T
X
(9)
E
n
e
R
X
=
E
n
e
e
l
e
c
·
k
,
E
n
e
T
X
=
E
n
e
e
l
e
c
+
E
n
e
a
m
p
·
d
j
2
·
k
.Using this method, the total energy consumption of the data transmission and executing the proposed IABC per round can be calculated in the simulation.


## 3.1. The Swarm Intelligent Algorithm of Route Maintaining Protocol

The kernel optimization algorithm of our proposed route maintaining protocol is a swarm intelligent optimization algorithm. This optimization algorithm would compute and select the optimized path from source node to the sink among all the possible paths, in which each possible path represents a solution. As new avenues in the field of optimization, swarm intelligence was defined by Bonabeau as the attempt to design algorithms or distributed problem-solving devices inspired by collective behavior of social insect colonies and other animal societies [16]. Common examples range from flock of birds to colony of bees. The main essence of swarm intelligence is including the functional behavior of these group agents into a practical computational model [13], such as artificial bee colony (ABC) algorithm.The population-based artificial bee colony (ABC) algorithm proposed by Okdem et al. is based on the minimal foraging model of honey bees used in nectar collection from the adjoining environment of their honeycomb [17], with the behavior like self-organization, task allocation, and communication among the individuals. Its advantages of fewer parameter settings, faster convergence speed, and higher convergence precision have attracted the attention of many scholars since it was proposed. The algorithm has been successfully applied in the function optimization problem, WSN, and other areas [18, 19]. The tests for several standard functions by [14] have demonstrated that the performance of ABC is better than the mainstream optimization algorithms, such as GA, PSO, and DE algorithm.In the ABC, bees are categorized into three groups: employed bees, onlooker bees, and scout bees. The employed bees search food sources and share the information to recruit the onlooker bees. The onlooker bees make decision to choose a food source from those found by the employed bees and search food around it. The food source that has more nectar amount (fitness value) would have a higher probability to be selected by onlooker bees. The scout bees are translated from a few employed bees, which discard their food sources and randomly search new ones. For a search problem in aD-dimensional space, the position of a food source represents a potential solution. The nectar amount of a food source is the fitness value of the associate solution. Each food source is exploited by only one employed bee. The number of employed or onlooker bees is equal to the number of solutions in the population.The ABC can use the positive feedback mechanisms of optimized search between bees to effectively speed up the process of global optimization and set fewer parameters. But when searching in the near global optimal solution, the search speed would slow down and the diversity of population would be reduced. Therefore, we draw on outstanding diversity characteristic of immune mechanism and develop the IABC algorithm. Each solution would be considered as an antibody. After the antibody clone and selection step, the better one is reserved and the worse one is discarded, which would increase its diversity.


### 3.1.1. Artificial Bee Colony Mechanism

X
i
=
x
i
1
,
x
i
2
,
…
,
x
i
D is the ith food source (solution) in the population, and D is the problem dimension size. Each employed bee generates a new food source V
i around the neighborhood of its previous food source position as follows:(2)
v
i
j
=
x
i
j
+
ϕ
i
j
x
i
j
-
x
k
j
,where i
=
1,2
,
3
,
…
,
S
N, S
N is the population size, j
=
1,2
,
…
,
D is a random index, and x
k is a randomly selected solution in the current population (k
≠
i). ϕ
i
j is a random number in the range [
-
1,1
]. If the newV
i is better than its parent X
i, then V
i replaces X
i.After employed bees phase, the probability valueP
r
o
i is calculated according to the food sources fitness as the following: (3)
P
r
o
i
=
f
i
t
n
e
s
s
x
i
∑
i
=
1
S
N
f
i
t
n
e
s
s
x
i
,where f
i
t
n
e
s
s
x
i is the fitness value of the ith solution in the population and P
r
o
i is proportional to f
i
t
n
e
s
s
x
i. A better food source has higher probability to be selected.If a food source cannot be improved further over a predefined number of rounds, the food source is abandoned. Assume that the abandoned source isx
i; the scout bee randomly searches a new food source to be replaced with x
i. The operation is defined as follows: (4)
x
i
j
=
x
j
m
i
n
+
R
a
n
d
0,1
x
j
m
a
x
-
x
j
m
i
n
,where R
a
n
d
0,1 is uniformly distributed in the range [
0,1
] and [
x
j
m
i
n
,
x
j
m
a
x
] is the boundary constraint for the jth variable. Then, if the fitness value of the solution is the optimal fitness or the number of iterations increases from zero to Gen, the optimal path p
o
p (solution) would be output, or else go to the immunization step.


### 3.1.2. Immunization Mechanism

In this step, each solution would be considered as an antibody. The sequence numberS
N of solution x
i arranged in the optimal solution set X
b is considered as the affinity of solution S
A
i, and S
A
i
=
S
N. Then, the clone number C
N
i is calculated as follows: (5)
C
N
i
=
S
A
i
×
N
p
∑
j
=
1
m
j
,where N
p is the solution number,m is the size of optimal solution set X
b, and the total cloned solution number is S
u
m
=
∑
j
=
1
m
C
N
i. Thus, the cloned solution number is proportional to the fitness. Then, the solution mutation is used in the clone populations and the mutation rule is as follows:(6)
C
S
i
=
x
i
+
γ
R
a
n
d
0,1
,where x
i is the original antibody, γ represents mutation factors and γ
=
0.5, and C
S
i is the clone solution individual. In the solution restrain rule, we calculate the antigen stimulus degree of solution in N
(
X
b
) and the mutation solution. The Euclidean distance between solution N
(
C
S
t
) and antigen (fitness) f
i
t
n
e
s
s
(
x
t
) is D
(
i
,
j
)
=
∑
i
=
1
n
(
C
S
i
t
-
f
i
t
n
e
s
s
(
x
i
t
)
)
2.Therefore, the stimulus degree of antibody (solution) is(7)
S
D
i
,
j
=
1
D
i
,
j
=
1
∑
i
=
1
n
C
S
i
t
-
f
i
t
n
e
s
s
x
i
t
2
.After comparing each solution with the stimulus thresholdT
h, the better solution (
S
D
(
i
,
j
)
>
T
h
) would be reserved in the memory cell, and the worse one is discarded. The detailed process of the proposed IABC algorithm is shown in Figure 3.Figure 3
The flowchart of the IABC algorithm for route maintaining.The IABC optimization algorithm is the kernel algorithm of our route maintaining protocol of the MSWSN. To deal with the path maintaining problem due to the movement of sink, the proposed algorithm would optimize the path fitness function to provide the fast routing recovery mechanism with an alternative optimal-fitness path. Apparently, the more suitable alternative path selected from source to the mobile sink would contain nodes with stronger signal strength, less end-to-end delay, and higher battery voltage.


## 3.1.1. Artificial Bee Colony Mechanism

X
i
=
x
i
1
,
x
i
2
,
…
,
x
i
D is the ith food source (solution) in the population, and D is the problem dimension size. Each employed bee generates a new food source V
i around the neighborhood of its previous food source position as follows:(2)
v
i
j
=
x
i
j
+
ϕ
i
j
x
i
j
-
x
k
j
,where i
=
1,2
,
3
,
…
,
S
N, S
N is the population size, j
=
1,2
,
…
,
D is a random index, and x
k is a randomly selected solution in the current population (k
≠
i). ϕ
i
j is a random number in the range [
-
1,1
]. If the newV
i is better than its parent X
i, then V
i replaces X
i.After employed bees phase, the probability valueP
r
o
i is calculated according to the food sources fitness as the following: (3)
P
r
o
i
=
f
i
t
n
e
s
s
x
i
∑
i
=
1
S
N
f
i
t
n
e
s
s
x
i
,where f
i
t
n
e
s
s
x
i is the fitness value of the ith solution in the population and P
r
o
i is proportional to f
i
t
n
e
s
s
x
i. A better food source has higher probability to be selected.If a food source cannot be improved further over a predefined number of rounds, the food source is abandoned. Assume that the abandoned source isx
i; the scout bee randomly searches a new food source to be replaced with x
i. The operation is defined as follows: (4)
x
i
j
=
x
j
m
i
n
+
R
a
n
d
0,1
x
j
m
a
x
-
x
j
m
i
n
,where R
a
n
d
0,1 is uniformly distributed in the range [
0,1
] and [
x
j
m
i
n
,
x
j
m
a
x
] is the boundary constraint for the jth variable. Then, if the fitness value of the solution is the optimal fitness or the number of iterations increases from zero to Gen, the optimal path p
o
p (solution) would be output, or else go to the immunization step.


## 3.1.2. Immunization Mechanism

In this step, each solution would be considered as an antibody. The sequence numberS
N of solution x
i arranged in the optimal solution set X
b is considered as the affinity of solution S
A
i, and S
A
i
=
S
N. Then, the clone number C
N
i is calculated as follows: (5)
C
N
i
=
S
A
i
×
N
p
∑
j
=
1
m
j
,where N
p is the solution number,m is the size of optimal solution set X
b, and the total cloned solution number is S
u
m
=
∑
j
=
1
m
C
N
i. Thus, the cloned solution number is proportional to the fitness. Then, the solution mutation is used in the clone populations and the mutation rule is as follows:(6)
C
S
i
=
x
i
+
γ
R
a
n
d
0,1
,where x
i is the original antibody, γ represents mutation factors and γ
=
0.5, and C
S
i is the clone solution individual. In the solution restrain rule, we calculate the antigen stimulus degree of solution in N
(
X
b
) and the mutation solution. The Euclidean distance between solution N
(
C
S
t
) and antigen (fitness) f
i
t
n
e
s
s
(
x
t
) is D
(
i
,
j
)
=
∑
i
=
1
n
(
C
S
i
t
-
f
i
t
n
e
s
s
(
x
i
t
)
)
2.Therefore, the stimulus degree of antibody (solution) is(7)
S
D
i
,
j
=
1
D
i
,
j
=
1
∑
i
=
1
n
C
S
i
t
-
f
i
t
n
e
s
s
x
i
t
2
.After comparing each solution with the stimulus thresholdT
h, the better solution (
S
D
(
i
,
j
)
>
T
h
) would be reserved in the memory cell, and the worse one is discarded. The detailed process of the proposed IABC algorithm is shown in Figure 3.Figure 3
The flowchart of the IABC algorithm for route maintaining.The IABC optimization algorithm is the kernel algorithm of our route maintaining protocol of the MSWSN. To deal with the path maintaining problem due to the movement of sink, the proposed algorithm would optimize the path fitness function to provide the fast routing recovery mechanism with an alternative optimal-fitness path. Apparently, the more suitable alternative path selected from source to the mobile sink would contain nodes with stronger signal strength, less end-to-end delay, and higher battery voltage.


## 3.2. Assumption of Energy Model

The calculation of minimum energy consumption emphasizing the effect of distances will be as in (8) and (9) expressing sum of the energy consumptions of network [9]. The abbreviations j, E
n
e
j, E
n
e
T
X, E
n
e
R
X, E
n
e
e
l
e
c, E
n
e
a
m
p, k, and d in (9) are node index, energy consumption of the jth node, transmit energy, receive energy, radio electronics parameter, transmit amplifier parameter, number of bits of the transmitting data, and distance value between jth node and next-hop node, respectively:(8)
E
n
e
j
≥
E
n
e
R
X
+
E
n
e
T
X
(9)
E
n
e
R
X
=
E
n
e
e
l
e
c
·
k
,
E
n
e
T
X
=
E
n
e
e
l
e
c
+
E
n
e
a
m
p
·
d
j
2
·
k
.Using this method, the total energy consumption of the data transmission and executing the proposed IABC per round can be calculated in the simulation.


## 4. Experimental Evaluation of the Route Maintaining Protocol

### 4.1. Model and Assumption

Our system uses MATLAB 2008a to simulate and evaluate the performance of the protocol. The experimental hardware environments are Intel i7-4600M, 2.90 GHz CPU, and 4 GB memory, and the operating system is MS windows 7. The whole MSWSN is simulated in the area of 3500 m× 3500 m. The field is static and 200~300 sensor nodes are deployed uniformly in which 10% sensor nodes are source nodes. The sensor nodes are homogeneous and have the same initial energy of 120 J. Their communication radius is 300 m. This experiment compares our protocol with TTDD, ERTLD routing protocols for MSWSN. The purpose of the simulation is to illustrate that our protocol could provide a more robust and efficient transmission environment.The other network environment parameters are as follows: One mobile sink moves in the network and its speed is 3~6 m/s, the source node delivers packets at the rate of 20 data packets per round, with 10 KB of each packet size, and the simulation lasts for 600 rounds. In the energy model,E
n
e
e
l
e
c
=
40 nJ/bit and E
n
e
a
m
p
=
60 nJ/bit. The sink is assumed to provide sufficient energy to receive data from nodes and operate our protocol. The values of parameters used for the IABC are function dimension D
=
20 and iterated generation Gen = 150.A snapshot from the source node to the mobile sink during the network simulation is shown in Figure4. We can see that when the sink moves from A to a new coordinate B, the source node immediately establishes an optimal alternative path (path 1-2-3-8-9-10-11-B in Figure 4) to reach the sink, so as to replace the previous broken path (path 1-2-3-4-5-6-7-A in Figure 4).Figure 4
The snapshot of network routing simulation with our protocol.


### 4.2. Evaluation of the Experimental Results

The performance metrics used for the comparison are packet delivery ratio (the ratio between the successfully received data packets at the sink and the successfully sent data packets by the source node), energy expenditure ratio (the ratio between the consumed energy of nodes and initial energy of these nodes), and average end-to-end delay (the difference between the time a packet is received by the sink and the time it was originally sent by the source node). The results of packet delivery ratio and energy expenditure ratio are normalized, which is helpful to compare their performances.In terms of packet delivery ratio in Figures5(a) and 5(b), it can be clearly seen that the delivery ratio for all protocols drops as the number of simulation rounds is increased. This is because the mobility of sink affects the quality of the selected links of the path; the process of links repair and loss of packet would reduce the packet delivery ratio. Among the selected protocols, IABC has the highest packet delivery rate and ERTLD achieves the second one. This is due to several factors: data traffic is routed along shorter paths by using concentric ring mechanism and IABC optimizing algorithm, which would reduce the packet loss rate; the intelligent swarm optimization mechanism keeps the route update faster and more efficiently, with its fast responsiveness to the changing sink position.Figure 5
Comparison of packet delivery ratio between the three protocols with different node number: (a) 200 sensor nodes and (b) 300 sensor nodes.
(a)
200 sensor nodes
(b)
300 sensor nodesIn our second experiment presented in Figures6(a) and 6(b), we vary the velocity of a mobile sink from 3 m/s to 6 m/s. The energy expenditure ratios of all protocols are increased with an increasing number of simulation rounds. This ratio also increases as the mobile sink moves faster, because the change of the frequent topology will incur heavier communication overhead. IABC has lower energy expenditure, followed by ERTLD and finally TTDD. IABC performs slightly better due to its concentric ring mechanism, which can guide the route researching direction and reduce communication overhead of nodes, and also due to the intelligent routing optimization mechanism which enables faster recovery of routes and reduces the energy consumption of protocol. The delivery rate trend in the case of higher velocity of mobile sink is also as expected, dropping with higher velocities. This is due to the fact that nodes would consume more energy to search the route to the sink when they moves faster away from their transmission radius. Notably, the appropriate speed of the sink will be needed for all protocols, which can better reflect the performance of the routing protocols.Figure 6
Comparison of energy expenditure between the three protocols as a function of different node speeds: (a) sink speed 3 m/s and (b) sink speed 6 m/s.
(a)
Sink speed 3 m/s
(b)
Sink speed 6 m/sIn the third experiment, the smaller average end-to-end delay means the faster data transmission. We can observe in Figures7(a) and 7(b) that the IABC outperforms the ERTLD and TTDD in terms of average delay. It can be explained by the faster node communication routing and shorter alternative path selection of the proposed IABC for route maintaining, which can balance the network traffic load and prolong the network lifetime. The delay curve value of IABC almost has not changed as the number of simulation rounds increases, because our protocol would always choose the optimal path with the stable routing delay. Comparing with Figures 7(a) and 7(b), as the more sensor nodes number indicates the longer delivery length of the path, thus the advantage of our IABC with the better alternative path selection is demonstrated more obviously, which means that our routing protocol is more suitable for deploying in the large scale networks with mobile sink.Figure 7
Comparison of end-to-end delay between the three protocols with different node number: (a) 200 sensor nodes and (b) 300 sensor nodes.
(a)
200 sensor nodes
(b)
300 sensor nodesIn summary, these experiments demonstrate clearly the routing optimization ability of IABC and its intelligent optimization mechanism to quickly identify routes to mobile sink. Compared to the other routing protocols, it consumes significantly less energy, needs less end-to-end delay, and achieves considerably higher delivery rates.


## 4.1. Model and Assumption

Our system uses MATLAB 2008a to simulate and evaluate the performance of the protocol. The experimental hardware environments are Intel i7-4600M, 2.90 GHz CPU, and 4 GB memory, and the operating system is MS windows 7. The whole MSWSN is simulated in the area of 3500 m× 3500 m. The field is static and 200~300 sensor nodes are deployed uniformly in which 10% sensor nodes are source nodes. The sensor nodes are homogeneous and have the same initial energy of 120 J. Their communication radius is 300 m. This experiment compares our protocol with TTDD, ERTLD routing protocols for MSWSN. The purpose of the simulation is to illustrate that our protocol could provide a more robust and efficient transmission environment.The other network environment parameters are as follows: One mobile sink moves in the network and its speed is 3~6 m/s, the source node delivers packets at the rate of 20 data packets per round, with 10 KB of each packet size, and the simulation lasts for 600 rounds. In the energy model,E
n
e
e
l
e
c
=
40 nJ/bit and E
n
e
a
m
p
=
60 nJ/bit. The sink is assumed to provide sufficient energy to receive data from nodes and operate our protocol. The values of parameters used for the IABC are function dimension D
=
20 and iterated generation Gen = 150.A snapshot from the source node to the mobile sink during the network simulation is shown in Figure4. We can see that when the sink moves from A to a new coordinate B, the source node immediately establishes an optimal alternative path (path 1-2-3-8-9-10-11-B in Figure 4) to reach the sink, so as to replace the previous broken path (path 1-2-3-4-5-6-7-A in Figure 4).Figure 4
The snapshot of network routing simulation with our protocol.


## 4.2. Evaluation of the Experimental Results

The performance metrics used for the comparison are packet delivery ratio (the ratio between the successfully received data packets at the sink and the successfully sent data packets by the source node), energy expenditure ratio (the ratio between the consumed energy of nodes and initial energy of these nodes), and average end-to-end delay (the difference between the time a packet is received by the sink and the time it was originally sent by the source node). The results of packet delivery ratio and energy expenditure ratio are normalized, which is helpful to compare their performances.In terms of packet delivery ratio in Figures5(a) and 5(b), it can be clearly seen that the delivery ratio for all protocols drops as the number of simulation rounds is increased. This is because the mobility of sink affects the quality of the selected links of the path; the process of links repair and loss of packet would reduce the packet delivery ratio. Among the selected protocols, IABC has the highest packet delivery rate and ERTLD achieves the second one. This is due to several factors: data traffic is routed along shorter paths by using concentric ring mechanism and IABC optimizing algorithm, which would reduce the packet loss rate; the intelligent swarm optimization mechanism keeps the route update faster and more efficiently, with its fast responsiveness to the changing sink position.Figure 5
Comparison of packet delivery ratio between the three protocols with different node number: (a) 200 sensor nodes and (b) 300 sensor nodes.
(a)
200 sensor nodes
(b)
300 sensor nodesIn our second experiment presented in Figures6(a) and 6(b), we vary the velocity of a mobile sink from 3 m/s to 6 m/s. The energy expenditure ratios of all protocols are increased with an increasing number of simulation rounds. This ratio also increases as the mobile sink moves faster, because the change of the frequent topology will incur heavier communication overhead. IABC has lower energy expenditure, followed by ERTLD and finally TTDD. IABC performs slightly better due to its concentric ring mechanism, which can guide the route researching direction and reduce communication overhead of nodes, and also due to the intelligent routing optimization mechanism which enables faster recovery of routes and reduces the energy consumption of protocol. The delivery rate trend in the case of higher velocity of mobile sink is also as expected, dropping with higher velocities. This is due to the fact that nodes would consume more energy to search the route to the sink when they moves faster away from their transmission radius. Notably, the appropriate speed of the sink will be needed for all protocols, which can better reflect the performance of the routing protocols.Figure 6
Comparison of energy expenditure between the three protocols as a function of different node speeds: (a) sink speed 3 m/s and (b) sink speed 6 m/s.
(a)
Sink speed 3 m/s
(b)
Sink speed 6 m/sIn the third experiment, the smaller average end-to-end delay means the faster data transmission. We can observe in Figures7(a) and 7(b) that the IABC outperforms the ERTLD and TTDD in terms of average delay. It can be explained by the faster node communication routing and shorter alternative path selection of the proposed IABC for route maintaining, which can balance the network traffic load and prolong the network lifetime. The delay curve value of IABC almost has not changed as the number of simulation rounds increases, because our protocol would always choose the optimal path with the stable routing delay. Comparing with Figures 7(a) and 7(b), as the more sensor nodes number indicates the longer delivery length of the path, thus the advantage of our IABC with the better alternative path selection is demonstrated more obviously, which means that our routing protocol is more suitable for deploying in the large scale networks with mobile sink.Figure 7
Comparison of end-to-end delay between the three protocols with different node number: (a) 200 sensor nodes and (b) 300 sensor nodes.
(a)
200 sensor nodes
(b)
300 sensor nodesIn summary, these experiments demonstrate clearly the routing optimization ability of IABC and its intelligent optimization mechanism to quickly identify routes to mobile sink. Compared to the other routing protocols, it consumes significantly less energy, needs less end-to-end delay, and achieves considerably higher delivery rates.


## 5. Conclusion

This study presents a novel route maintaining protocol based on the IABC for the MSWSN. In the proposed protocol, the concentric ring mechanism is utilized to guide the route researching direction, and the optimal routing selection is adopted to preserve the data delivery route in the network. Using the immune based artificial bee colony (IABC) algorithm to optimize the forwarding path, the protocol could find an alternative routing path quickly and efficiently when the coordinate of sink is changed in MSWSN. More importantly, this paper demonstrated the applicability and the potential of IABC algorithm for solving routing optimization problems. The results of our extending performance are compared to the other aforementioned routing protocols in terms of energy, packet delivery, and delay. Our proposed route maintaining protocol could efficiently solve the energy hole problem, balance the network traffic load, and maintain the network robustness against topology changes.In the future we will focus on improving the convergence performance, reducing the computational complexity of the IABC algorithm, and validating the proposed protocol on different scenarios with various movement trajectories of mobile sink, and the most important optimization objective is maximizing the network lifetime. In addition, the nodes would have GPS to locate themselves, and the sink may broadcast its position instead of CR packets to build the concentric ring mechanism.



---

*Source: 823909-2015-10-29.xml*