Você está na página 1de 17

See

discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/268602234

FUZZY RANDOM EXPECTED VALUE MODEL


BASED MULTI-OBJECTIVE OPTIMIZATION
ROUTING FOR WIRELESS SENSOR...

Conference Paper · April 2012


DOI: 10.1142/9789814401531_0031

CITATION READS

1 38

2 authors:

Junling Lu Xiaoming Wang


Shaanxi Normal University Shaanxi Normal University
15 PUBLICATIONS 87 CITATIONS 110 PUBLICATIONS 1,533 CITATIONS

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

privacy preservation View project

opportunistic network View project

All content following this page was uploaded by Xiaoming Wang on 26 November 2014.

The user has requested enhancement of the downloaded file.


Fuzzy random multi-objective optimization
based routing for wireless sensor networks

Junling Lu, Xiaoming Wang, Lichen


Zhang & Xueqing Zhao

Soft Computing
A Fusion of Foundations,
Methodologies and Applications

ISSN 1432-7643
Volume 18
Number 5

Soft Comput (2014) 18:981-994


DOI 10.1007/s00500-013-1119-2

1 23
Your article is protected by copyright and
all rights are held exclusively by Springer-
Verlag Berlin Heidelberg. This e-offprint is
for personal use only and shall not be self-
archived in electronic repositories. If you wish
to self-archive your article, please use the
accepted manuscript version for posting on
your own website. You may further deposit
the accepted manuscript version in any
repository, provided it is only made publicly
available 12 months after official publication
or later and provided acknowledgement is
given to the original source of publication
and a link is inserted to the published article
on Springer's website. The link must be
accompanied by the following text: "The final
publication is available at link.springer.com”.

1 23
Author's personal copy
Soft Comput (2014) 18:981–994
DOI 10.1007/s00500-013-1119-2

METHODOLOGIES AND APPLICATION

Fuzzy random multi-objective optimization based routing


for wireless sensor networks
Junling Lu · Xiaoming Wang ·
Lichen Zhang · Xueqing Zhao

Published online: 14 September 2013


© Springer-Verlag Berlin Heidelberg 2013

Abstract Wireless sensor networks are deployed in com- 1 Introduction


plex and uncertain environments, and multiple objectives
of routing algorithms are expected to be optimal. However, Nodes in wireless sensor networks (WSNs) are deployed ran-
routing algorithms based on deterministic single objective domly and have limited energy. Meanwhile, wireless com-
optimization may not flexibly meet the above needs of appli- munication is susceptible to interference and link quality is
cations. This paper adopts fuzzy random optimization and hard to keep stable. In order to maximize the utility of data
multi-objective optimization, introduces fuzzy random vari- transmission in WSNs, the transmission paths from a source
ables to describe both fuzziness and randomness of link delay, node to a destination node need to reasonably be chosen.
link reliability and nodes’ residual energy, and proposes a Therefore, routing for WSNs is generally formulated as a
routing model based on fuzzy random expected value and typical optimization problem (Al-Karaki et al. 2009; Yuan
standard deviation model. A hybrid routing algorithm based et al. 2007; Gogu et al. 2011; Wang et al. 2011; He et al.
on fuzzy random multi-objective optimization is designed, 2010; Minhas et al. 2009).
which embeds fuzzy random simulation into genetic algo- Most of current WSN routing optimization adopts single
rithm with Pareto optimal solution. Simulation results show objective optimization, which chooses the most concerned
that the presented algorithm, by adjusting the parameters of performance as the objective function, and treats other per-
fuzzy random variables for depicting both fuzziness and ran- formances as the constraints in the optimization problem.
domness, achieves a longer lifetime and wider performances Clearly, single objection optimization may be unfair and
of delay, latency jitter, reliability, communication interfer- unreasonable because it artificially strengthens certain per-
ence, energy and balanced energy distribution. Therefore, formance, hence, it can not meet the needs of WSN appli-
the presented algorithm can meet different application needs cation. Al-Karaki et al. (2009) implemented maximizing the
of the cluster head network in the two-tiered wireless sensor network lifetime by means of data fusion and routing opti-
networks. mization. However, the more realistic routing for WSNs is to
discover the optimal paths, which satisfy the multiple objec-
Keywords Wireless sensor network · Uncertainty · Fuzzy tives at the same time, for example, the shortest delay, the
random optimization · Multi-objective optimization · highest reliability, the maximal energy, the minimal latency
Routing jitter, the minimal communication interference and the most
balanced distribution of nodes’ residual energy, or the eclec-
tic result of the above objectives. Naturally, multi-objective
optimization can be used to solve the above problem (Rubio-
Largo et al. 2012; Sengupta et al. 2012; Gomez et al. 2012).
Communicated by L. T. Koczy. Accordingly, formulating WSN routing as multi-objective
optimization may be more reasonable and consistent with
J. Lu · X. Wang (B) · L. Zhang · X. Zhao
the realistic cases of routing decision.
School of Computer Science, Shaanxi Normal University,
Xi’an 710062, China Due to the complexities of the deployed environments and
e-mail: wangxm@snnu.edu.cn wireless communication, several kinds of uncertainties exist

123
Author's personal copy
982 J. Lu et al.

