A Fuzzy Logic-Based Clustering Algorithm for WSN to

Extend the Network Lifetime

A seminar report submitted in partial fulfillment of

the requirements for degree of

Masters of Engineering

by

Aatray Kumar Singh

(Roll.No. 17)

DEPARTMENT OF ELECTRONICS ENGINEERING

MIT ACADEMY OF ENGINEERING, ALANDI (D), PUNE
2015-2016

MIT Academy of Engineering, Pune, Alandi (D)- 412105

CERTIFICATE

This is to certify that the seminar report entitled A Fuzzy

Logic-Based Clustering Algorithm for WSN to Extend the
Network Lifetime has been submitted in academic year 2015-2016
by

Aatray Kumar Singh

(Roll No.17)

under the supervision of Satyajit Pangaonkar in partial fulfillment of the requirement for the degree of Master of Engineering in Electronics / Electronics &
Telecommunication Engineering as prescribed by University of Pune.

ME Coordinator
S. Pangaonkar

Head of Department
Dr. M. Goudar

Acknowledgement
I take this opportunity to thank certain people without whom this endeavor would
not have been possible. I would also express my thanks to the head of Department
of Electronics engineering Dr.M.D.Goudar. I would like to express my sincere
gratitude to my Coordinator Prof.S.A.Pangaonkar for constant encouragement,
help and guidance without which this seminar would not have been completed &
for their consummate support and valuable advice throughout the progress of the
seminar. Last but not the least, I express my heartiest acknowledgement to my
parents, friends and colleagues who directly or indirectly helped me in completing
the seminar.

ii

Contents

Acknowledgements

ii

List of Figure

vi

Abstract

viii

1 WIRELESS SENSOR NETWORKS

1.1

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

1.2

Defination and Background . . . . . . . . . . . . . . . . . . . . . . .

1.2.1

Sensing and Sensors . . . . . . . . . . . . . . . . . . . . . . .

1.2.2

Wireless sensor networks . . . . . . . . . . . . . . . . . . . . .

1.2.3

Communication in a WSN . . . . . . . . . . . . . . . . . . . .

2 Fuzzy Reasoning and Cluster Head Algorithm

2.1

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

2.2

Approximate Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.1

Classical IF-THEN Rule . . . . . . . . . . . . . . . . . . . . . 12

iii

2.3

2.4

2.2.2

Fuzzy IF-THEN Rule . . . . . . . . . . . . . . . . . . . . . . . 12

2.2.3

Models for Approximations . . . . . . . . . . . . . . . . . . . 13

Proposed Clustering Approach . . . . . . . . . . . . . . . . . . . . . . 14

2.3.1

System Assumptions . . . . . . . . . . . . . . . . . . . . . . . 14

2.3.2

Handing Uncertainties Using Fuzzy Inference Systems . . . . . 14

2.3.3

Proposed LEACH-ERE Clustering Algorithm . . . . . . . . . 15

Model Identification and Stability of Fuzzy System . . . . . . . . . . 16

2.4.1

Fuzzy System Modeling . . . . . . . . . . . . . . . . . . . . . 16

2.4.2

Stability of Fuzzy Systems . . . . . . . . . . . . . . . . . . . . 18

3 Fuzzy Inference System and Energy Prediction

20

3.1

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20

3.2

Basic Structure of Fuzzy inference System . . . . . . . . . . . . . . . 22

3.3

Mamdani Fuzzy Models . . . . . . . . . . . . . . . . . . . . . . . . . 24

3.3.1

3.4

3.5

Other Variants . . . . . . . . . . . . . . . . . . . . . . . . . . 26

Other Consideration . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
3.4.1

Input Space Partitioning . . . . . . . . . . . . . . . . . . . . . 27

3.4.2

Fuzzy Modeling . . . . . . . . . . . . . . . . . . . . . . . . . . 29

Energy Prediction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3.5.1

LEACH Clustering Algorithm . . . . . . . . . . . . . . . . . . 30

3.5.2

Radio Energy Dissipation Model . . . . . . . . . . . . . . . . . 31

iv

3.5.3

Expected residual energy . . . . . . . . . . . . . . . . . . . . . 33

4 Conclusion and Future Scope

35

4.1

Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35

4.2

Future Scope . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36

References

36

List of Figures
1.1

Data acquisition and actuation. . . . . . . . . . . . . . . . . . . . . .

1.2

Wireless sensor networks. . . . . . . . . . . . . . . . . . . . . . . . . .

1.3

Single hop versus Multi hop communication in sensor networks. . . .

2.1

Temperature domain in three fuzzy sets. . . . . . . . . . . . . . . . . 11

2.2

Linguistic fuzzy sets. . . . . . . . . . . . . . . . . . . . . . . . . . . . 13

2.3

Fuzzy set for output variable chance. . . . . . . . . . . . . . . . . . . 16

2.4

Fuzzy mapping rules. . . . . . . . . . . . . . . . . . . . . . . . . . . . 17

3.1

Block diagram for a fuzzy inference system. . . . . . . . . . . . . . . 21

3.2

The Mamdani fuzzy inference system using min and max for T-norm
and T-conorm, respectively. . . . . . . . . . . . . . . . . . . . . . . . 24

3.3

The Mamdani Fuzzy inference system using min and max for T-norm
and T-conorm operators, respectively . . . . . . . . . . . . . . . . . . 25

3.4

Fuzzy inference viewer in the Fuzzy Logic Toolbox. . . . . . . . . . . 26

3.5

Various methods of partitioning the input space: (a) grid partition;

(b) tree partition; (c) scatter partition . . . . . . . . . . . . . . . . . 28

vi

3.6

Cluster formation and operation. . . . . . . . . . . . . . . . . . . . . 31

3.7

Proposed scheme of the probability reasoning during cluster head

selection. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32

3.8

Fuzzy set for input variable. (a) Residual energy. (b) Expected residual energy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34

vii

Abstract
Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited computation, communication, memory and energy resources that
are bring used for huge range of applications where the traditional infrastructure
based network is mostly infeasible. The sensor nodes are densely deployed in a
hostile environment to monitor, detect, and analyze the physical phenomenon and
consume considerable amount of energy while transmitting the information. It is
impractical and sometimes impossible to replace the battery and to maintain longer
network lifetime. So, there is a limitation on the lifetime of the battery power and
energy conservation is a challenging issues. Appropriate cluster head (CH) election
is one such issue, which can reduce the energy consumption dramatically. Low energy adaptive clustering hierarchy (LEACH) is the most famous hierarchical routing
protocol, where the CH is elected in rotation basis based on a probabilistic threshold
value and only CHs are allowed to send the information to the base base station
(BS). But in this approach, a super-CH (SCH) is elected among the CHs who can
only send the information to the mobile Bs by choosing suitable fuzzy descriptors,
such as remaining battery power, mobility of BS, and centrality of the clusters.
Fuzzy inference engine (Mamdanis rule) is used to elect the chance to be the SCH.
The results have been derived from NS-2 simulator and show that the proposed
protocol performs better than the LEACH protocol in terms of the first node dies,
half node alive, better stability, and better lifetime.

