Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

FPOA Implementation For WSN Energy Efficient Routing

Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 8 22 - 26
_______________________________________________________________________________________________
FPOA Implementation for WSN Energy Efficient Routing

Mandeep Kaur Prof. R. S. Uppal (HOD ECE dept.)


Dept. of Computer Science and Information Engg., Dept. of Electronics and Communication Engg.,
Baba Banda Singh Bahadur Engineering College, Baba Banda Singh Bahadur Engineering College
Fatehgarh Sahib, Punjab. Fatehgarh Sahib, Punjab.
e-mail: mandeep.cse@gmail.com e-mail: rs.uppal@bbsbec.ac.in

AbstractIn this paper, a soft computing technique Flower Pollination optimization Algorithm(FPOA) for WSN is proposed. The Sensor
Network is heterogeneous in nature. Proposed algorithm is designed and implemented in MATLAB. In this technique some nodes send data
directly to base station as local pollination and some by Multihop routing as global pollination. A routing scheme is process which helps in
minimizing the energy consumption. The performance of FPOA is compared with techniques that are already developed.(Low Energy adaptive
clustering hierarchy (LEACH), Stable Election Protocol (SEP) and Zonal-Stable Election Protocol (Z-SEP) Simulation results show that FPOA
enhance first node dead time, throughput and overall energy efficiency than existing protocols like LEACH, SEP and Z-SEP.

Keywords- Flower Pollination optimization Algorithm (FPOA); Wireless sensor network(WSN); energy efficiency; Multihop routing; sensor
nodes.
__________________________________________________*****_________________________________________________

I. INTRODUCTION Something that user wants to receive information


Now a days wireless sensor network garning a great about it.
demand because low value of sensor element nodes, self The user that data collected to measure /monitor
organization and sensing capability of atmosphere the behavior of the phenomenon.
conditions. Routing is the necessary technique in wireless A WSN typically consists of a large number (tens to
sensor network. Energy efficiency is the most vital thousands) of low-cost, low-power, and multifunctional
performance factor in wireless sensor network. Wireless sensor nodes that are deployed in a region of interest. These
sensor network made up of thousand sensor nodes .In such sensor nodes are small in size, but are equipped with
cases maximum amount energy of node is restricted, embedded microprocessors, radio receivers, and power
networks lifetime is taken into account to be a vital issue. components to enable sensing, computing, communication,
As there is scarcity of energy sources conjointly, the and actuation. These components are integrated on a single
batteries are low powered; an energy efficient routing is or multiple boards, and packaged in a few cubic inches. A
supposed to be vital challenge in WSN. WSN communicates over a short distance through wireless
channels for information sharing and cooperative processing
In WSN most of the energy is consumed throughout to accomplish a common task. WSNs can be deployed on a
transmission and receiving/ communication between data global scale for environmental monitoring and habitat study,
packets. As a result the energy-aware routing technique over a battlefield for military surveillance and
should be design in such a way that controls and manages reconnaissance, in emergent environments for search and
energy with efficiency. rescue, in factories for condition based maintenance and
process control, in buildings for infrastructure health
monitoring, in homes to realize smart homes, or even in
Internet Sink bodies for patient monitoring [1].

II. RELATED WORK


Energy Efficient Routing is very important factor in
the design of WSNs. The work done by several researchers
User =Sensor node till date is described in this section.

Hady et al. [2] presented in a Low energy Adaptive


Figure 1. Wireless Sensor network Architecture [14]
Clustering Hierarchy Centralized Sleeping Protocol
(LEACH-CS) for wireless sensor networks has been
The main components of communication are:
proposed. LEACH-CS extends the lifetime of wireless
sensor networks by proposing a mechanism that performs an
Sensor nodes have the ability to collect and send
intelligent choice of functioning nodes depending on the
data to the sink wirelessly and communicate with data sensed at the time being. If the data received from
the sink nodes can be single-stage or multi-stage. certain clusters appears insignificant in a period of time,
The base station (sink) that communicates with these clusters are set to sleeping mode till the next data
the user via the Internet or satellite. round.
Alnuaimi et al.[3] described depending on the

22
IJRITCC | August 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 8 22 - 26
_______________________________________________________________________________________________
application, mobile ferries can be used for collecting data in utilization of any preexisting infrastructure. In this paper, we
a WSN especially those at a large-scale with delay tolerant propose an optimal routing protocol for WSN inspired by
applications. A ferry based approach eliminates or the foraging behavior of ants. The ants try to find existing
minimizes the need for multi-hop forwarding of data, and as paths between the source and base station.
a result energy consumption at the nodes will be
significantly reduced especially nodes that are near the base III. FLOWER POLLINATION ALGORITHM
station as they are used by other nodes to forward data to the FPA was developed by Xin-She Yang in 2012 [8],
base station. inspired by the flow pollination process of flowering plants.
Muruganathan et al. [4] presented wireless sensor For simplicity, the following four rules are used:
networks consist of small battery powered devices with 1. Biotic and cross-pollination can be considered
limited energy resources. Once deployed, the small sensor processe of global pollination, and pollen-carrying
nodes are usually inaccessible to the user, and thus pollinators move in a way that obeys Lvy flights
replacement of the energy source is not feasible. Hence, (Rule 1).
energy efficiency is a key design issue that needs to be 2. For local pollination, abiotic pollination and self-
enhanced in order to improve the life span of the network. pollination are used (Rule 2).
Shang and Lei [5] described a network of energy 3. Pollinators such as insects can develop flower
constrained sensors deployed over a region. Each sensor constancy, which is equivalent to a reproduction
node in such a network is systematically gathering and probability that is proportional to the similarity of
transmitting sensed data to a base station (via cluster- two flowers involved (Rule3).
heads). Firstly, we pro-posed an Energy-balanced Clustering 4. The interaction or switching of local pollination
Routing Algorithm called LEACH-L, which is suitable for a and global pollination can be controlled by a switch
large scope wireless sensor network. Secondly, optimum probability p [0,1], slightly biased toward local
hop-counts are deduced. Lastly, optimum position of pollination (Rule 4).
transmitting node is estimated. Simulation results show that
our modified scheme can extend the network lifetime by up For global pollination, pollinators such as insects are
to 80% before first node dies in the network. intend to travel long distances to achieve the global
Yue et al. [6] defined data aggregation is an effectual optimization of reproduction based on flower consistency,
approach for wireless sensor networks (WSNs) to save this can mathematically achieve by:
energy and prolong network lifetime. Cluster-based data
aggregation algorithms are most popular because they have xit+1 = xit + (xit g ) (1)
the advantages of high flexibility and reliability. But the
problem of unbalanced energy dissipation is the inherent Where
disadvantage in cluster based WSNs. xit : is the pollen i or solution vector at iteration t.
Amine et al.[7] discussed main concern of clustering g : is the current best solution found all solutions at the
approaches for mobile wireless sensor networks (WSNs) is current generation/iteration.
to prolong the battery life of the individual sensors and the L : is the strength of the pollination, which essentially is a
network lifetime. For a successful clustering approach the step size. In using Levy`s flight model to mimic the
need of a powerful mechanism to safely elect a cluster-head characteristic of the flying insects efficiently. That is, L >
remains a challenging task in many research works that take from a Levy`s distribution.
into account the mobility of the network.
Kannan and Raja[11] defined wireless sensor ( )sin ( 2 ) 1
network (WSN) provides a significant contribution in the L (s>>s0>0) (2)
S 1+
emerging fields such as ambient intelligence and ubiquitous Where
computing. In WSN, optimization and load balancing of (): is the standard gamma function.This
network resources are critical concern to provide the distribution is valid for large steps s > 0.
intelligence for long duration. Since clustering the sensor For the local pollination, that achieved by abiotic and self-
nodes can significantly enhance overall system scalability pollination based on flower constancy, the mathematical
and energy efficiency this paper presents a distributed representation is as follows:
cluster head scheduling (DCHS) algorithm to achieve the xit+1 = xit + (xjt xkt ) (3)
network longevity in WSN. Where
Eshaftri et al.[12] presented in wireless sensor xjt and xkt are the pollens from the different f lowers of the
Networks (WSNs), clustering techniques are usually used as same plant species.
a key effective solution to prolong the network lifetime by : is local random walk drawn from the uniform [0,1].
reducing energy consumption among the sensor nodes. For the fourth rule, the switch probability p [0,1]
Despite many works on clustering in WSNs this issue is still is used to control the exchange of the pollination process
outstanding. However, the most existing solutions suffer from local to global and vice versa.
from long and iterative clustering cycles.
Amiri et al.[13] focused wireless sensor network IV. PROPOSED MODEL AND METHODOLGY
(WSN) is a collection of sensor nodes that dynamically self- A . Network Architecture
organize themselves into a wireless network without the Network model to be considered in proposed work
23
IJRITCC | August 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 8 22 - 26
_______________________________________________________________________________________________
is based on the model developed by S. Faisal et al. in c) If probability function p [0, 1] is greater than
[9].Network field is divided in three partitions. Partition 0, minimum energy of nodes then global pollination is
Partition 1 and Partition 2, on the basis of energy levels and used otherwise local pollination occurs.
Y co-ordinate of network field. Here it is assumed that a
fraction of the total nodes are equipped with more energy. C. Energy Model
Let m be fraction of the total nodes n, which are equipped
with time more energy than the other nodes. These nodes In [10] the proposed technique Energy Aware Sleep
refer as advance nodes, (1-m) n are normal nodes. Scheduling Clustering based Routing scheme (EASSCR) for
= Partition 0 normal nodes Wireless Sensor Network is used. First order radio model is
= Partition 1 advance nodes adopted here for measuring energy consumption by sensor
= Partition 2 advance nodes nodes while communicating. Equation 4 represents the
= Base station amount of energy consumed for transmitting l bit of data to
Partition 0: Blue Normal nodes are deployed randomly, d distance. Equation 5 represents the amount of energy
lying between 20<Y<=80. consumed for receiving l bit of data subject to circuit loss.
Partition 1: Half of green advance nodes are deployed ETX (l, d) = l Eelec + l fs d2, if d d0
randomly in this zone, lying between 0<Y<=20. = l Eelec + l mp d4, if d d0 (4)
Partition 2: Half of red advance nodes are deployed ERX (l, d) = l Eelec (5)
randomly in Partition 2, lying between 80<Y<=100. Where d refers the transmission distance i.e. distance
is in the middle is a base station. between a member-node and its cluster-head or between
The reason behind this type of deployment is that cluster-head and base station (BS); d0 is threshold distance ;
advance nodes have high energy than normal nodes. As Eelec the energy consumption per bit in the transmitter and
corners are most distant places in the field, so if a node is at receiver circuitry by a node when d < d0 and d d0, where
corner then it requires more energy to communicate with
fs
base station so high energy nodes (advance nodes) deployed d0= . and mp are the energy consumption
mp fs
in Partition 1 and Partition 2.
coefficient of the amplifier.