in link delay, link reliability and nodes’ residual energy. In mization and multi-objective optimization to analyze and
fact, both random uncertainty and fuzzy uncertainty simul- model, we formulated the WSN routing as the problem of
taneously exist in link quality and nodes’ residual energy. fuzzy random multi-objective optimization (FRMOO). A
In routing decision, the delay of a link is affected by the novel routing model based on FRMOO is proposed, which
queue, the reliability of it is influenced by the interfer- simultaneously considers the multiple objectives, such as
ence and noise, the residual energy of a node is affected delay, reliability, energy, latency jitter, communication inter-
by many environmental factors such as the weather and ference and energy balance of a path. We introduce fuzzy
the temperature, and the above impacts are random. On random variable to depict fuzziness and randomness of link
the other hand, estimating the delay and reliability of a delay, link reliability and nodes’ residual energy, hoping
link and residual energy of a node is fuzzy (Wang et al. to truly reflect the uncertain characteristics in WSN rout-
2011). The existing literatures usually only consider ran- ing. For explicitly explaining the meaning of the uncer-
dom uncertainty or fuzzy uncertainty of WSN routing, which tain routing model, the scalar expected value and variance
adopt different random or fuzzy methods in solving multi- of fuzzy random variable and fuzzy random simulation are
objective optimization problems (MOPs) respectively. He introduced (Liu and Liu 2003a,b), so, the FRMOO routing
et al. (2010) proposed a random multi-objective optimization model is converted from the uncertain multi-objective opti-
framework for WSNs, and described its application method mization to the certain multi-objective optimization. Fur-
by taking the optimal rate allocation for example, which is thermore, a hybrid genetic FRMOO algorithm based on
also suitable for WSN routing. Minhas et al. (2009) pro- Pareto optimal solution is designed for searching the opti-
posed an online routing algorithm based on fuzzy multi- mal paths. Simulation results show that the FRMOO routing
objective optimization (FMOO), simultaneously optimizing algorithm can flexibly balanced the multiple performances,
the lifetime of WSN and end-to-end delay. In WSN rout- and has better robustness. The above ideas are illustrated in
ing, only considering randomness or fuzziness of link qual- Fig. 1.
ity and nodes’ residual energy, that is, only adopting ran- Other than our previous tentative works, the added contri-
dom or fuzzy method may not precisely describe the twofold butions of this paper are concluded as follows:
uncertain characteristics of links and nodes, hence, it can- At first, we introduce the scalar variance of a fuzzy ran-
not meets the needs of WSN applications (Wang et al. dom variable, and extend naturally the delay, reliability and
2011). The fuzzy random optimization theory can depict energy of a path which are depicted by fuzzy random vari-
both fuzziness and randomness of the events, which can ables. The new objective functions of jitter, interference and
be applied to the uncertainty analysis and modeling of energy balance are achieved by adopting the standard devi-
the objectives and constraints in routing optimization for ation of the delay, reliability and energy respectively, hence,
WSNs (Liu and Liu 2003a). We have done some tentative a new expected value and standard deviation based routing
works on the multi-objective optimization routing for WSNs model is proposed, which can describe the more objectives
based on the fuzzy random expected value model, and the of WSNs reasonably.
proposed algorithm can achieve a longer network lifetime Next, we focus on solving the standard deviation by adopt-
comparing with the shortest path algorithm (Lu and Wang ing the method of fuzzy random simulation, taking the jitter
2012). of a path for example, which does not have in our earlier
In the two-tiered WSNs for agriculture surveillance, build- works. In addition, the decoding algorithm of the path chro-
ing monitoring and inhabitation monitoring, the relay nodes mosomes encoding with the priorities of nodes in the genetic
with higher energy as the cluster head constitute the upper algorithm is described in detail, and the complexity analyses
network of cluster head, which transmits the data gathered of the algorithms are also discussed in this paper, both of
from the ordinary node to the destination node in a manner of which are not referred to in our earlier paper too.
hop by hop. The locations of the cluster heads are relatively Finally, we emphasize the advantages of the proposed
fixed after deployed, and can be known from the positioning algorithm considering both randomness and fuzziness, by
system, such as the global positioning system (GPS), while comparing it with the algorithms considering only ran-
the routing computation is implemented by the destination domness or fuzziness. Quite an amount of the simula-
node with enough energy and computing ability. Therefore, tion experiments are executed under the same conditions
the routing strategy is reasonable and applicable for the net- of parameters for verifying the advantages of our method
work of cluster head in the special two-tiered WSNs (Bari in this paper. However, in our earlier tentative works, we
et al. 2009; EkbataniFard et al. 2010). only illustrate the advantage in terms of the network life-
In this paper, taking multiple performances of a path time.
in the cluster head network of the two-tiered WSN as the In a word, in this paper, our previous works are extended
optimization objectives, considering fuzziness and random- and improved distinctly from the aspects of modeling, solv-
ness in routing decision, and adopting fuzzy random opti- ing routing model, complexity analysis and simulation.

123
Author's personal copy
FRMOO based routing for WSNs 983

Fig. 1 Scheme of solving Method Result


WSN routing
depict Delay, reliability on a link and Intuitive
Level 1: Fuzzy random variable
residual energy of a node model

construct Delay, reliability and energy


Expected value of a path Mathematical
Level 2: programming
Standard deviation Jitter, interference and energy model
construct balance of a path

Solve
numerical
characteristics
Fuzzy random simulation Optimal solution and optimal Model
Level 3:
objective value solving
Genetic algorithm
Solve
MOPs

The main characteristics of the FRMOO routing model 2 Problem formulation


and algorithm are listed as follows:
2.1 Preliminaries
1. Fuzzy random variables are introduced to depict both
fuzziness and randomness of the objectives and con- The related knowledge of fuzzy random theory and multi-
straints in the routing optimization model, which coin- objective optimization based on Pareto optimality is intro-
cides with the realistic scenes of WSNs. duced in this subsection.
2. FRMOO is adopted to discover the optimal paths, which
are the compromise among the multiple objectives of Definition 1 (Liu and Liu 2002) Let (Θ, Σ, Pos) be a pos-
delay, reliability, energy, latency jitter, communication sibility space, where Θ is a non-empty set, Σ is the power
interference and energy balance of a path, hence better set of Θ, and Pos is possibility measure. For ∀A ∈ Σ, let Ac
adaptability can be achieved. be the complement of A, then a credibility measure of A is
3. The scalar definitions of expected value and variance of defined as
fuzzy random variable make the meaning of the FRMOO
Cr {A} = ( Pos {A} + 1 − Pos{AC })/2
routing model clear, and fuzzy random simulation makes
solving the model convenient.
4. The FRMOO routing algorithm fully utilizes the advan- Definition 2 (Liu and Liu 2002) Let Ψ be a normalized
tages of Pareto optimal solution and parallelism of fuzzy variable. The expected value of Ψ is defined as
genetic algorithm, that is, the multiple optimal paths can
+∞ 0
be found during executing once, so better flexibility and
E[Ψ ] = Cr{Ψ ≥ r } dr − Cr{Ψ ≤ r } dr
high efficiency can be gained.
0 −∞

This paper is organized as follows. Section 2 introduces the provided that at least one of the two integrals in the right-hand
related fuzzy random theory and multi-objective optimiza- side of the above formula is finite.
tion, and formalizes the intuitive WSN routing model based
on fuzzy random variables. In Sect. 3, the FRMOO rout- Definition 3 (Liu and Liu 2003b) Let ξ be a measurable
ing model based on the strict mathematical programming mapping from a probability space (, , Pr) to a collection
is proposed; meanwhile, computing the expected value and of fuzzy numbers, where  is the sample space of sample ω,
standard deviation of fuzzy random variable is discussed. A  is the σ algebra of the subset of , Pr is the probability
hybrid FRMOO routing algorithm, embedding fuzzy random measure. For any Borel set B ∈ R, where R is the real set,
simulation into genetic algorithm based on Pareto optimality, the possibility Pos{ξ(ω) ∈ B} of the event {ξ(ω) ∈ B} cor-
is described in Sect. 4. Section 5 is simulation and analysis. responding to fuzzy variable ξ(ω) is a measurable function
Finally, the conclusions are stated in Sect. 6. of ω, then ξ is a fuzzy random variable.

123
Author's personal copy
984 J. Lu et al.

Definition 4 (Liu and Liu 2003b) Let ξ be a fuzzy random 2.2 Intuitive routing model
variable. The expected value of ξ is defined as
For convenience of describing the routing problem of WSN,
+∞ the notations are defined as follows: fuzzy random variable
E[ξ ] = Pr{ω ∈ |E[ξ(ω)] ≥ r } dr ξi j denotes the delay of link (i, j), where node i and node j
0 are both end points of the link, nonnegative numbers di j−
and di j+ are the lower and upper bounds of ξi j respectively;
0
fuzzy random variable ηi j denotes the reliability of link (i, j),
− Pr{ω ∈ |E[ξ(ω)] ≤ r } dr
nonnegative numbers ri j− ≤ 1 and ri j+ ≤ 1 are the lower
−∞ and upper bounds of ηi j respectively; fuzzy random vari-
able γi denotes the residual energy of node i, nonnegative
provided that at least one of the two integrals in the right-
numbers ei− and ei+ are the lower and upper bounds of γi
hand side of the above formula is finite, where the expected
respectively. The nodes on path P include the source node
operator E is overloaded, E[ξ ] denotes the expected value of
S, the destination node D and the intermediate node set IN.
fuzzy random variable ξ , and E[ξ(ω)] denotes the expected
xi j is the decision variable of link selection: xi j = 1 denotes
value of fuzzy variable ξ(ω).
link (i, j) ∈ P, and xi j = 0 denotes link (i, j) ∈ / P. xi is
the decision variable of node selection: xi = 1 denotes node
Definition 5 (Liu and Liu 2003b) Let ξ be a fuzzy random i ∈ P − {D}; xi = 0 denotes node i ∈ / P − {D}. PN and NN
variable, and the expected value E[ξ ] is finite, then the vari- are the predecessor and successor set of node i respectively.
ance of ξ is defined as According to the conservation principle of network flow, the
in-degree and out-degree of node i satisfies the following
V [ξ ] = E[(ξ − E[ξ ])2 ] constraint