viii

Chapter 1
WIRELESS SENSOR
NETWORKS

1.1

Introduction

Sensors link the physical with the digital world by capturing and revealing realworld phenomena and converting these into a form that can be processed, stored,
and acted upon. Integrated into numerous devices, machines, and environments,
sensors provide a tremendous societal benefit. They can help to avoid catastrophic
infrastructure failures, conserve precious natural resources, increase productivity,
enhance security, and enable new applications such as context-aware systems and
smart home technologies. The phenomenal advances in technologies such as very
large scale integration (VLSI), micro electromechanical systems (MEMS), and wireless communications further contribute to the widespread use of distributed sensor
systems. For example, the impressive developments in semiconductor technologies
continue to produce microprocessors with increasing processing capacities, while at
the same time shrinking in size. The miniaturization of computing and sensing
technologies enables the development of tiny, low-power, and inexpensive sensors,
actuators, and controllers. Further, embedded computing systems (i.e., systems
that typically interact closely with the physical world and are designed to perform
only a limited number of dedicated functions) continue to find application in an
increasing number of areas. While defense and aerospace systems still dominate

the market, there is an increasing focus on systems to monitor and protect civil
infrastructure (such as bridges and tunnels), the national power grid, and pipeline
infrastructure. Networks of hundreds of sensor nodes are already being used to monitor large geographic areas for modeling and forecasting environmental pollution and
flooding, collecting structural health information on bridges using vibration sensors,
and controlling usage of water, fertilizers, and pesticides to improve crop health and
quantity.
In the past few years,there have been increasing advances in digital electronics,
semiconductor manufacturing technology, and wireless communications leading to
the development of low-power, low-cost, and small-size devices with embedded sensing, computing, and communication capabilities. A wireless sensor network (WSN)
is composed of hundreds or even thousands of such sensor devices which use radio frequencies to perform distributed sensing tasks. In general, since these sensor
devices are equipped with non-rechargeable batteries, energy efficiency is a major
design issue in order to increase the life-time of sensor networks. Cluster-based design is one of the approaches to conserve the energy of the sensor devices since only
some nodes, called cluster heads (CHs), are allowed to communicate with the base
station. The CHs collect the data sent by each node in that cluster, compress it, and
then transmit the aggregated data to the base station. The representative design
is low-energy adaptive clustering hierarchy (LEACH) protocol which uses a pure
probabilistic model to select CHs and rotates the CHs periodically in order to balance energy consumption. However, in some cases, inefficient CHs can be selected.
Because LEACH depends on only a probabilistic model, some cluster heads may be
very close each other and can be located in the edge of WSNs. These inefficient
cluster heads could not maximize the energy efficiency.
Appropriate cluster-head selection can significantly reduce energy consumption and
prolong the lifetime of WSNs. Some of the clustering algorithms employ fuzzy
logic to handle uncertainties in WSNs. Generally, fuzzy clustering algorithms use
fuzzy logic for blending different clustering parameters to select cluster heads. To
overcome the defects of LEACH, proposed to use three fuzzy descriptors (residual
energy, concentration, and centrality) during the cluster-head selection. The concentration means the number of nodes present in the vicinity, while the centrality
indicates a value which classifies the nodes based on how central the node is to the

cluster. In every round, each sensor node forwards its clustering information to the
base station at which the CHs are centrally selected. However, this mechanism is
a centralized approach proposed a similar approach (namely CHEF: Cluster Head
Election mechanism using Fuzzy logic), but in a distributed manner by using two
fuzzy descriptors (residual energy and local distance). The local distance is the
total distance between the tentative CH and the nodes within predefined constant
competition radius. Hence, the base station does not need to collect clustering information from all sensor nodes. Moreover, since selecting the cluster head is not
easy in different environments which may have different characteristics, employed
different fuzzy descriptors, including the remaining battery power, number of neighbor nodes, distance from cluster centroid, and network traffics, and evaluated their
performance. The sensor nodes closer to the base station consume much more energy due to the increased network traffic near the base station. Hence, the sensor
nodes closer to the base station quickly run out of battery. Besides the residual
energy, further considered a fuzzy[8] descriptor, distance to the base station, during
the cluster head selection. This unequal clustering approach is based on the idea of
decreasing the cluster sizes when getting close to the base station.
Based on LEACH, most existing fuzzy clustering approaches [9][15] considered the
residual energy of sensor nodes during the CH selection. However, the remaining
energy after being selected as a CH and running a round has never been discussed.
A round refers to the interval between two consecutive cluster formation processes.
In this paper, a fuzzy logic- based clustering approach with an extension to the
energy predication has been proposed to prolong the lifetime of WSNs by evenly
distributing the workload. In addition to the residual energy, the expected residual
energy (ERE) has been introduced to act as a fuzzy descriptor during the on-line CH
selection process. In order to estimate the ERE, the expected energy consumption
(EEC) is required. In our work, the EEC would be quickly calculated via an offline trained neural network model. The proposed approach adopts the LEACH
architecture with an extension to the energy predication based on the ERE, and
thus the approach is named LEACH-ERE. To the best of our knowledge, it is the
first time that expected/estimated remaining energy is used in cluster head selection
for wireless sensor networks.

1.2
1.2.1

Defination and Background

Sensing and Sensors

Sensing is a technique used to gather information about a physical object or process,