D. Steps of methodology Flowchart

Deploy a network with n nodes with base station


location BXx and BXy

Create the heterogeneity between the network that


is divide network into three partitions

Deploy the base station in the middle of network

Apply the Flower pollination optimization


Figure 2. Network Architecture
algorithm in middle of network
B. Implementation flower Pollination in the model and data
transmission
If there is Global pollination then send the data to
shortest path /nearest neighbor with multihop
There are 100 nodes out of which 90 normal nodes and
routing
10 advance nodes.
5 nodes in Partition 1 and 5 nodes in Partition 2.
For local pollination send the data directly to the
90 nodes are in Partition 0. base station
Apply Flower Pollination in the Middle of Network that is
in Partition 0.There occur two scenarios.
Partition 0 occurs in two parts on both sides of base station. Simulate and note the results

a) The nodes which are nearer to the base station used


local pollination as they directly send data to base
station. (Self-pollination). Perform the result analysis
b) The nodes which are far away from base station
using multihop routing which find best shortest
path or nearest neigbor to send data to base station Figure 3. Steps of methodology
as global pollination (Cross-pollination).
24
IJRITCC | August 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 8 22 - 26
_______________________________________________________________________________________________
V. SIMULATION
The proposed model has been simulated and studied using
MATLAB environment.The dimensions are 100m100m
and 100 nodes deployed in specific partitions with respect to
their energy. Base station is placed in the middle of the
network field.
Table1. Simulation Parameters