Furthermore, the expected value of the fuzzy random vari- ⎧


able has the following property:   ⎨ 1, i = S
xi j − xki = −1, i = D (1)

j∈N N k∈P N 0, i ∈ I N
Theorem (Liu and Liu 2003a) Let ξ and η be fuzzy random
variables, and the expected values E[ξ ] and E[η] are finite. The WSN routing is considered as follows: at first, it is
For ∀ω ∈ , fuzzy variables ξ(ω) and η(ω) are independent, pointed out that the uncertainties of the delay and reliability
and for ∀a ∈ R and ∀b ∈ R, then the following formula of link (i, j) and the residual energy of node i include both
holds: fuzziness and randomness, and the twofold uncertainties of
which are described by fuzzy random variables ξi j , ηi j and γi
E[aξ + bη] = a E[ξ ] + bE[η] respectively; next, the optimal path P from the source node
S to the destination node D is found, which may satisfy: the
Definition 6 (Zitzler and Thiele 1999) Let x 1 and x 2 be minimum delay, the minimum latency jitter, the maximal reli-
two feasible solutions (vector) of a minimization problem ability, the minimum communication interference, the max-
of multi-objective optimization. x 1 dominates x 2 (also writ- imal energy and the most balanced energy distribution of a
ten as x 1 ≺ x 2 ) if and only if the following two condi- path, where node D is assumed to have enough energy to
tions hold: (1) f i (x 1 ) ≤ f i (x 2 ), ∀i ∈ {1, 2, . . . , q}; (2) meet the needs of the application. The delay of path P is
f i (x 1 ) < f i (x 2 ), ∃i ∈ {1, 2, . . . , q}, where f i (·) denotes the summation of the delay of each link on P, the reliability
the ith objective function, and q is the number of the objec- of path P is the product of the reliability of each link on P,
tive functions. and the energy of path P is the summation of the residual
energy of each node on P. The routing problem of WSN is
first defined based on the optimization of the delay, reliabil-
Definition 7 (Zitzler and Thiele 1999) Let x ∗ be a feasible ity and energy of path P in this section, because the latency
solution of a minimization problem of multi-objective opti- jitter, communication interference and balanced energy dis-
mization. x ∗ is a Pareto optimal solution if the following tribution are related to the delay, reliability and energy of a
condition holds: there is no feasible solution x that satisfies path respectively, and the description of them is more compli-
x ≺ x∗. cated. Let G, W and H be the delay, reliability and hop count
constraints of path P respectively, |P| be the hop count of
Definition 8 (Zitzler and Thiele 1999) A Pareto optimal path P, min and max are the maximal value and minimum
solution set is defined as the set of all Pareto optimal solu- value functions respectively, so the routing problem of WSN
tions. is formulated as follows

123
Author's personal copy
FRMOO based routing for WSNs 985
⎧ 

⎪ min xi j ξi j respectively. Therefore, a routing model for WSNs based on

⎪ (i, j)∈P

⎪ FRMOO is formulated, which is a strict mathematical model,



⎪ max xi j ηi j extending delay to latency jitter, reliability to communica-

⎪ (i, j)∈P

⎪  tion interference and energy to balanced energy distribution.



⎪ max xi γi The details of the FRMOO routing model are described as




i∈P−{D}


follows:
⎪ s.t.


⎪ To begin with, the objective functions of the delay and



⎪ latency jitter are considered, that is, links are chosen to form
⎪ xi j ∈ {0, 1}, xi ∈ {0, 1}


⎨  a path P from the source node S to the destination node D,
 of which the delay and latency jitter are minimal. Then, the
xi j − xki ∈ {1, 0, −1} (2)

⎪ objective function of the delay of path P is formulated as


j∈N N

k∈P N




⎪ xi j ξi j < G, xi j ηi j > W, |P| < H ⎡ ⎤

⎪ (i, j)∈P (i, j)∈P

⎪ 

⎪ min f 1 (x, ξ ) = E ⎣ xi j ξi j ⎦

⎪ di j− ≤ ξi j ≤ di j+ , ri j− ≤ ηi j ≤ ri j+ , ei− ≤ γi ≤ ei+ (3)




(i, j)∈P



⎪ di j− ≥ 0, di j+ ≥ 0



⎪ where x is the vector of the decision variable xi j correspond-

⎪ 0 ≤ ri j− ≤ 1, 0 ≤ ri j+ ≤ 1

⎪ ing to the ordered link (i, j) on path P, and ξ is the vector



⎩ of the delay ξi j corresponding to the ordered link (i, j) on
ei− ≥ 0, ei+ ≥ 0 path P.
The variance of the delay on path P represents the devia-
The above intuitive optimization model of WSN routing is tion from the expected value of the delay of the chosen path,
not strict as a mathematical programming model, and needs to so we adopt the standard deviation of fuzzy random variable
further explain its explicit meaning, because both the objec- to depict the jitter of path P. The smaller the standard devia-
tive functions and the constraints include fuzzy random vari- tion of the delay, the smaller the jitter. Let sqrt be the square
ables. root function, then the objective function of the latency jitter
of path P is represented as
⎛ ⎡ ⎤⎞

3 FRMOO routing model min f 2 (x, ξ ) = sqr t ⎝V ⎣ xi j ξi j ⎦⎠ (4)
(i, j)∈P

3.1 Fuzzy random expected value and standard deviation


based routing model The delay ξi j of link (i, j) should satisfy the following
constraint
Introducing fuzzy random multi-objective optimal theory to
depict the routing problem of WSN can better reflect the real di j− ≤ E[ξi j ] ≤ di j+ (5)
case of WSN routing, and has the important theoretical sig-
nificance and real application value. According to Definition Next, the objective functions of the reliability and commu-
4 and Definition 5, both the expected value and variance of a nication interference are considered, that is, links are chosen
fuzzy random variable are scalar. From the perspective of sta- to form a path P from the source node S and the destination
tistics, the former reflects the average value of a fuzzy random node D, of which the reliability is maximal while the com-
variable, while the latter reflects the degree measure of devi- munication interference is minimal. To keep consistent with
ating from the expected value. We argue that the delay and the minimal objective function, the objective function of the
reliability of a wireless link and the residual energy of a node reliability of path P is formulated as
are depicted by fuzzy random variables, namely, the expected
⎡ ⎤
value and standard deviation of the summation of links’ delay 
represent the delay and latency jitter (change of delay) on a min f 3 (x, η) = (−1) · E ⎣ xi j ηi j ⎦ (6)
path respectively, the expected value and standard deviation (i, j)∈P
of the product of links’ reliability represent the reliability and
communication interference (change of reliability) on a path where η is the vector of the reliability ηi j corresponding to
respectively, and the expected value and standard deviation of the ordered link (i, j) on path P.
the summation of nodes’ residual energy represent the energy The variance of the reliability on path P represents the
and balanced energy distribution (change of energy) on a path deviation from the expected value of the reliability of the

123
Author's personal copy
986 J. Lu et al.


chosen path, so we adopt the standard deviation of fuzzy ⎪
⎪ min( f 1 , f 2 , f 3 , f 4 , f 5 , f 6 )


random variable to depict the communication interference of ⎪