including the occurrence of events (i.e., changes in state such as a drop in temperature or pressure). An object performing such a sensing task is called a sensor. For
example, the human body is equipped with sensors that are able to capture optical information from the environment (eyes), acoustic information such as sounds
(ears), and smells (nose). These are examples of remote sensors, that is, they do not
need to touch the monitored object to gather information. From a technical perspective, a sensor is a device that translates parameters or events in the physical world
into signals that can be measured and analyzed. Another commonly used term is
transducer, which is often used to describe a device that converts energy from one
form into another. A sensor, then, is a type of transducer that converts energy in
the physical world into electrical energy that can be passed to a computing system
or controller. An example of the steps performed in a sensing (or data acquisition)
task is shown in Figure 1.1. Phenomena in the physical world (often referred to as
process, system, or plant) are observed by a sensor device. The resulting electrical
signals are often not ready for immediate processing, therefore they pass through a
signal conditioning stage. Here, a variety of operations can be applied to the sensor
signal to prepare it for further use. For example, signals often require amplification
(or attenuation) to change the signal magnitude to better match the range of the
following analog-to-digital conversion. Further, signal conditioning often applies filters to the signal to remove unwanted noise within certain frequency ranges (e.g.,
highpass filters can be used to remove 50 or 60 Hz noise picked up by surrounding power lines). After conditioning, the analog signal is transformed into a digital
signal using an analog-to-digital converter (ADC). The signal is now available in a
digital form and ready for further processing, storing, or visualization.
Many wireless sensor networks also include actuators which allow them to directly
control the physical world. For example, an actuator can be a valve controlling
the flow of hot water, a motor that opens or closes a door or window, or a pump
that controls the amount of fuel injected into an engine. Such a wireless sensor and

Figure 1.1: Data acquisition and actuation.

actuator network (WSAN) takes commands from the processing device (controller)
and transforms these commands into input signals for the actuator, which then
interacts with a physical process, thereby forming a closed control loop (also shown
in Figure 1.1).

1.2.2

Wireless sensor networks

While many sensors connect to controllers and processing stations directly (e.g., using local area networks), an increasing number of sensors communicate the collected
data wirelessly to a centralized processing station. This is important since many
network applications require hundreds or thousands of sensor nodes, often deployed
in remote and inaccessible areas. Therefore, a wireless sensor has not only a sensing
component, but also on-board processing, communication, and storage capabilities.
With these enhancements, a sensor node is often not only responsible for data collection, but also for in-network analysis, correlation, and fusion of its own sensor

Figure 1.2: Wireless sensor networks.

data and data from other sensor nodes. When many sensors cooperatively monitor
large physical environments, they form a wireless sensor network (WSN). Sensor
nodes communicate not only with each other but also with a base station (BS) using their wireless radios, allowing them to disseminate their sensor data to remote
processing, visualization, analysis, and storage systems. For example, Figure 1.2
shows two sensor fields monitoring two different geographic regions and connecting
to the Internet using their base stations.[9]
The capabilities of sensor nodes in a WSN can vary widely, that is, simple sensor
nodes may monitor a single physical phenomenon, while more complex devices may
combine many different sensing techniques (e.g., acoustic, optical, magnetic). They
can also differ in their communication capabilities, for example, using ultrasound, infrared, or radio frequency technologies with varying data rates and latencies. While
simple sensors may only collect and communicate information about the observed

environment, more powerful devices (i.e., devices with large processing, energy, and
storage capacities) may also perform extensive processing and aggregation functions.
Such devices often assume additional responsibilities in a WSN, for example, they
may form communication backbones that can be used by other resource-constrained
sensor devices to reach the base station. Finally, some devices may have access to
additional supporting technologies, for example, Global Positioning System (GPS)
receivers, allowing them to accurately determine their position. However, such systems often consume too much energy to be feasible for low-cost and low-power sensor
nodes.
As with many other technologies, the military has been a driving force behind
the development of wireless sensor networks. For example, in 1978, the Defense
Advanced Research Projects Agency (DARPA) organized the Distributed Sensor
Nets Workshop (DAR 1978), focusing on sensor network research challenges such as
networking technologies, signal processing techniques, and distributed algorithms.
DARPA also operated the Distributed Sensor Networks (DSN) program in the early
1980s, which was then followed by the Sensor Information Technology (SensIT)
program.

1.2.3

Communication in a WSN

The well-known IEEE 802.11 family of standards was introduced in 1997 and is the
most common wireless networking technology for mobile systems. It uses different frequency bands, for example, the 2.4-GHz band is used by IEEE 802.11b and
IEEE 802.11g, while the IEEE 802.11a protocol uses the 5-GHz frequency band.
IEEE 802.11 was frequently used in early wireless sensor networks and can still be
found in current networks when bandwidth demands are high (e.g., for multimedia sensors). However, the high-energy overheads of IEEE 802.11-based networks
makes this standard unsuitable for low-power sensor networks. Typical data rate
requirements in sensor networks are comparable to the bandwidths provided by dialup modems, therefore the data rates provided by IEEE 802.11 are typically much
higher than needed. This has led to the development of a variety of protocols that
better satisfy the networks need for low power consumption and low data rates.
For example, the IEEE 802.15.4 protocol has been designed specifically for short

Figure 1.3: Single hop versus Multi hop communication in sensor networks.
range communications in low-power sensor networks and is supported by most academic and commercial sensor nodes. When the transmission ranges of the radios of
all sensor nodes are large enough and the sensors can transmit their data directly
to the base station, they can form a star topology as shown on the left in Figure
1.3. In this topology, each sensor node communicates directly with the base station
using a single hop. However, sensor networks often cover large geographic areas
and radio transmission power should be kept at a minimum in order to conserve
energy; consequently, multi-hop communication is the more common case for sensor
networks (shown on the right in Figure 1.3). In this mesh topology, sensor nodes
must not only capture and disseminate their own data, but also serve as relays for
other sensor nodes, that is, they must collaborate to propagate sensor data towards
the base station.[10] This routing problem, that is, the task of finding a multi-hop
path from a sensor node to the base station, is one of the most important challenges
and has received immense attention from the research community. When a node
serves as a relay for multiple routes, it often has the opportunity to analyze and preprocess sensor data in the network, which can lead to the elimination of redundant
information or aggregation of data that may be smaller than the original data.

Chapter 2
Fuzzy Reasoning and Cluster
Head Algorithm

2.1

Introduction

The derivation of mathematical models that can efficiently describe real worid problems is most of the time an overwhelming or even impossible task due to the complexity and the inherent ambiguity of characteristics that these problems may possess.
As Zadeh (1973), the founder of the theory of fuzzy sets, puts it, as the complexity
of a system increases, our ability to make precise and yet significant statements
about its behavior diminishes until a threshold is reached beyond which precision
and significance (or relevance) become almost mutually exclusive characteristics.[4]
Fuzzy Reasoning is based on the theory of fuzzy sets and it encompasses Artificial
Intelligence, information processing and theories from logic to pure and applied
mathematics, like graph theory, topology and optimization. The theory of fuzzy sets
was introduced in 1965. In his introductory paper, Zadeh, while stating his intention
(to explore in a preliminary way some of the basic properties and implications of
fuzzy sets) he noted that the notion of a fuzzy set provides a convenient point of
departure for the construction of a conceptual framework which parallels in many
respects the framework used in the case of ordinary sets, but is more general than
the latter and, potentially, may prove to have a much wider scope of applicability,