Parameter Value

Network Size 100x100m2


Number of nodes 100

Packet data size 4000 bits

Initial energy E0 0.5 J/node

Minimum energy 0.0001J Figure 4. Alive nodes in LEACH, SEP, Z-SEP and FPOA

Transmitter electronics(Eelec) 50nJ/bit Fig.4 shows the number of alive nodes against rounds. It
clearly shows that proposed technique performs better than
Receiver electronics(Eelec) 50nJ/bit SEP, Z-SEP and LEACH.
Data aggregation energyEDA 5nJ/bit/signal

Amplification energy for short distance (fs)if d 10pJ/bit/m2


d0
Amplification energy for long distance (mp)if d 0.0013pJ/bit/m4
d0
Probability popt 0.1

Number of rounds 3000

VI. PERFORMANCE ANALYSIS OF RESULTS


Comparison results of proposed technique with
SEP, LEACH and Z-SEP. Goals in conducting simulation
are:
To examine the First dead node time in terms of
rounds of LEACH, SEP, Z-SEP and FPOA
To examine the throughput of LEACH, SEP, Z-
SEP and FPOA.
Fig.4, Fig.5 and Fig.6 shows result for the case when Figure 5. First dead nodes in LEACH, SEP, Z-SEP and FPOA
m=0.1and =2.This means that there are 100 nodes out of
which 90 normal nodes and 10 advance nodes. Fig.5 shows the number of dead nodes against rounds. It
According to proposed work 5 nodes will be placed in shows that when first node is dead in terms of rounds. It
Partition 1 and 5 nodes will be in Partition 2. clearly shows that FPOA enhances number of rounds which
in turns less energy consumes.