⎪ s.t.
path P. The smaller the standard deviation of the reliability, ⎪
⎪  


the smaller the communication interference. Thus, the objec- ⎪
⎪ 

⎪ f1 = E xi j ξi j
tive function of the communication interference of path P is ⎪


⎪ (i, j)∈P
represented as ⎪
⎪   

⎪ 

⎪ f 2 = sqr t V xi j ξi j
⎛ ⎡ ⎤⎞ ⎪


⎪ (i, j)∈P
 ⎪
⎪  
min f 4 (x, η) = sqr t ⎝V ⎣ xi j ηi j ⎦⎠ ⎪

(7) ⎪


⎪ f 3 = (−1) · E xi j ηi j
(i, j)∈P ⎪


⎪  
(i, j)∈P



The reliability ηi j of link (i, j) should satisfy the following ⎪


⎪ f 4 = sqr t V xi j ηi j


constraint ⎪
⎪ (i, j)∈P

⎪  

⎪ 


ri j− ≤ E[ηi j ] ≤ ri j+ (8) ⎪
⎪ f = (−1) · E xi γi
⎨ 5 i∈P−{D}
   (12)
Finally, the objective functions of the energy and balanced ⎪
⎪ 

⎪ f 6 = sqr t V xi γi
energy distribution are discussed, that is, links are chosen to ⎪


⎪ i∈P−{D}
form a path P from the source node S and the destination ⎪


⎪ di j− ≤ E[ξi j ] ≤ di j+


node D, of which the energy is maximal and the distribution ⎪


⎪ ri j− ≤ E[ηi j ] ≤ ri j+
of nodes’s residual energy is the most balanced. To prolong ⎪



the lifetime of WSN and simultaneously keep consistent with ⎪
⎪ ei− ≤ E[γi ] ≤ ei+


the minimal objective function, the objective function of the ⎪


⎪ f 1 < G, f 3 < (−1) · W, |P| < H
energy of path P is formulated as ⎪



⎡ ⎤ ⎪
⎪ di j− ≥ 0, di j+ ≥ 0


 ⎪



⎪ 0 ≤ ri j− ≤ 1, 0 ≤ ri j+ ≤ 1
min f 5 (x , γ ) = (−1) · E ⎣ xi γi ⎦ (9) ⎪



i∈P−{D} ⎪
⎪ ei− ≥ 0, ei+ ≥ 0





⎪ xi j ∈ {0, 1}, xi ∈ {0, 1}



where x is the vector of the decision variable xi correspond- ⎪
⎪  
ing to the ordered node i ∈ P − {D}, and γ is the vector ⎪
⎪ xi j − xki ∈ {1, 0, −1}

of the residual energy γi corresponding to the ordered node j∈N N k∈P N

i ∈ P − {D}.
The variance of the energy on path P represents the devi-
3.2 Computation of expected value and standard deviation
ation from the expected value of the reliability of the cho-
sen path, so we adopt the standard deviation of fuzzy ran-
The uncertainties of the FRMOO routing model can be
dom variable to depict the balanced energy distribution. The
removed by introducing the scalar expected value and vari-
smaller the standard deviation of the energy, the more bal-
ance of fuzzy random variable. Therefore, the key to solving
anced the energy distribution. Hence, the objective function
the FRMOO model is how to calculate the expected value
of the balanced energy distribution of path P is represented
and standard deviation of the objective functions and con-
as
straints including fuzzy random variables. Hao et al. (2008)
⎛ ⎡ ⎤⎞ discussed the calculation of the variance of a triangular fuzzy


min f 6 (x , γ ) = sqr t ⎝V ⎣ xi γi ⎦⎠ (10) random variable; however, the case of single fuzzy random
i∈P−{D} variable is not suitable for the above model. The basic ideas
of computing the expected value and standard deviation in
The residual energy γi of node i should satisfy the follow- the FRMOO routing model are the following:
ing constraint
1. Both formula (3) corresponding to the delay of a path and
ei− ≤ E[γi ] ≤ ei+ (11) formula (9) corresponding to the energy of a path are the
expected values of the summation of multiple fuzzy ran-
For simplicity, the following functions omit the argu- dom variables respectively. When the delay of a link and
ments, thus, the FRMOO routing model is formulated as the residual energy of a node are triangular fuzzy random

123
Author's personal copy
FRMOO based routing for WSNs 987

variables, formula (3) and formula (9) can directly get the E[ξi j ] = (2 · (ti j− + ti j+ ) − ai j + bi j )/4 (16)
results after simply transformed according to Definition
From the property theorem of the expected value of fuzzy
4 and the property theorem of fuzzy random variable.
random variable, the delay f 1 (x, ξ ) on path P is transformed
2. Formula (6) corresponding to the reliability of a path
as
is the expected value of the product of multiple fuzzy 
random variables, which can not directly be solved, so the f 1 (x, ξ ) = xi j E[ξi j ] (17)
expected value of the fuzzy random function is computed (i, j)∈P
by means of the method of fuzzy random simulation.
Substituting formula (16) into formula (17), the delay on
3. Both formula (4) corresponding to the latency jitter of
path P is
a path and formula (10) corresponding to the balanced 
energy distribution of a path are the standard deviations f 1 (x, ξ ) = xi j (2 · (ti j− + ti j+ ) − ai j + bi j )/4 (18)
of the summation of multiple fuzzy random variables (i, j)∈P
respectively, and formula (7) corresponding to the com-
The latency jitter is described by the standard deviation of
munication interference of a path is the standard deviation
the delay on path P, and from Definition 5, the latency jitter
of the product of multiple fuzzy random variables, which
f 2 (x, ξ ) is represented as
are evidently more difficult to calculate. According to ⎛ ⎡ ⎤2 ⎞
Definition 5, the variance of a fuzzy random variable is
⎜  ⎟
the expected value of the fuzzy random function, thus, it f 2 (x, ξ ) = sqr t ⎝ E ⎣ xi j ξi j − f 1 (x, ξ )⎦ ⎠ (19)
can be calculated by fuzzy random simulation similar to (i, j)∈P
formula (6).
4. Formula (5) corresponding to the link delay constraint, For convenience of the following description, a fuzzy ran-
formula (8) corresponding to the link reliability con- dom function h 1 (x, ξ ) is introduced, denoted by
straint and formula (11) corresponding to the nodes’s ⎛ ⎞2
residual energy constraint are the expected values of a 
h 1 (x, ξ ) = ⎝ xi j ξi j − f 1 (x, ξ )⎠ (20)
fuzzy random variable respectively. When the link delay,
(i, j)∈P
link reliability and nodes’ residual energy are triangu-
lar fuzzy random variables, formula (5), formula (8) and Substituting formula (20) into the right-hand side of for-
formula (11) can be directly computed according to Def- mula (19), formula (19) is rewritten as
inition 4. f 2 (x, ξ ) = sqr t (E[h 1 (x, ξ )]) (21)