particularly in the fields of pattern classification and information processing.

Indeed, in subsequent years, the theory of fuzzy sets was more decisively established
as a new approach to complex systems theory and decision processes. The application of fuzzy logic has dramatically increased since 1990, ranging from production,
finance, marketing and other decision-making problems to micro-controller-based
systems in home appliances and large-scale process control systems (Sugeno and
Yasukawa, 1993; Karr and Gentry, 1993; Lee, 1990). For systems involving nonlinearities and lack of a reliable analytical model, fuzzy logic control has emerged as one
of the most promising approaches. Without doubt, fuzzy inference is a step towards
the simulation of human thinking. The main advantage of fuzzy logic techniques,
i.e. techniques based on the theory of fuzzy sets, over more conventional approaches
in solving complex, nonlinear and/or ill-defined problems lies in their capability of
incorporating a priori qualitative knowledge and expertise about system behavior
and dynamics. This renders fuzzy logic systems almost indispensable for obtaining
a more transparent and tactile qualitative insight for systems whose representation
with exact mathematical models is poor and inadequate. Besides, fuzzy schemes
can be used either as enabling to other approaches or as self reliant methodologies
providing thereby a plethora of alternative structures and schemes.[5] In fact, fuzzy
control theory generates nonlinear functions according to a representation theorem
by Wang (1992), who stated that any continuous nonlinear function can be approximated as exactly as needed with a finite set of fuzzy variables, values and rules.
Therefore, by applying appropriate design procedures, it is always possible to design
a fuzzy controller that is suitable for the nonlinear system under control. Fuzzy reasoning, also known as approximate reasoning, is an inference procedure that derives
conclusions from a set of fuzzy if then rules and known facts.

2.2

Approximate Reasoning

The term Approximate reasoning refers to methods and methodologies that enable
reasoning with imprecise inputs to obtain meaningful outputs. Inference in approximate reasoning is in sharp contrast to inference in classical logic. Inference in
approximate reasoning is computation with fuzzy sets that represents the meaning

10

Figure 2.1: Temperature domain in three fuzzy sets.

of a certain set of fuzzy propositions. One of the best known application areas of
fuzzy logic is approximate reasoning. Approximate reasoning with fuzzy sets encompasses a wide variety of inference schemes and have been readily applied in many
fields like decision making, expert systems and fuzzy control. We can optimize the
approximate judgment with the help of system of relational assignment equations
based on fuzzy logic in more generalized form.
fuzzy logic handle approximate information in a very systematic way, it is perfect
for controlling nonlinear systems and also for modeling complex systems where an
inexact model exists or systems where vagueness is common. A typical fuzzy system
consists of a fuzzy rule base, membership functions and an inference. Fuzzy logic
with approximate reasoning describes relations by if-then rules, such as, if heating
valve is close then temperature is low. The uncertainity in the linguistic terms
(e.g. low temperature) is represented by fuzzy sets.[2] Each linguistic fuzzy set in
this case shows the temperature range from its one extreme to the other. The
smooth outcome of reasoning with fuzzy sets is a kind of interpolation.

11

2.2.1

Classical IF-THEN Rule

If-then rule in classical reasoning is given as

If antecedent proposition Then consequent proposition.

Both propositions in this case are classical two valued.

Example of Classical IF-THEN Rule

If it is raining then take the Umbrella Now if we know that it is raining, i.e, A
is true then we deduce that B is true, i.e, we need to take the umbrella.

2.2.2

Fuzzy IF-THEN Rule

In fuzzy system the antecedent and consequent propositions are fuzzy sets with
linguistic labels. The linguistic model with fuzzy sets has been introduced to capture
qualitative knowledge in the form of if-then rule

If x is Ai Then y is Bi , i=1,2,..,k

where

x is a linguistic antecedent variable Ai are antecedent linguistic labels.

Similarly

y is a consequent linguistic variable. Bi are consequent linguistic terms.

The linguistic terms Ai (Bi ) are fuzzy sets.

12

Figure 2.2: Linguistic fuzzy sets.

Example of Linguistic Fuzzy sets

This example shows a linguistic variable pressure with three linguistic terms high,
medium ,low. Pressure is in appropriate physical units.

2.2.3

Models for Approximations

1. Linguistic Fuzzy Model In this type of the model both antecedent and
consequent are fuzzy propositions.
2. Fuzzy Relational Model This model is a generalization of the linguistic
model in which particular antecedent propositions are associated with several
different consequent propositions through a fuzzy relation.

13

2.3

Proposed Clustering Approach

2.3.1

System Assumptions

This topic considers network applications in which sensor nodes are deployed randomly in order to continuously monitor the environment. The information collected
by sensor nodes is sent to a base station located outside of the deployment field.
Each sensor nodes can operate either in sensing mode to monitor the environment
parameters and transmit it to the associated CH or in CH mode to gather data,
compress it and forward to the base station. In addition, some assumptions are
made as follows:

1. All sensor nodes and the base station are stationary after deployment.
2. The network is considered homogeneous and all sensor nodes have the same
initial energy.
3. Nodes have the capability of controlling the transmission power according to
the distance of receiving nodes.
4. The distance between nodes can be computed based on the received signal
strength.
5. The radio link is symmetric such that energy consumption of data transmission
from node A to node B is the same as that of transmission from node B to
node A.

2.3.2

Handing Uncertainties Using Fuzzy Inference Systems

To handle uncertainties, this paper has used fuzzy inference systems (FIS) for the
chance computation of each node. Two input variables for the FIS are the residual energy Eresidual and the expected residual energy EexpResidual , and one output
parameter is the probability of a node to be selected as a CH, named chance. The
bigger chance means that the node has more chance to be a CH. The fuzzy set that
describes the residual energy input variable is depicted. The linguistic variables

14