25
IJRITCC | August 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 4 Issue: 8 22 - 26
_______________________________________________________________________________________________
[3] M. Alnuaimi, K.Shuaib, K. Alnuaimi and M. A. Hafez,
Ferry-Based Data Gathering in Wireless Sensor
Networks with Path Selection, International conference
on Ambient systems,Networks and Technolgies(Elsevier),
vol.52, no.2015, pp.286-293, 2015.
[4] S.D. Muruganathan, D.C.F. Ma, R.I. Bhasin, and A.O.
Fapojuwo, A Centralized Energy-Efficient Routing
Protocol for Wireless Sensor Networks, in IEEE Trans.
Radio Communications, pp.S9-S13, 2005.
[5] F. Shang and Y. Lei, An Energy-Balanced Clustering
Routing Algorithm for Wireless Sensor
Network,Wireless Sensor Network, Scientific Research,
vol.2, no.10, pp. 777-783, 2010.
[6] J. Yue, W. Zhang, W. Xiao, D. Tang and J.
Tang,Energy Efficient and Balanced Cluster-Based
Data Aggregation for Wireless Sensor Networks,
International Workshop on Information and Electronics
Engineering, (Elsevier), vol.29, no.2012, pp.2009-2015,
2011.
[7] D. Amine, B. Nassreddine and K.B.dellah, Energy
Figure 6. Throughput of LEACH, SEP, Z-SEP and FPOA Efficient and Safe Weighted Clustering Algorithm for
Mobile Wireless Sensor Networks, International
Fig.6 shows the throughput of LEACH, SEP, Z- SEP and Conference on Future Networks and
FPOA.Throughput of FPOA is increased and better as Communications(Elsevier), vol.34,no.2015, pp.63-70,
comparative to LEACH, SEP, Z- SEP. 2014.
[8] X-S. Yang, Flower pollination algorithm for global
Table2. Comparison Table When m=0.1 and =2 optimization,In Unconventional Computation and
Technique name First dead Throughput Natural Computation, Springer Berlin Heidelberg,
node(Rounds) (Packets) pp.240-249, 2012.
[9] S. Faisal, N. Javaid, A. Javaid, M. A. Khan, S. H. Bouk
LEACH 961 37860145
and Z. A. Khan, Z-SEP: Zonal-Stable Election Protocol
SEP 1106 66265421
for Wireless Sensor Networks, Journal of Basic and
Z-SEP 1559 405395213
Applied Scientific Research, pp.1-9, 2013.
FPOA 1618 406037490 [10] M. Pramanick, C.Chowdhury, P. Basak, Md. A. Al-
Mamun and S. Neogy, An Energy-Efficient Routing
In Table 2, The results of proposed FPOA compared with Protocol for Wireless Sensor Networks, in IEEE Trans.
LEACH, SEP and Z-SEP which depicts increase in first Applications and Innovations in Mobile Computing
dead node round and throughput . (AIMoC), pp.124-131, 2015.~
[11] G.Kannan, T.S.R.Raja, Energy efficient distributed
VII. CONCLUSION cluster head scheduling scheme for two tiered wireless
In this paper, FPOA is developed for a sensor network, Egyptian Informatics Journal,vol.2015,
no.16, pp.167-174, 2015.
heterogeneous environment. The paper describes FPOA in
[12] M. Eshaftri, A. Y.Al-Dubai, I. Romdhani, M.B. Yassien,
which local and global pollination is done. In local A New Energy Efficient Cluster based Protocol for
pollination nodes send data directly to base station and Wireless Sensor Networks, Federated Conference on
global pollination use multipath routing. The nodes which Computer Science and Information Systems(IEEE),
are closest to base station directly send data to base station. vol.5, pp.12091214, 2012.
Otherwise through multipath routing best path or nearest [13] E. Amiri, H. Keshavarz, M. Alizadeh, M. Zamani and T.
neigbor is used to send data to base station. The Khodadad, Energy Efficient Routing in Wireless Sensor
performance comparison shows that first dead node time in Networks Based on Fuzzy Ant Colony Optimization,
terms of rounds increases and overall energy consumes Hindawi Publishing Corporation International Journal
efficiently to send data packets to base station. Throughput of Distributed Sensor Networks, vol.2014, pp.1-17, 2014.
[14] A. Altememe , Chapter 2- wireless sensor Available:
of FPOA is also increased as compared with LEACH, SEP
http://www.slideshare.net/AhmedTememe/chapter-2-
and Z- SEP. It shows proposed technique performes better wireless-sensor, 2014.
than existing techniques LEACH, SEP and Z-SEP.

REFERENCES
[1] S. K.Singh,,,M. P. Singh andk D. K . Singh, A Survey .
of Energy-Efficient Hierarchical Cluster-Based Routing
in Wireless Sensor Networks, Int. J. of Advanced
Networking and Applications ,vol.2, Issue.2, pp.570-580,
2010.~
[2] A. A. Hady, Sherine M. A.El-kader and Hussein S.Eissa,
Intelligent Sleeping Mechanism for wireless sensor
networks, Egyptian Informatics Journal (Elsevier),
vol.14, pp.109-115, 2013.
26
IJRITCC | August 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________

You might also like