The computation details of the expected value and standard Fuzzy random simulation is the combination of random
deviation in the FRMOO routing model are discussed in the simulation and fuzzy simulation, and computing the expected
following. Assume that the link delay ξi j is a fuzzy ran- value of a fuzzy function through fuzzy simulation has been
dom variable, which is defined as follows: for ∀ω ∈ , discussed (Liu and Liu 2002). The fuzzy random simulation
ξi j (ω) is a triangular fuzzy variable, denoted by ξi j (ω) = algorithm of the latency jitter f 2 (x, ξ ) is described as follows.
(ρi j (ω) − ai j , ρi j (ω), ρi j (ω) + bi j ), where uniform random
Algorithm 1. Fuzzy random simulation of the latency jitter
variable ρi j ∼ U(ti j− , ti j+ ), ti j− and ti j+ are the lower and
of path P.
upper bounds of the uniform distribution interval respec-
tively, ai j , bi j , ti j− and ti j+ are nonnegative real numbers. Input: path P, expected value f 1 (x, ξ ) of the delay on P,
From Definition 4, we know that the expected value E[ξi j ] fuzzy random function h 1 (x, ξ ) to compute the variance of
of ξi j is the mathematical expectation of the expected value the delay on P;
E[ξi j (ω)] of fuzzy variable ξi j (ω), where E[ξi j (ω)] is a ran- Output: latency jitter f 2 (x, ξ ) of path P.
dom variable. According to Definition 2, for ω ∈ , we have
1. Initially set the simulation summation of the expected
E[ξi j (ω)] = (4 · ρi j (ω) − ai j + bi j )/4 (13)
value X as 0;
According to Definition 4 and formula (13), we obtain 2. If the simulation count exceeds the maximal simulation
time, then go to step 8; otherwise, go to step 3;
E[ξi j ] = (4 · E(ρi j ) − ai j + bi j )/4 (14)
3. Set sample ω as 0, and link (i, j) as the first link on path
Given random variable ρi j ∼ U(ti j− , ti j+ ), its expected P;
value is 4. If link (i, j) is the last link on path P, then go to step 7;
otherwise, go to step 5;
E(ρi j ) = (ti j− + ti j+ )/2 (15)
5. Given ρi j ∼ U(ti j− , ti j+ ) in the definition of ξi j , then
Substituting formula (15) into formula (14), we have randomly extract sample ωi j from the sample space ;

123
Author's personal copy
988 J. Lu et al.

6. ω ← ω + ωi j , and go to step 4; 6. ω ← ω × ωi j , and go to step 4;


7. X ← X + E[h 1 (x, ξ (ω))], where E[h 1 (x, ξ (ω))] is 7. Y ← Y + E[h 2 (x, η(ω))], where E[h 2 (x, η(ω))] is
obtained by using fuzzy simulation, then go to step 2; obtained by using fuzzy simulation, then go to step 2;
8. f 2 (x, ξ ) ← sqr t (X/N ), and return f 2 (x, ξ ). 8. f 3 (x, η) ← (−1) · Y/N , and return f 3 (x, η).

Step 2 to step 7 in Algorithm 1 constitute a loop with Step 2 to step 7 in Algorithm 2 also constitute a loop
the count N. Let the sample number and simulation count in with the count N including fuzzy simulation, so the time
fuzzy simulation of step 7 be K and M respectively, then the complexity of Algorithm 2 is the same as that of Algorithm 1.
time complexity of step 7 is O(K · M). Therefore, the time The communication interference f 4 (x, η) can be com-
complexity of Algorithm 1 is O(N · K · M). puted by the method similar to that computing the latency
Substituting formula (16) into formula (5), the link delay jitter f 2 (x, ξ ). Similar to ξi j , we deduce
constraint is transformed as
E[ηi j ] = (2 · (si j− + si j+ ) − ci j + li j )/4 (25)
4 · di j− ≤ 2 · (ti j− + ti j+ ) − ai j + bi j ≤ 4 · di j+ (22)
Substituting formula (25) into formula (8), the link relia-
Since the computation of other objective functions is sim- bility constraint is transformed as
ilar to that of the delay and latency jitter, only the conclu-
sions and different algorithms are given, and similar deduc- 4 · ri j− ≤ 2 · (si j− + si j+ ) − ci j + li j ≤ 4 · ri j+ (26)
ing processes are not described repetitively. Energy of nodes is mainly consumed in transmitting and
Similar to the link delay ξi j , the link reliability ηi j is receiving data, so the residual energy γi of node i is defined
defined as follows: for ∀ω ∈ , ηi j (ω) is a triangular fuzzy as
variable, denoted by ηi j (ω) = (δi j (ω)−ci j , δi j (ω), δi j (ω)+
li j ), where uniform random variable δi j ∼ U(si j− , si j+ ), si j− γi = i − k · (w · α + β · (di j )λ ) (27)
and si j+ are the lower and upper bounds of the uniform dis-
where i is a fuzzy random variable reflecting the initial
tribution interval respectively, ci j , li j are nonnegative real
energy change of node i due to the affection of the envi-
numbers and 0 ≤ si j− ≤ 1, 0 ≤ si j+ ≤ 1. To compute
ronment factor and natural loss, which is defined as follows:
the path reliability through fuzzy random simulation, fuzzy
for ∀ω ∈ , i (ω) is a triangular fuzzy variable, denoted
random function h 2 (x, η) is introduced, denoted by
 by i (ω) = (τi (ω) − m i , τi (ω), τi (ω) + n i ), where uniform
h 2 (x, η) = xi j ηi j (23) random variable τi ∼ U(ri− , ri+ ), ri− and ri+ are the lower
(i, j)∈P and upper bounds of the uniform distribution interval respec-
Substituting formula (23) into formula (6), the reliability tively, ri− , ri+ , m i and n i are nonnegative real numbers. k
f 3 (x, η) is transformed as is the data amount counted by bit transmitted or received by
node i; if node i is the source node, then w = 1, denoting
f 3 (x, η) = (−1) · E[h 2 (x, η)] (24) that the source node only considers the energy consump-
tion of transmitting data, otherwise, w = 2, denoting that
The fuzzy random simulation algorithm of the reliability
the intermediate node considers the energy consumption of
f 3 (x, η) is described as follows.
both transmitting and receiving data; α is the energy deple-
Algorithm 2. Fuzzy random simulation of the reliability of tion per bit data sent by the transmitting device or received
path P. by the receipt; β is the energy depletion that the transmit-
Input: path P, fuzzy random function h 2 (x, η) to compute ting amplifier sends per bit data to per square meters; di j
the reliability of P; is the Euclid distance of link (i, j); λ is the fading coef-
Output: reliability f 3 (x, η) of path P. ficient of signal propagation, and 2 ≤ λ ≤ 5. It can be
known from formula (27) that γi is a fuzzy random variable,
namely, for ∀ω ∈ , γi (ω) is a triangular fuzzy variable,
1. Initially set the simulation summation of the expected
denoted by γi (ω) = (νi (ω) − m i , νi (ω), νi (ω) + n i ), where
value Y as 0;
uniform random variable νi ∼ U(ri− − k · (w · α + β · (di j )λ ),
2. If the simulation count exceeds the maximal simulation
ri+ − k · (w · α + β · (di j )λ )). Also similar to ξi j , we deduce
time, then go to step 8; otherwise, go to step 3;
3. Set sample ω as 1, and link (i, j) as the first link on path E[γi ] = (2 · (ri− + ri+ − 2 · k · (w · α + β · (di j )λ ))
P;
−m i + n i )/4 (28)
4. If link (i, j) is the last link on path P, then go to step 7;
otherwise, go to step 5; Similar to the delay f 1 (x, ξ ), and k is 0 during the route

5. Given δi j ∼ U(si j− , si j+ ) in the definition of ηi j , then selection, hence, the energy f 5 (x , γ ) of path P is deduced
randomly extract sample ωi j from the sample space ; as

123
Author's personal copy
FRMOO based routing for WSNs 989



f 5 (x , γ ) = xi (m i − n i − 2 · (ri− + ri+ ))/4 (29) In the FRMOO routing algorithm, the selection operator
i∈P−{D} uses the roulette, meanwhile, which keeps the optimal indi-