for this fuzzy set are high, rather high, medium, rather low, low, and very low. A
trapezoidal membership function is used for high and very low, while a triangular
membership function is used for the rest linguistic variables. The other fuzzy input
variable is the expected residual energy of the CH candidate. The fuzzy set that
describes expected residual energy input variable. The linguistic variables of this
fuzzy set are high, medium and low. A trapezoidal membership function is used for
high and low, while a triangular membership function is used for medium. The only
fuzzy output variable is the chance of a CH candidate. The fuzzy set for the chance
output variable. Seven linguistic variables are very high, high, rather high, medium,
rather low, low, and very low. The very high and very low have a trapezoidal membership function, and the remaining linguistic variables are represented by using
triangular membership functions. In this work, for simplicity and reducing the cost
of computation, the triangular membership functions are mostly chosen here.
The chance calculation is accomplished by using predefined fuzzy if-then mapping
rules to handle the uncertainty. Based on the two fuzzy input variables, 18 fuzzy
mapping rules are defined in Table I. From the fuzzy rules, we can get the fuzzy
variable chance. This fuzzy variable has to be transformed to a single crisp number
that is a form we can use in practice. In our approach, the center of area (COA)
method is used for defuzzification of the chance. Generally, fuzzy rules can be
generated either from heuristics or from experimental data. In this paper, the
heuristic fuzzy rule generation method is used with the principle: A node which
holds more residual energy and more ERE has a higher probability to become a
CH.

2.3.3

Proposed LEACH-ERE Clustering Algorithm

Similar to the LEACH, our proposed clustering method configures clusters in every
round. The pseudo code of the clustering method is described as Algorithm 1. In
every clustering round, each sensor node generates a random number between 0 and
1. If the random number for a particular node is bigger than a predefined threshold
T , which is the percentage of the desired tentative CHs, the node becomes a CH
candidate. Then, the node calculates the chance using the fuzzy inference system
which is mentioned above and broadcasts a Candidate-Message with the chance.

15

Figure 2.3: Fuzzy set for output variable chance.

This message means that the sensor node is a candidate for CH with the value of
chance. Once a node advertises a Candidate-Message, the node waits CandidateMessages from other nodes. [1]If the chance of itself is bigger than every chance
values from other nodes, the sensor node broadcasts a CH-Message which means
that the sensor node itself is elected as the CH. If a node which is not a CH receives
the CH-Message, the node selects the closest cluster head as its CH and sends a
JOIN-REQ request to the head.

2.4

Model Identification and Stability of Fuzzy

System

2.4.1

Fuzzy System Modeling

Mathematical models, which can describe efficiently the dynamics of the system
under study, play an essential role in process analysis and control. However, most of
the real-world processes are complicated and nonlinear in nature, making the derivation of mathematical models and/or subsequent analysis rather formidable tasks. In

16

Figure 2.4: Fuzzy mapping rules.

17

practice, such models are not available. For these cases, models need to be developed
based solely on input-output data. Many approaches based on nonlinear time series
(Hemadez and Arkun, 1993; Ljung, 1987), several nonlinear approaches (Henon,
1982; Wolf et al., 1985) and normal form theory (Read and Ray, 1998a,b,c) have
been applied in nonlinear system modeling and analysis. During the last decade, a
considerable amount of work has been published on the dynamic modeUng of nonlinear systems using neural networks (Narendra and Parthasarathy, 1990; Chen and
Billings, 1992; Shaw et al., 1997; Haykin, 1999) and/or fuzzy logic methodologies
(Sugeno and Yasukawa, 1993; Laukoven and Pasino, 1995; Babuska and Verbruggen,
1996). Most of them, excluding normal forms and fuzzybased approaches, are numerical in nature providing therefore only black-box representations. On the other
hand, fuzzy logic methodologies (Laukoven and Pasino, 1995; Park et al., 1999;
Sugeno and Kang, 1988; Sugeno and Yasukawa, 1993; Takagi and Sugeno, 1985)
can incorporate a priori qualitative knowledge of the system dynamics. In Siettos et
al. (2001) and Alexandridis et al. (2002) fuzzy logic and Kohonens neural networks
are combined for the derivation of truncated time series models.
Fuzzy logic can incorporate expertise and a priori qualitative knowledge of the system. In the last 20 years, strikingly results have been obtained by using various
fuzzy design methods. In many cases the fuzzy control systems outperform other
more traditional approaches. However, the extensive applicability of the former is
United due to the deficiency of formal and systematic design techniques, which can
fulfill the two essential requirements of a control system: the requirement for robust
stability and that of satisfactory performance. As a consequence, due to the complexity of nonlinear processes, it is rather difficult to construct a proper fuzzy rule
base based only on observation. Moreover, the lack of a mathematical model, which
characterizes fuzzy systems, often limits their applicability, since various vital tasks,
such as stability analysis, are difficult to accomplish.

2.4.2

Stability of Fuzzy Systems

The problem of designing reliable fuzzy control systems in terms of stability and
performance has found a remarkable resonance among engineers and scientists. So
far, various approaches to this problem have been presented. One of the first contri-

18

butions to this topic was that of Braae and Ratherford (1979), where they utilized
the phase plane method for analyzing the stability of a fuzzy system. Kickert and
Mamdani (1978) proposed the use of describing functions for the stability analysis of unforced fuzzy control systems. In Kiszka et al. (1985) the notion of the
energy of fuzzy relations to investigate the local stability of a free fuzzy dynamic
system is introduced. Motivated by the work of Tanaka and Sugeno (1992), many
schemes have been proposed for analyzing the stability of fuzzy systems (Feng, et
al., 1997; Kiriakidis et al., 1998; Leung et al., 1998; Kim et al., 1995; Thathachar
and Viswanath, 1997; Wang et al., 1996). The main idea behind this approach lies
in the decomposition of a global fuzzy model into simpler linear fuzzy models, which
locally represent the dynamics of the whole system.
In Kiendl and Ruger (1995) and Michels (1997) the authors proposed numerical
methods for the stability analysis for fuzzy controllers in the sense of Lyapunovs
direct method. In Fuh and Tung (1997) and Kandel et al. (1999) the stabiHty analysis of fuzzy systems using Popov-Lyapunov techniques is proposed. In recent years,
the problem of designing stable robust and adaptive fuzzy controllers with satisfactory performance based on the sliding mode approach has attracted much attention
(Chen and Chang, 1998; Chen and Chen, 1998; Chen and Fukuda, 1998; Palm, 1992;
Tang, et al, 1999; Wang, 1994; Yi and Chung, 1995; Yu et al., 1998). The design
of such schemes is based on the Lyapunov direct method. The proposed schemes
take advantage of both sliding and fuzzy features. A systematic practical way of
deriving analytical expressions for fuzzy systems for use in control, system identification and stability using well-established classical theory methods is presented
in Siettos et al. (2001). Finally, in Siettos and Bafas (2001) singular perturbation
methods (Kokotovic et al., 1976) based on a Lyapunov approach are implemented
for the derivation of sufficient conditions for the semiglobal stabilization with output tracking of nonlinear systems having internal dynamics, incorporating fuzzy
controllers.

19

Chapter 3
Fuzzy Inference System and
Energy Prediction

3.1

Introduction

The fuzzy inference system is a popular computing framework based on the concepts
of fuzzy set theory, fuzzy if-then rules, and fuzzy reasoning. It has found successful
application in a wide variety of fields, such as automatic control, data classification, decision analysis, expert systems, time series prediction, robotics, and pattern
recognition. Because of its multidisciplinary nature, the fuzzy inference system is
known by numerous other names, such as fuzzy rule based system, fuzzy expert
system, fuzzy model, fuzzy associative memory, fuzzy logic controller, and simply
and ambiguously fuzzy system.
The basic structure of a fuzzy inference system consists of three conceptual components:a rule base,which contains a selection of fuzzy rules; a database(or dictionary),which defines the membership functions used in the fuzzy rules; and a reasoning mechanism, which performs the inference procedure upon the rules and given
facts to derive a reasonable output or conclusion. Note that the basic fuzzy inference system can take either fuzzy input or crisp inputs which are viewed as fuzzy
singletons, but the outputs it produces are almost always fuzzy sets. Sometimes it
is necessary to have a crisp output, especially in a situation where a fuzzy inference

20

Figure 3.1: Block diagram for a fuzzy inference system.

system is used as a controller. Therefore, we need a method of defuzzification to
extract a crisp output as shown in figure 3.1, where the dashed line indicates a basic
fuzzy inference system with fuzzy output and the defuzzification block serves the
purpose of transforming an output fuzzy set into a crisp single value. An example
of a fuzzy inference system without defuzzification block is the two rule two input
system. The function of the defuzzification block is explained in figure 3.1. With
crisp inputs and outputs, a fuzzy inference system implements a non linear mapping
from its input space to output space. This mapping is accomplished by a number
of fuzzy if-then rules, each of which describes the local behaviour of the mapping.
In particular, the antecedent of a rule defines a fuzzy region in the input space,
while the consequent specifies the output in the fuzzy region. In this we introduces
a fuzzy inference systems that have been widely employed in various applications.
Mamdani fuzzy model is a fuzzy inference system lie in the consequent of their fuzzy
rules, and thus their aggregation and defuzzification procedures differs accordingly.

21

3.2

Basic Structure of Fuzzy inference System

The basic structure of a fuzzy inference system consists of a fuzzification unit, a

fuzzy logic reasoning unit (process logic), a knowledge base, and a defuzzification
unit (Figure 3.2). The key element of the system is the fuzzy logic-reasoning unit
that contains two main types of information:

A data base defining the number, labels and types of the membership functions
the fuzzy sets used as values for each system variable. These are of two types:
the input and the output variables. For each one of them the designer has to
define the corresponding fuzzy sets. The proper selection of these is one of
the most critical steps in the design process and can dramatically affect the
performance of the system. The fuzzy sets of each variable form the universe
of discourse of the variable.
A rule base, which essentially maps fuzzy values of the inputs to fuzzy values
of the outputs. This actually reflects the decision-making policy. The control
strategy is stored in the rule base, which in fact is a collection of fuzzy control
rules and typically involves weighting and combining a number of fuzzy sets
resulting from the fuzzy inference process in a calculation, which gives a single
crisp value for each output. The fuzzy rules incorporated in the rule base
express the control relationships usually in an IF-THEN format. For instance,
for a two-input-one-output fuzzy logic controller, that is the case in this work,
a control rule has the general form
Ruleif : If xisAi andyisBi T HEN zisCi

(3.1)

where x and y are input variables, z is the output variable; Ai, Bi and Ci are
linguistic terms (fuzzy sets) such as negative, positive or zero. The ifpart of the rule is called condition or premise or antecedent, and the then-part
is called the consequence or action.

Usually the actual values acquired from or sent to the system of concern are crisp,
and therefore fuzzification and defuzzification operations are needed to map them
to and from the fuzzy values used internally by the fuzzy inference system.

22

The fuzzy reasoning unit performs various fuzzy logic operations to infer the output (decision) from the given fuzzy inputs. During fuzzy inference, the following
operations are involved for each fuzzy rule:
1. Determination of the degree of match between the fuzzy input data and the
defined fuzzy sets for each system input variable.
2. Calculation of the fire strength (degree of relevance or applicability) for each
rule based on the degree of match and the connectives (e.g. AND, OR) used
with input variables in the antecedent part of the rule.
3. Derivation of the control outputs based on the calculated fire strength and the
defined fuzzy sets for each output variable in the consequent part of each rule.
Several techniques have been proposed for the inference of the fuzzy output based
on the rule base. The most common used are the following:
the Max-Min fuzzy inference method.
the Max-product fuzzy inference method.
Assume that there are two input variables, e (error) and ce (change of error), one
output variable, cu (change of output), and two rules:
Rule 1 If e is A1 AND ce is B1 THEN cu is C1
Rule 2 If e is A2 AND ce is B2 THEN cu is C2
In the Max-Min inference method, the fuzzy operator AND (intersection) means
that the minimum value of the antecedents is taken:
A AN DB = min(A , B )

(3.2)

while for the Max-product one the product of the antecedents is taken:
A AN DB = A B

(3.3)

for any two membership values A and B of the fuzzy subsets A, B, respectively.
All the contributions of the rules are aggregated using the union operator, thus
generating the output fuzzy space C.

23

Figure 3.2: The Mamdani fuzzy inference system using min and max for T-norm
and T-conorm, respectively.

3.3

Mamdani Fuzzy Models

The Mamdani fuzzy inference system was proposed as the first attempt to control
a system engine and boiler combination by a set of linguistic control rules obtained
from experienced human operators. Figure 3.2 is an illustration of how a two rule
Mamdani fuzzy inference system derives the overall output z when subjected to two
crisp inputs x and y. If we adopt max and algebric product as our choice for the
T-norm and T-conorm operators, respectively, and use max product composition
instead of the original max min composition, then the resulting fuzzy reasoning is
shown in figure 3.3, where the inferred output of each rule is a fuzzy set scaled down

24