vidual in each generation; the crossover operator uses the
The balanced energy distribution f 6 (x , γ ) can be com-
single point crossover, that is, in two individuals of parent
puted similar to the latency jitter f 2 (x, ξ ). Substituting for-
generation with the common node, the first common node
mula (28) into formula (11) when k is 0, then the node’s
is selected as the crossing point, and all the nodes after the
residual energy constraint is transformed as
crossing point are exchanged; the mutation operator uses the
4 · ei− ≤ 2 · (ri− + ri+ ) − m i + n i ≤ 4 · ei+ (30) single point mutation at a random location, that is, the muta-
tion point is generated randomly in the individual of parent
generation, and replaced by a new node between the precur-
4 FRMOO routing algorithm sor and the successor at the mutation point. Due to the Pareto
sorting, the FRMOO algorithm can get the Pareto optimal
In order to efficiently solve the FRMOO routing model, solution set when executed once, i.e. the multiple optimal
we adopt the hybrid FRMOO routing algorithm embedding paths, which has the advantage of the parallelism of genetic
fuzzy random simulation into the genetic algorithm based algorithm, improves the speed of routing and enhances the
on Pareto sorting. Since a random sequence of node ID in flexibility of routing.
a WSN may correspond to an invalid path, the path chro- The traditional methods are hard to solve the FRMOO
mosomes in the FRMOO algorithm are coded based on the model including fuzzy random variables. In this paper, we
priority-encoding scheme (Gen et al. 1997; Mohemmed et embed fuzzy random simulation into genetic algorithm, and
al. 2008; Wen and Lin 2010), that is, the priorities of nodes complete the computation of the objective functions such as
replacing the node IDs appear in the path chromosomes. The the reliability, the latency jitter, the communication interfer-
computation of the objective functions must be based on the ence and the balanced energy distribution. The algorithms
valid path constituted by nodes, so the premise of compu- based on fuzzy random simulation are described in Sec-
tation is decoding the chromosomes encoded with the pri- tion 3.2. When a fuzzy random variable degenerates to a
orities. The following is the decoding algorithm of the path random variable, the FRMOO algorithm is converted to the
chromosomes. RMOO (Random Multi-Objective Optimization) algorithm
Algorithm 3. Decoding algorithm of the path chromosomes that adopts random simulation, which is typical in the sim-
encoded with the priorities of nodes. ulation of random variables. When a fuzzy random variable
Input: path chromosome Chrom encoded with the priorities, degenerates to a fuzzy variable, the FRMOO algorithm is
adjacent matrix T, the source node S and the destination node converted to the FMOO algorithm that adopts fuzzy simula-
D; tion, which is used in the simulation of fuzzy variables. The
following is the FRMOO hybrid routing algorithm.
Output: a valid path P formed by node IDs.
Algorithm 4. FRMOO hybrid routing algorithm.
1. Initially set the node index y of path P as 1, the current
node I as the source node S, P[y] as I representing that Input: adjacent matrix, link delay, link reliability, residual
path P starts from S; energy of nodes;
2. If y is larger than the hop count constraint H, then go to Output: a set of multiple paths based on Pareto optimality.
step 5; otherwise, if P[y] is the destination node D, then
go to step 5;otherwise, go to step 3;
1. Initialize the genetic parameters and the end-to-end con-
3. Find the neighboring node set NB of I according to the
straints;
adjacent matrix T ;
2. Generate the path chromosomes based on the priority-
4. If NB is not empty, then find the neighboring node with the
encoding scheme, and form the initial optimal path pop-
highest priority in the path chromosome Chrom as new
ulation;
I, y ← y + 1, set P[y] as I, and go to step 2; otherwise,
3. If the simulation count exceeds the maximal iteration
go to step 5;
time, then go to step 10; otherwise, go to step 4;
5. If P[y] is D, then return P; otherwise, return an invalid
4. Call Algorithm 3, and decode the path chromosomes into
path.
the valid paths;
Step 2 to step 5 in Algorithm 3 constitute a loop, and Step 5. Compute the delay and energy of a path according to for-
4 of finding the neighboring node with the highest priority mula (18) and formula (29) respectively; call Algorithm 1
also needs a loop. Let the largest neighbor number of a node and Algorithm 2, and compute the reliability, the latency
in path P be Q, then the worst time complexity of Algorithm jitter, the communication interference and the balanced
3 is O(H · Q). energy distribution through fuzzy random simulation;

123
Author's personal copy
990 J. Lu et al.

Table 1 Objective values of the


optimal paths Optimal path Delay Jitter Reliability Interference Energy Energy balance

1, 2, 57, 88, 97, 20, 100 71.5840 6.6702 0.6675 0.0622 14.8003 1.4403
1, 19, 85, 6, 12, 100 64.5444 10.0188 0.6654 0.0651 12.7571 1.3229
1, 21, 34, 73, 94, 100 58.6465 6.9956 0.6904 0.0723 11.9210 1.0591
1, 22, 72, 14, 8, 100 59.8095 7.5468 0.6903 0.0697 11.9022 1.0915
1, 26, 31, 54, 44, 100 65.2961 8.9377 0.6674 0.0637 12.7187 1.2870
1, 71, 3, 42, 80, 76, 100 74.2945 8.4734 0.6415 0.0564 15.4108 1.5985

20
6. The optimal paths are achieved based on Pareto sorting,
D70R07
and then add those who satisfy the constraints into the D80R06

Average number of optimal path


optimal path set; D100R05
7. Compute the fitness of all the optimal paths, and the new 15

path population is formed based on the roulette operator;


8. Apply the single point crossover operator to the new path
population; 10
9. Apply the single point mutation operator to the new path
population, then go to step 3;
10. Return the optimal path set. 5

Step 3 to step 9 in Algorithm 4 constitute a loop, the time


complexity of which depends on the iteration count C and
0
the population size L. The time complexity in each iteration 20 25 30 35 40
mainly relies on that of fuzzy random simulation of step 5 and Transmission radius (m)
Pareto sorting of step 6. Based on Algorithm 1 and Algorithm
2, the former is O(L · N · K · M); Let Z be the number of Fig. 2 Average optimal path number comparison on the three con-
multiple objectives, then the latter is O(Z · L 2 ). Therefore, the straints under the different transmission radiuses
worst time complexity in each iteration is max(O(L · N · K · 800
M), O(Z ·L 2 )). Thus, the worst time complexity of Algorithm RMOO
4 is C · max(L · N · K · M, O(Z · L 2 )). 700 FRMOO
Average number of total packets

600

5 Simulation and analysis


500

To verify the effectiveness of the FRMOO routing algorithm, 400


we use the Matlab and C program language to simulate. Place
100 nodes randomly in a region with 100 m × 100 m, and S 300
and D are located in the left lower and right upper corners,
respectively. The maximum hop count is 10, and the results 200

are the average experimental values of 5 times. Transmis-


sion radius is from 20 to 40 m with 5 m intervals. ρi j varies 100
20 25 30 35 40
in closed interval [10, t], where t gets its value in [10, 20], Transmission radius (m)
and both ai j and bi j in [0,5], whose unit is ms. δi j varies
in [s,0.95], where s in [0.9, 0.95], ci j in [0, 0.1] and li j in Fig. 3 WSN lifetime comparison on the two algorithms under the dif-
ferent transmission radiuses
[0, 0.05]. νi varies in [2, r], where r in [2, 4], and both
m i and n i in [0, 0.5], whose unit is J. α is 50 nJ/bit, β is
100 pJ/bit/m3 , and λ is 3. The population size is 20, and the spreads ai j , ci j and m i are 0, the right spreads bi j , li j and n i
times of genetic iteration and fuzzy random simulation are are 5, 0.05 and 0.5 respectively, furthermore, FRMOO:case1
50 and 100 respectively. For convenience of the following is transformed into the FMOO algorithm when ρi j , δi j and
description, FRMOO:case1 denotes the case that ρi j , δi j and νi are regarded as constants; FRMOO:case2 denotes the case
νi randomly vary in its own distribution interval, and the left that t in ρi j , s in δi j and r in νi are 20, 0.95 and 4 respectively,