Figure 3.3: The Mamdani Fuzzy inference system using min and max for T-norm
and T-conorm operators, respectively
by its firing strength via algebric product. Although this type of fuzzy reasoning was
not employed in Mamdanis original paper, it has often been used in the literature.
Other variations are possible if we use different T-norm and T-conorm operators.
In Mandanis application, two fuzzy inference system were used as two controllers
to generate the heat input to the boiler and throttle opening of the engine cylinder,
respectively, to regulate the steam pressure in the boiler and the speed of the engine.
since the plant takes only crisp values as inputs,we have to use a defuzzifier to convert
a fuzzy set to a crisp value.

25

Figure 3.4: Fuzzy inference viewer in the Fuzzy Logic Toolbox.

3.3.1

Other Variants

Figures 3.2 and 3.3 conform to the fuzzy reasoning defined previously. However,
in consideration of computation efficiency or mathematical tractability, a fuzzy inference system in practice may have a certain reasoning mechanism that does not
follow the strict definition of the compositional rule of inference. For instance, one
might use product for computing firing strength for rules with ANDed antecedent,
min for computing qualified consequent MFs, and max for aggregating them into
an overall output MF. Therefore, to completely specify the operation of a Mamdani
fuzzy Inference system. We need to assign a function for each of the Following
operators.

AND Operator Usually T-Norm for calculating the firing strength of a rule
with ANDed antecedents.

26

 OR Operator Usually T-conorm for calculating the firing strength of a rule

with ORed antecedents.
Implication Operator Usually T-norm for calculating qualified consequent
MFs based on given firing strength.
Aggregate Operator Usually T-conorm fo aggegrating qualified consequent
MFs to generate an overall output MF.
Defuzzification Operator For transforming an output MF to a crisp single
Output value.

3.4

Other Consideration

3.4.1

Input Space Partitioning

Now it should be clear that the spirit of fuzzy inference systems resembles that
of divide and conquer- the antecedent of a fuzzy rule defines a local fuzzy region, while the consequent describes the behavior within the region via various
constituents. The consequent constituent can be a consequent MF (Mamdani and
Tsukamto fuzzy models), a constant value (zero-order Sugeno model), or a linear
equation (first order Sugeno model). Different consequent constituents result in different fuzzy inference systems , but their antecedents are always the same. Therefore
, the following discuss of methods of partitioning input spaces to form antecedents
of fuzzy rules is applicable all the types of fuzzy inherence system

Grid partition figure 3.5(a) illustrates a typical grid partition in a two dimensional input space. This practise method is often chosen designing. A fuzzy
controller , which usually involves only several state variables as the inputs to
the controller. This partition strategy needs only a small number of MFs for
each input. However, it encounters problems when we have a moderately large
number of inputs. For instance, a fuzzy model with 10 inputs and two MFs
on each inputs would result in 1024 fuzzy if then rules, which is prohibitively

27

Figure 3.5: Various methods of partitioning the input space: (a) grid partition; (b)
tree partition; (c) scatter partition
large. This problem, usually referred to edge the curse of dimensionality , can
be alleviated by the other partition strategies.
Tree partition figure 3.5(b) shows a typical tree partition, in which each
region can be uniquely specified. along a corresponding decision tree. the
tree partition relieves the problem often exponential increase in the number
of rules. However, more MFs for each input are needed to define these fuzzy
reasons , and these MFs do not usually bear clear linguistic meanings such as
small, big and so on. In ither words, orthogonality holds roughly in X x Y,
but not in either X or Y alone. tree partition is used by the cart( classification
and regression tress) algorithm.[6]
scatter partition figure 3.5(c) By covering a subset of the whole input space
that characterises a region of possible occurrence of the input vector, the
scatter partition can also limit the number of rules to a reasonable ammount.
However the scatter partition is usually dictated by desired input output data
pairs and thus in general, orthogonality dose not hold in X,y or X x y . this
makes it hard to estimate the overall mapping directly from the consequent of

28

each rules output.

Figure 3.5 is based on the assumption that MFs are defined on the input variables
directly. If MFs are defined on certain transformation of the input variables, we
could end up in a more flexible partition style.

3.4.2

Fuzzy Modeling

In general, we design a fuzzy inference system based on the past known behavior
of a target system. The fuzzy system is then expected to be able to reproduce
the behavior of the target system. For example, if the target system is a human
operator in charge of a chemical reaction process, then the fuzzy inference system
becomes a fuzzy logic controller that can regulate and control the process. Similarly,
if the target system is a medical doctor then the fuzzy inference becomes a fuzzy
expert system for medical diagnosis. Generally speaking, the standard method for
constructing a fuzzy inference system, a process usually called fuzzy modeling, has
the following features:

The rule structure of a fuzzy inference system makes it easy to incorporate

human expertise about the target system directly into the modeling process.
Namely, fuzzy modeling takes the advantage of domain knowledge that might
not be easily or directly employed in other modeling process.
When the input-output data of a target system is available, conventional system identification techniques can be used for fuzzy modeling. In other words,
the use of numerical data also plays an important role in fuzzy modeling, just
as in other mathematical modeling methods.

Conceptually, fuzzy modeling can be pursued in two stages, which are not totally
disjoint. The first stage is the identification of the surface structure, which includes
the following tasks:

1. Select relevant input and output variables.

29

2. Choose a specific type of fuzzy inference system.

3. Determine the number of linguistic terms associated with each input and output variables.
4. Design a collection of fuzzy-if then rules.

To accomplish the preceding tasks, we rely on our own knowledge of the target
system, information provided by human experts who are familiar with the target
system, or simply trial and error. After the first stage of fuzzy modeling, we obtain
a rule base that can more or less describes the behavior of the target system by
means of linguistic terms. The meaning of these linguistic terms is determined in
the second stage, the identification of deep structure, which determines the MFs
of each linguistic terms. Specially, the identification of deep structure includes the
following tasks.

1. Choose an appropriate family of parameterized MFs.

2. Interview human experts familiar with the target systems to determine the
parameters of the MFs used in the rule base.
3. Refine the parameters of the MFs using regression and optimization techniques.

3.5
3.5.1

Energy Prediction
LEACH Clustering Algorithm

LEACH is one of the clustering mechanisms to achieve the energy efficiency in the
communication between sensor nodes. The operation of LEACH is divided into
rounds. Each round begins with a set-up phase when the clusters are organized,
followed by a steady-state phase when data are transferred from the nodes to the
CH and on to the base station.[1] LEACH forms clusters by using a distributed
algorithm, where nodes make autonomous decisions without any centralized control.

30

Figure 3.6: Cluster formation and operation.

Each node i elects itself to be a CH at the beginning of round r +1 (which starts
at time t) with probability Pi (t). Pi (t) is chosen such that the expected number
of CHs for this round is k. If there are N nodes in the network, each node would
choose to become a CH at round r with the probability as (1).

N , &ifCi (t) = 1
N K(rmod K
)
Pi (t) =
0,
ifCi (t) = 0

(3.4)

where Ci (t) is the indicator function determining whether or not node i has been a
CH within the most recent (r mod N/K) rounds (Ci (t) = 0 means node i has been
a CH). Thus, only nodes that have not already been CHs recently (i.e. Ci (t) = 1)
may become CHs at round r + 1.

3.5.2

Radio Energy Dissipation Model

Currently, there is a great deal of research in the area of low energy radios. In this
paper, the first-order radio model shown in has been adopted to model the energy
dissipation. As the distance between the transmitter and receiver is less than a

31

Figure 3.7: Proposed scheme of the probability reasoning during cluster head selection.
threshold value d0, the free space model (d2 power loss) is employed. Otherwise the
multi path fading channel model (d4 power loss) is used. Equation (2) shows the
amount of energy consumed for transmitting l bits of data to d distance, while (3)
represents the amount of energy consumed for receiving l bits of data.

ET x (l, d) =

l(E T x)+l(EF s)d2 ifd 1

,

l(E T x)+l(Em p)d4 ifd 1

(3.5)

ERx (l) = l E R x

(3.6)

ETx elec and ERx elec are the energy consumption per bit in the transmitter and
receiver circuits. Also, fs and mp are the energy consumption factor of amplification
for the free space and multipath radio models, respectively. The threshold value d0

32

could be obtained via (4).

s
Ef s
d0 =
Emp

3.5.3

(3.7)

Expected residual energy

Before the cluster formation, the number of cluster members is unknown. However,
since it is proportional to the number of neighbors near a potential CH (in a specific
transmission range), the number of neighbors (defined as value n) could be used
to obtain the expected energy consumption during the CH selection. As shown in
Fig. 1, after the cluster formation, the steady-state operation is broken into frames,
where nodes send their data to the CH at most once per frame during their allocated
transmission slot. In a frame, suppose a CH has n cluster members, it would receive
n messages from all the members and then transmit one combined message to the
base station with a distance dtoBS. [3]The number of frames could be obtained by
(5).

Nf rame =

tssphase
n (tslot ) + tCHtoB )

(3.8)

where tssPhase is the operation time of the steady-state phase (i.e. the time of
a node to be a CH), tslot is the slotted time required for the transmission from
members to the CH, and tCHtoBS is the time required for the transmission from
CH to the base station.
The expected consumed energy of a node to be a CH after a steady-state phase
could be represented as (6).

Eexpconsumed (l, d, n) = Nf rame (ET x (l, d) + n ERx (l))

(3.9)

All the sensor nodes are assumed to transmit and receive the same size of messages,
i.e. l bits of data. The distance to the base station, dtoBS, could be computed

33

Figure 3.8: Fuzzy set for input variable. (a) Residual energy. (b) Expected residual
energy
based on the received signal strength. Then, the expected residual energy of a node
to be a CH after a steady-state phase could be obtained via (7).
Eexpresidual (l, d, n) = Eresidual Eexpconsumed

(3.10)

where the Eresidual is the residual energy of a sensor node before the cluster head
selection.

34

Chapter 4
Conclusion and Future Scope

4.1

Conclusion

Energy is a major factor in designing WSNs. To achieve the energy efficiency, many
clustering algorithms are proposed and LEACH is the representative one. LEACH
uses the probability model to distribute the concentrated energy consumption of the
CHs. However, it depends on only a probability model and the energy efficiency is
not maximized. In this paper, a fuzzy logic- based clustering approach based on
LEACH architecture with an extension to the energy predication has been proposed
for WSNs, namely LEACH-ERE. The main objective of our algorithm is to prolong
the lifetime of the WSN by evenly distributing the workload. To achieve this goal, we
have mostly focused on selecting proper CHs from existent sensor nodes. LEACHERE selects the CHs considering expected residual energy of the sensor nodes. The
simulation results show that the proposed LEACH-ERE is more efficient than other
distributed algorithms, such as LEACH and CHEF. In this topic, the proposed
LEACH-ERE algorithm is designed for the WSNs that have stationary sensor nodes.
As a future work, it can be extended for handling mobile sensor nodes. Also, a
further direction of this work will be to find the optimal fuzzy set and to compare
the enhanced approach with other clustering algorithms.

35

4.2

Future Scope

The future work will focus on the three energy optimized parameters, such as degree of closeness of node to the shortest path, degree of closeness of node to sink,
and degree of energy balance, and put these parameters into fuzzy logic system.
The fuzzy-logic based clustering approach algorithm is proposed to realize energy
optimized, multi-parameter, and fuzzy routing decision. Simulation results show
that the algorithm extends the network lifetime effectively compared with similar
algorithms for different generation patterns and has a good performance in terms of
energy balance and energy efficiency.
Our future work will focus on the applications for multimedia. While achieving
optimized energy consumption of the whole network, the quality of service(Qos),
such as bandwidth, latency, and packet loss rate will be considered to meet the
requirements of specific applications.

36

References
[1] J.-S. Lee and W.-L. Cheng, Fuzzy-logic-based clustering approach for wireless
sensor networks using energy predication, IEEE, September 2012.
[2] A. Khaliq and A. Ahmad, Fuzzy logic and approximate reasoning, IEEE,
january 2010.
[3] H. Jiang, Y. Sun, R. Sun, and H. Xu, Fuzzy-logic-based energy optimized
routing for wireless sensor networks, IEEE, July 2013.
[4] R. Fuller, Fuzzy reasoning and fuzzy optimization, IEEE, Dec 1998.
[5] C. P. Pappis and C. I. Siettos, Fuzzy reasoning, IEEE, may 2011.
[6] jyh Shing Roger Jang, cheun Tsai Sun, and E. MIzutani, Neuro-fuzzy and soft
computing, Aug 1997.
[7] W. Dargie and C. Poellabauer, Fundamentals of wireless sensor networks,
June 2010.
[8] J. Yick, B. Mukherjee, and D. Ghosal, Wireless sensor network survey, IEEE,
Aug 2008.
[9] G. Anastasi, M. Conti, M. D. Francesco, and A. Passarella, Energy conservation in wireless sensor networks: A survey, IEEE, Feb 2009.
[10] chau and shun, Forecasting exchange rates with fuzzy logic and approximate
reasoning, IEEE, June 2000.

37