123
Author's personal copy
FRMOO based routing for WSNs 991

150 50
(a) RMOO (b) RMOO
FRMOO:case1 FRMOO:case1
FRMOO:case2 FRMOO:case2
40
Average delay (s)
100

Average jitter (s)


30

20
50

10

0 0
20 25 30 35 40 20 25 30 35 40
Transmission radius (m) Transmission radius (m)

(c) 1 (d) 0.1


RMOO
FRMOO:case1
FRMOO:case2
0.8 0.08

Average interference
Average reliability

0.6 0.06

0.4 0.04

0.2 RMOO 0.02


FRMOO:case1
FRMOO:case2
0 0
20 25 30 35 40 20 25 30 35 40
Transmission radius (m) Transmission radius (m)

(e) 50 (f) 5
RMOO RMOO
FRMOO:case1 FRMOO:case1
Average energy balance (J)

FRMOO:case2 FRMOO:case2
40 4
Average energy (J)

30 3

20 2

10 1

0 0
20 25 30 35 40 20 25 30 35 40
Transmission radius (m) Transmission radius (m)

Fig. 4 Average optimal objective value comparison on the three algorithms under the different transmission radiuses (m): a delay, b latency jitter,
c reliability, d interference, e energy, d energy balance

and the left spreads ai j , ci j and m i are 0, the right spreads of the transmission radius 30 m and meets the constraints of
bi j , li j and n i are 5, 0.05 and 0.5 respectively. When both the the delay below 80 ms and the reliability above 0.6.
left and right spreads of ξi j , ηi j and γi are 0, the FRMOO Figure 2 displays the average number of the optimal path
algorithm is converted to the RMOO algorithm. that the FRMOO algorithm finds in different constraints of
Table 1 gives the objective values of the six optimal paths, delay and reliability. For example, the case of the delay con-
which the FRMOO algorithm has discovered in the topology straint 70 ms and the reliability constraint 0.7 is denoted as

123
Author's personal copy
992 J. Lu et al.

Table 2 t-Test: paired two sample for means Table 4 t-Test: paired two sample for means
RMOO FRMOO:case1 FRMOO:case1 FRMOO:case2

Mean 71.94246 79.22621 Mean 79.22621 93.93854


Variance 305.0007 374.2312 Variance 374.2312 529.3802
Observations 5 5 Observations 5 5
Pearson correlation 0.999982 Pearson correlation 0.999707
Hypothesized mean difference 0 Hypothesized mean difference 0
df 4 df 4
t Stat −8.64511 t Stat −8.8946
P(T≤t) one-tail 0.000492 P(T≤t) one-tail 0.000441
t Critical one-tail 2.131847 t Critical one-tail 2.131847
P(T≤t) two-tail 0.000985 P(T≤t) two-tail 0.000883
t Critical two-tail 2.776445 t Critical two-tail 2.776445

D70R07, and so on. We can see from Fig. 2 that the average selective optimal paths increase gradually and the hop count
numbers of the optimal path in three cases increase gradually of more paths decreases. Therefore, we can see from Fig. 4
with the increase of the transmission radius. The constraint that for the optimal paths, with the increase of the transmis-
requirement of the case D100R05 is the lowest, so the average sion radius, the delay, latency jitter, communication interfer-
number of the optimal path found is the largest. ence and energy decrease respectively, while the reliability
Figure 3 presents the comparison of the average total sent increases, and the energy distribution is balanced. In addition,
data packets of the FRMOO algorithm (FRMOO:case2) and we show the advantages of the FRMOO algorithm consid-
the RMOO algorithm without considering the retransmission ering both randomness and fuzziness by comparing it with
of data packets. When the transmitting rate is constant, the the RMOO or FMOO algorithms only considering random-
total sent data packets can depict the lifetime of WSN. We ness or fuzziness respectively in Fig. 4. In fact, the RMOO
transmit simultaneously data packets in the discovered mul- and FMOO algorithms are the special cases of the FRMOO
tiple optimal paths. If the residual energy of certain node on algorithm, that is, when both left and right spreads of fuzzy
any path is below the lowest threshold that a node requires, the random variables are zeros, the FRMOO algorithm degen-
transmissions on all paths will stop, meaning that the lifetime erates to the RMOO algorithm, and when random variables
of WSN is over. It can be seen from Fig. 3 that the FRMOO in the definitions of fuzzy random variables are constants,
algorithm can transmit more data packets and achieve longer the FRMOO algorithm degenerates to the FMOO algorithm.
network lifetime comparing with the RMOO algorithm. The Correspondingly, the similar case of optimal objective val-
main reason is that the FRMOO algorithm considers both ues should be expected. In Fig. 4, On the one hand, when
fuzziness and randomness in the route selection. the results of the RMOO algorithm are regarded as the low
Figure 4 indicates the trends of the average objective bounds of the ones of the FRMOO algorithm, we can see
values, including the delay, the latency jitter, the reliabil- that the FRMOO algorithm can depict wider ranges of delay,
ity, the communication interference, the energy and the jitter, reliability, interference, energy and energy balance,
balanced energy distribution, of the optimal paths that the namely, the results of it includes the ones of the RMOO algo-
FRMOO algorithm (FRMOO:case1 and FRMOO:case2) and rithm. On the other hand, when the fuzzy parameters in fuzzy
the RMOO algorithm have discovered in the topologies with random variables of FRMOO:case1 and FRMOO:case2 are
different transmission radiuses under the delay constraint the same, due to wider interval of random change in the
140 ms and the reliability constraint 0.6. With the increase definitions of fuzzy random variables, FRMOO:case2 can
of the transmission radius under the same constraints, the achieve wider ranges of objective values comparing with

Table 3 Two factor ANOVA


with replication (RMOO vs. Source of variation SS df MS F P-value F crit
FRMOO:case1)
Sample 816.8856 1 816.8856 49.20309 1.79E−08 4.084746
Columns 14,953.47 4 3,738.368 225.1714 7.53E−27 2.605975
Interaction 97.57244 4 24.39311 1.469259 0.229613 2.605975
Within 664.0928 40 16.60232
Total 16,532.02 49

123
Author's personal copy
FRMOO based routing for WSNs 993

Table 5 Two factor ANOVA


with replication (FRMOO:case1 Source of variation SS df MS F P-value F crit
vs. FRMOO:case2)
Sample 2,568.831 1 2,568.831 134.4468 2.29E−14 4.084746
Columns 20,779.6 4 5,194.899 271.8893 2.02E−28 2.605975
Interaction 147.964 4 36.99099 1.936025 0.123192 2.605975
Within 764.2669 40 19.10667
Total 24,260.66 49

FRMOO:case1. Specially, if we regard the random inter- ability, communication interference, energy and balanced
vals as suppositional constant in the definition of fuzzy ran- energy distribution, and propose a routing model based on
dom variables in FRMOO:case1, the random intervals in the FRMOO for WSNs. Fuzzy random simulation is embedded
definition of fuzzy random variables in FRMOO:case2 are into genetic algorithm to compute the optimal objective val-
shortened accordingly. Hence, FRMOO:case1 degrades to ues, and the corresponding hybrid FRMOO routing algo-
the FMOO algorithm, and when it is taken as the low bound, rithm is designed. Simulation results verify the effectiveness
we can say that FRMOO:case2 also attains wider objective of the FRMOO algorithm, that is, multiple paths are discov-
values comparing with the FMOO algorithm. In short, the ered when it is executed once, and with the increase of the
FRMOO algorithm can better depict link quality and nodes’ transmission radius, the average number of the optimal path
residual energy by adjusting the fuzzy parameters and the increases under the different constraints and it has a longer
random ones of fuzzy random variables, hence, it meets the lifetime comparing with the RMOO algorithm. Simulation
needs of different scenes. also indicates that the FRMOO algorithm can achieve the
We focus on the advantages of the proposed FRMOO algo- wider objective values of the optimal path comparing with
rithm by comparing it with the algorithms considering only the RMOO and FMOO algorithms under the different trans-
randomness or fuzziness. Therefore, aiming to the objec- mission radiuses. In short, the FRMOO algorithm can flexi-
tive values in Fig. 4 when the significance level is 0.05, bly describe the performances of the cluster head network in
the t-test and ANOVA (ANalysis Of VAriance) between the two-tiered WSNs by adjusting the fuzzy parameters and
RMOO and FRMOO:case1 are executed, and that between the random ones of fuzzy random variables. Thus, it meets
FRMOO:case1 and FRMOO:case2 are also done. The above the needs of different applications.
results of delay are listed in Tables 2, 3, 4 and 5, and oth- In the following works, aiming to the case that fuzzy ran-
ers are omitted due to the similarities to delay and lim- dom expected value model may become invalid, we will
ited space. Concerning the analyses between RMOO and research the routing models based on fuzzy random chance-
FRMOO:case1, the t-test in Table 2 indicates that RMOO constrained programming and fuzzy random dependent-
and FRMOO:case1 influence the delay significantly, and chance programming; on the other hand, focusing on the
the ANOVA in Table 3 also indicates the same conclu- limitation of genetic algorithm, we will research the solving
sion. Table 3 also shows that the transmission radiuses of methods based on local information and the decomposing
sensor nodes affect the delay significantly, which conforms theory. Hence, the theories and applications for WSNs are
to the fact. In addition, we can see from Table 3 that the expected to be improved and enriched.
interaction effect on the delay is not significant when tak-
ing into account the method and the transmission radius Acknowledgments The research is supported by the National Natural
Science Foundation of China under Grant Nos. 60970054, 61173094
simultaneously. As far as the t-test and ANOVA between and 61373083, the Scientific Research Foundation for the Returned
FRMOO:case1 and FRMOO:case2 are concerned, the same Overseas Chinese Scholars, State Education Ministry, and the Funda-
conclusions are obtained from Table 4 and Table 5. The sim- mental Research Funds for the Central Universities of China under
ilar conclusions occur in the other objective values, and the Grant No. GK201302024.
difference is the interaction effect on the different objective
values.
References

Al-Karaki JN, Ul-Mustafa R, Kamal AE (2009) Data aggregation and


6 Conclusions routing in wireless sensor networks: optimal and heuristic algo-
rithms. Comput Netw 53(7):945–960
We introduce fuzzy random variables to depict fuzziness and Bari A, Wazed S, Jaekel A, Bandyopadhyay S (2009) A genetic algo-
rithm based approach for energy efficient routing in two-tiered sensor
randomness of link delay, link reliability and nodes’ residual networks. Ad Hoc Netw 7(4):665–676
energy, simultaneously consider multi-objective optimiza- EkbataniFard GH, Monsefi R, Akbarzadeh-T MR, Yaghmaee MH
tion including the performances of delay, latency jitter, reli- (2010) A multi-objective genetic algorithm based approach for

123
Author's personal copy
994 J. Lu et al.

energy efficient Qos-routing in two-tiered wireless sensor networks. Minhas MR, Gopalakrishnan S, Leung VCM (2009) Multiobjective
In: Proceedings of the 5th IEEE international symposium on wireless routing for simultaneously optimizing system lifetime and source-
pervasive computing (ISWPC 2010). pp 80–85 to-sink delay in wireless sensor networks. In: Proceedings of the
Gen M, Cheng R, Wang D (1997) Genetic algorithms for solving short- 29th IEEE international conference on distributed computing sys-
est path problems. In: Proceedings of the IEEE international confer- tems workshops (ICDCSW ’09). pp 123–129
ence on evolutionary computation (ICEC’97). pp 401–406 Mohemmed AW, Sahoo NC, Geok TK (2008) Solving shortest path
Gogu A, Nace D, Dilo A, Meratnia N (2011) Optimization problems in problem using particle swarm optimization. Appl Soft Comput
wireless sensor networks. In: Proceedings of the international confer- 8(4):1643–1653
ence on complex intelligent and software intensive systems (CISIS Rubio-Largo A, Vega-Rodrguez MA, Gomez-Pulido JA, Sanchez-Perez
2011). pp 302–309 JM (2012) A multiobjective approach based on artificial bee colony
Gomez J, Gil C, Banos R, Marquez AL, Montoya FG, Montoya MG for the static routing and wavelength assignment problem. Soft Com-
(2012) A Pareto-based multi-objective evolutionary algorithm for put. doi:10.1007/s00500-012-0887-4
automatic rule generation in network intrusion detection systems. Sengupta S, Das S, Nasir M, Suganthan PN (2012) Risk minimization
Soft Comput. doi:10.1007/s00500-012-0890-9 in biometric sensor networks: an evolutionary multi-objective opti-
Hao FF, Liu YK, Wang S (2008) The variance formulas for triangular mization approach. Soft Comput. doi:10.1007/s00500-012-0906-5
fuzzy random variables. In: Proceedings of the international confer- Wang XM, Lu JL, Li YS, Hao KG (2011) Multiconstrained multipath
ence on machine learning and cybernetics. pp 612–617 routing for wireless sensor networks in the fuzzy random environ-
He S, Chen J, Xu W, Sun Y, Thulasiraman P, Shen X (2010) A stochastic ment. Chin J Comput 34(5):779–791 (in Chinese)
multiobjective optimization framework for wireless sensor networks. Wen F, Lin C (2010) Multiobjective route selection model and its soving
EURASIP J Wirel Commun Netw. doi:10.1155/2010/430615 method based on genetic algorithm. Int J Inf Syst Logist Manag
Liu B, Liu YK (2002) Expected value of fuzzy variables and fuzzy 5(2):1–8
expected value models. IEEE Trans Fuzzy Syst 10(4):445–450 Yuan B, Orlowska M, Sadiq S (2007) On the optimal robot routing
Liu YK, Liu B (2003a) A class of fuzzy random optimization: expected problem in wireless sensor networks. IEEE Trans Knowl Data Eng
value models. Inf Sci 155(1–2):89–102 19(9):1252–1261
Liu YK, Liu B (2003b) Fuzzy random variables: a scalar expected value Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a
operator. Fuzzy Optim Decis Mak 2(2):143–160 comparative case study and the strength Pareto approach. IEEE Trans
Lu J, Wang X (2012) Fuzzy random expected value model based multi- Evol Comput 3(4):257–271
objective optimization routing for wireless sensor networks. In: Pro-
ceedings of the 3rd international conference on quantitative logic
and soft computing (QLSC 2012). pp 215–222

123

View publication stats

Você também pode gostar