Mobility-Zonal Based Stable Election Routing Protocol For Wireless Sensor Networks

IPASJ International Journal of Computer Science (IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

A Publisher for Research Motivation ........ Email:editoriijcs@ipasj.org
Volume 6, Issue 10, October 2018 ISSN 2321-5992
MOBILITY-ZONAL BASED STABLE

ELECTION ROUTING PROTOCOL FOR
WIRELESS SENSOR NETWORKS
M.Muthumalathi1, Dr. P.B.Pankajavalli2
1
Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore, india,
2
Assistant Professor, Department of Computer Science, Bharathiar University, Coimbatore, india,
ABSTRACT
Wireless Sensor Network contains huge number of sensor nodes that co-operate to achieve sensing performance in a
particular environment. Sensor network information is routed from one sensor node to another sensor node using
variety of routing protocols. Different routing Protocols are designed for transmission in wireless sensor networks.
Energy consumption is a major issue in sensor network, so many researchers are carried out in energy efficient
routing protocols. This paper describes routing technique, types of routing protocol based on the structure and
operation of the sensor network. The proposed Mobility Zonal based Stable Election Protocol, detects the mobility of
nodes in the sensor network and improves the protocol performance in terms of stability period and network lifetime.
Simulation results show that Mobility Zonal based Stable Election Protocol (Mob-ZSEP) performs better than the
existing protocols Stable Election Protocol (SEP) and Zonal Stable Election Protocol (Z-SEP).
Keywords: Sensor nodes, Clustering technique, Energy efficiency, Routing protocol.
1. INTRODUCTION
Wireless sensor networks (WSNs) are usually battery operated devices and these batteries are not again rechargeable.
WSNs are collection of large sensor node having restricted resources and limited battery power [1]. Sensor nodes are
used to monitor and detect atmosphere conditions, such as temperature, pressure, humidity and sound etc. Routing
protocols for WSNs are important for selection route in the networks and have to make certain reliable communication
path links [2]. The ability of a single node is less but the total power of every network is enough to accomplish the user
defined performances. WSNs have minimum infrastructure, whereas wireless connections are unpredictable. The sensor
nodes are compactly arranged either within the sink or very close to it and have minimum battery power, computational
capacity and memory capacity.
One of the essential difficulties in the organization of the WSNs is energy efficiency and stability because battery
capacities of sensor nodes are restricted and replacing them is impossible. Since, sensor nodes utilize maximum amount
of energy for data transmission and data aggregation; therefore, new energy efficient routing protocols are necessary to
save energy consumption. Routing protocol in WSNs is responsible for determining and preserving energy efficient
routes in the network, in order to make communication reliable and energy efficient [3]. Due to the limitation in the
kind of network, the major goal of routing protocol architecture is increasing the network life time by keeping the
sensors alive as much as possible.
A sensor network can be made scalable by collecting the sensor nodes into groups i.e. clusters. Clustering technique
allows the sensor network to work more efficiently. It increases the energy consumption of the sensor network and
hence the network lifetime. WSNs must provide support for a suite of application specific protocols that significantly
reduce node size, cost, and power consumption for their target application. There are number of technique in WSN to
handle these problems associated with in the network. Clustering is one of technique in WSN to handle such problems
[4]. The main role of Cluster Head (CH) is to provide data communication between sensor nodes and base station
efficiently. So CH should have more energy than other sensor nodes, and also it performs the data aggregation [5].
All the nodes in the sensor network form a cluster and then they form a CH and transmit their data to their
corresponding CH. CH performs processing on the data sent to it and then transmit it to the BS. Since energy is
consumed more in the transmission than in sensing, so the CH maintains its own cluster in the given period. It uses
Volume 6, Issue 10, October 2018 Page 1

TDMA to allocate the slots to each node to transmit the data to it and transmits the data to the CH and then on
reception the CH sends the data to the base station.
This paper proposes a new Mob-ZSEP protocol which selects CH based on maximum energy consumption. The result
shows Mob-ZSEP outperforms SEP and Z-SEP in terms of stability, network life time and energy efficient.
2. ROUTING TECHNIQUE
WSN routing protocols can be classified into two extensive groups, first one is network architecture based routing
protocol, another one is operation based routing protocols.
2.1. Structure Based Routing Protocols
2.1.1 Flat Routing: In this routing technique, all the sensor nodes assume identity roles such as collecting data and
communicating with the sink, i.e. every one of the information gathered in the remote zone can be similar or duplicated.
Rumor routing protocol is suitable for flat routing type [6].
2.1.2 Hierarchical Routing: In hierarchical routing technique all the routing sensors in the network are clustered and a
CH collect the data and checks for excess of the data that is gathered before it is send to the sink. This saves
communication, processing work and also saves energy consumption. Few hierarchical routing techniques are LEACH,
TEEN and APTEEN.
2.1.3 Location-based Routing: Location information for sensor nodes is needed to calculate the distance between two
specific nodes so that energy consumption can be estimated. So in location-based protocols, sensor nodes are addressed
by means of their locations areas. GEAR is the location based routing protocol [7].
2.2 Protocol Operation Based Routing Protocols
2.2.1 Multi path-based: These protocols are well-organized in handling various paths. Sensor nodes send the collected
information on multiple paths rather than using a single path. The reliability and fault tolerance of the network
increases as long as it is possible.
2.2.2 Query-based: In query-based routing protocol the utilization of queries are issued by the base station. The base
station sends queries asking for certain information from the nodes in the network. A node, which is responsible for
monitoring and gathering data, reads these queries and if there is a match with the information asked for in the query it
begins sending the data to the demanded node or the base station. SPIN protocol is best suitable for query based
technique [8].
3. DESIGN ISSUE OF ROUTING PROTOCOLS
 Scalability: Routing protocols must be sufficiently enough to respond to the events like enormous increase of sensor
nodes in the atmosphere field [9].
 Operating Environment: Sensor nodes may be arranged in any atmosphere conditions.
 Power Consumption: Sensor nodes are equipped with restricted battery size for the lifetime.
 Data aggregation: Data from the normal nodes are to be combined and transmitted to the cluster head of the cluster
[10].
 Network Dynamics: Sensor nodes are further portable and accordingly sensor network is not static.
 Fault Tolerance: Fault tolerance is the capacity to manage sensor network functionalities without any interruption due
to sensor node failure [11].
4. LITERATURE REVIEW

4.1 Stable Election Protocol (SEP)

In SEP the nodes are separated into two type’s normal nodes and advanced nodes, normal node is the nearest neighbor
node of base station and the maximum distance from the base station node is consider as advanced node, which has
more energy than the normal nodes. In this network the CH are formed based on the possibility. In this way, SEP
increases stability period and network life time is accomplished and also it can increase the performance of the sensor
network. [12]
The SEP protocol considers the energy level in the primary node selection process. To delay the adjustment time, SEP
attempts to maintain its energy utilization limit. Advanced nodes become CH which has more energy than normal
nodes. The aggregate energy of the system differs. Assuming the initial energy of the normal node is Eo. The energy of
the advanced node is set to Eo * (1 + a) [13]. (1 + a*m) times is set to increase the stability of the sensor node. The
probability that the normal node becomes CH is 1 and the advanced node becomes CH is 1+a. Pnrm is defined as the
probability of selecting energy for normal nodes and Padv is the probability of selecting energy for advanced nodes.
Proportion of advanced nodes is consider as ‘m’ and additional energy factor among advanced and normal nodes is
consider as ‘a’. So the election probabilities for normal node and advanced nodes are [14].
Election Probability for Normal Nodes
Pnrm=( p/ (1+a*m) ) (1)
Election Probability for Advanced Nodes

Padv= ( p*(1+a)/(1+a*m) ) (2)
SEP uses an election probability based on the initial energy of every node to choose the CH by assigning a weight equal
to the initial energy of every node separated by initial energy of the normal nodes. The weighted probabilities for
normal and advanced nodes in SEP were selected to reproduce the extra energy introduced into the network system.
4.2 Zonal Stable Election Protocol (Z-SEP)

Z-SEP utilizes two effective methods to transmit data to base station. Methods are direct communication and
transmission via cluster head. Z-SEP consider 3 zones zone 0, head zone 1, head zone 2.
In direct Communication, Sensor nodes in Zone 0 send their data directly to base station. Normal nodes sense the
environmental conditions collect the data and it sends the information directly to base station [15]. In transmission via
Cluster head, sensor nodes in Head zone 1 and Head zone 2 transmit data to base station through clustering algorithm.
CH is selected based on the zone and it’s classified into Head zone 1 and Head zone 2. CH gather the data from cluster
member nodes which collect and transmit it to base station. CH selection is very important and cluster is formed only in
advance nodes. Assume an optimal number of clusters Kopt, ‘n’ is the number of advance nodes [16]. ‘m’ is the
proportion of advanced nodes and ‘a’ is the additional energy factor between advanced and normal nodes
Z-SEP optimal probability of cluster head is
Popt = kopt/n (3)
Each node decides CH to be placed in this round or next round. A random number between 0 and 1 is created for
node. If this random number is less than or equal threshold T(n) for a node then that is selected as a CH. Threshold of
T(n) is consider as Equation (4) and G is the set of nodes that not been CH
(4)
Equation (5) describe probability for advance nodes to become CH is
Padv = popt / 1+ (a, m)*(1+a) (5)
Equation (6) describe threshold for advanced nodes
(6)

After the CH is formed the CH sends a commercial message to its member nodes so the nodes come to know to which
CH they belong to. CH then assigns a Time Division Multiple Access (TDMA) scheduling so every node sends data to
the CH in the slot assigned. When the data is received the CH aggregates this data and send it to the base station [17].
5. PROPOSED MOBILITY- ZONAL BASED STABLE ELECTION PROTOCOL (Mob-
ZSEP)
The existing protocols (SEP, Z-SEP) are using probabilistic techniques for selecting the CH in senor node, the selection
of CH is done based upon received signal strength and weight. However, in Mob-ZSEP the CH selection is completely
based on the maximum energy. In a particular area, the node with maximum energy is selected as the CH in the current
round.
Figure 1 Mob-ZSEP Network Architecture

The proposed Mob-ZSEP protocol is extension of Z-SEP, this section discuss in detail about the functioning of the Mob-
ZSEP protocol. Most of the routing protocol aim is to minimize energy consumption. Here sensor network field is
divided in three Zones: Zone 0, Zone 1 and Zone 2 on the basis of distance from the base station. Figure 1 shows
placement of zones in the network. Zone 0 are normal nodes which are deployed randomly lying between 30<Y<=80.
Zone 1 are advanced nodes which are deployed randomly lying between 0<Y<=30. Zone 2 are advanced nodes which
are deployed randomly lying between 80<Y<=100. The reason behind this type of deployment is that advanced nodes
have high energy than normal nodes. It requires more energy to communicate with the base station so these Zone 1 and
Zone2 nodes are considered as advanced node.
The nodes in the Zone 0 send data directly to the base station whereas the nodes in the Zone 1 and 2 transmit data to
base station via CH. Equation (3) is applied to select CH at initial stage of Mob-ZSEP. The CH is selected among
advanced nodes, whereas sensor nodes under particular cluster can either be fixed or variable. If any node moves from
normal node to advanced node than CH calculation is done based on energy, then cluster member will receive a
message from the newly selected CH. Equations (1) and (2) are applied for selecting normal nodes and advanced node
at initial stage of Mob-ZSEP. Equation (6) calculates threshold value for advanced nodes which is helpful to find the
location of CH. After mobility of nodes, CH selection will be done based on the Equation (7).
Probability for advance nodes to become CH is proposed
Pmob= (p*(1+b)/(1+(b*m)) (7)
p - Optimal probability of cluster head
m - Advanced node of proportion
b - Mobility nodes energy
The use of probability technique at cluster will also be done for better selection of CH with maximum energy of node.
Normal nodes are placed near the base station and they transmit their data directly to base station. However advance
nodes are deployed far away from base station as they have more energy. If advance nodes transmit data directly to base
station, more energy is consumed. So, cluster technique is applied only in advanced node to save energy. Mob-ZSEP

protocol effectively considers the mobility node performance, for effective stability period, network lifetime, and energy
consumption. Figure 2 illustrate the Mob-ZSEP operation.
6. SIMULATION RESULTS
The principle of this research is to compare performance of the Mob-ZSEP and the existing protocol and to prove that
this protocol has a better performance in energy consumption, stability period and longer network life. The proposed
protocol is enhanced from SEP and Z-SEP in terms of stability. SEP performs better than LEACH in two level
heterogeneity node, because SEP has weight probability for selection of cluster head for both normal nodes and advance
nodes. Mob-ZSEP performs better than SEP and Z-SEP because nodes in Zone 0 (normal nodes) transmits data directly
to base station while nodes in zone 1 and zone 2 communicates via cluster head to base station. In this section the
comparison of proposed technique with SEP and Z-SEP is discussed. The evaluation and implementation is done in
MATLAB. The simulation has been performed in the network of 100 nodes and placed randomly in the network.
Figure 2 Flow chart of Mob-ZSEP

The simulation parameters are m= 0.1, a=1, b=2. Network containing 70 normal nodes has E0 energy, 30 advanced
nodes having ‘a’ time greater energy as compare to normal node. Mobility of the node having ‘b’ times greater energy
as compare to both normal and advanced node.
Parameters Value
Number of nodes 100
Number of rounds 9000
Node deployment Random

Field area 100*100m

Packet size 500Byte
Initial Energy E0 0.5J
Initial energy of advanced nodes E0(1+a)
Energy of date aggregation EDA 5 Jn/bit/signal
Probability p 0.1
Table:1 Simulation parameter
Simulation results are based on the following measurements:
 Stability Period: Time interval from the beginning of the network to the death of the first sensor node.
 Instability Period: Time interval from the death of the first sensor node to the death of the last sensor node.
 Throughput: The aggregate rate of information sent over the network, the rate of information sent from cluster
heads to base station and additionally the rate of information sent from the nodes to base station.
 Network Lifetime: Time interval from the beginning of the network to the death of the last alive sensor node
[18].
The simulation result shows the comparison of SEP, Z-SEP and Mob-ZSEP on three parameter (i) number of alive
nodes (ii) number of dead nodes and (iii) packet send to the base station. Goals in conducting simulation are
 To examine the stability period of Mob-ZSEP, Z-SEP and SEP.
 To describes the throughput of Mob-ZSEP Z-SEP and SEP
Figure 3 Comparison of Alive nodes

Figure 3A Comparison of Alive nodes with round specification
Figure 4 Comparison of Dead nodes
Figure 5 Comparison of packet send to base station
Figure 5 show the comparison of packet send to base station is calculated for all routing protocols i.e. for SEP, Z-SEP
and proposed Mob-ZSEP. It shows that proposed modified Mob-ZSEP is efficient in successful packet delivery and the
result show Mob-ZSEP performs better.
Simulation result show that the proposed Mob-ZSEP based routing protocol shows better performance in terms of
energy consumption, Alive node, Dead node and packet transmission. Figure 3, 4 and 5 describes comparison of Mob-
ZSEP with Z-SEP and SEP, the result show Mob-ZSEP performs better based on stability period, network lifetime and
energy efficiency.
Mob-ZSEP is same as Z-SEP but only the difference mobility of the node that means some node moving from normal
node to advance node and vice versa. So again recalculate clustering technique and communicate to the base station.
Results of SEP and Z-SEP is less than Mob- ZSEP because only cluster head send data to base station and cluster head
selection is based on the energy.
7. CONCLUSION
Energy consumption of routing strategy is a major optimization issues relating to WSNs applications in common. Since
Senor Networks are usually have battery powered equipment, the rate of energy consumption of these sensor devices
must be accurately managed in order to extend the network lifetime and usefulness for a reasonable period. Managing

the energy consumed by these SNs can be significant testing problem in view of the network structure and formulations.
However, researchers have proposed various strategies for managing with the energy consumption in WSNs, during
data transmission. In this paper proposed Mob-ZSEP efficient energy based routing protocol approach gives a longer
network lifetime, stability period as compared with the SEP and Z-SEP existing protocol. Clustering is an efficient
technique to reduce energy consumption and to provide stability of network in wireless sensor networks. In future, a
new and improved cluster based routing protocol can be developed to enhance the network lifetime and to optimize the
energy level of a node for better selection of cluster head.
References
[1] D. Kumar, T.C. Aseri and R.B. Patel, EECDA: Energy Efficient Clustering and Data Aggregation Protocol for
Heterogeneous Wireless Sensor Networks, Int. J. of Computers, Communications & Control, ISSN 1841-9836, E-
ISSN 1841-9844,Vol. VI (2011), No. 1 (March), pp. 113-124.
[2] Brijbhushan and Sakshi Anand, A Survey- Wireless Sensor Networks Routing Protocols, International Journal of
Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 4, Issue 2, February
2015.
[3] Santar pal singh and s. c. Sharma, A survey on Cluster Based Routing Protocols in Wireless sensor Networks,
Elseiver, International Conference on Advanced Computing Technologies and Application (ICACTA 2015).
[4] Parul and Saini, Energy Efficient Scheme for Clustering Protocol Prolonging the Lifetime of Heterogeneous
Wireless Sensor Networks, International Journal of Computer Applications (0975 – 8887) Volume 6– No.2,
September 2010.
[5] Pankaj Sharma and Sukhbeer Singh, Data Compression on Enhanced Z-SEP for Effective Energy Utilization
Technique, International Journal of Computer Science Trends and Technology (IJCST) – Volume 4 Issue 5, Sep -
Oct 2016.
[6] Ankit Aggarwal and Mahesh Kumar, A Survey of Routing Protocols in Wireless Sensor Network, International
Journal of Advanced Research in Computer Science and Software Engineering Volume 5, Issue 6, June 2015
ISSN: 2277 128X.
[7] Xuxun Liu, A Survey on Clustering Routing Protocols in Wireless Sensor Networks, Sensors 2012, 12, 11113-
11153; doi:10.3390/s120811113, ISSN 1424-8220.
[8] Archana Chauhan and Praveen Sharma, A Review on Routing Protocols For Wireless Sensor Network,
International Journal of Science, Engineering and Technology Research (IJSETR), Volume 4, Issue 6, June 2015.
[9] Debnath Bhattacharyya, Tai-hoon Kim and Subhajit Pal, A Comparative Study of Wireless Sensor Networks and
Their Routing Protocols, Sensors 2010, 10, 10506-10523; doi:10.3390/s101210506 ISSN 1424-8220.
[10] Shio Kumar Singh, M P Singh, and D K Singh, Routing Protocols in Wireless Sensor Networks – A Survey,
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.1, No.2, November 2010.
[11] Rajesh Chaudhary et al, A TUTORIAL OF ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS
International Journal of Computer Science and Mobile Computing ISSN 2320–088X, Vol.3 Issue.6, June- 2014,
pg. 971-979.
[12] G.Chandini, Rajavali Guntur, and K. W. Rajesh Guntur, Energy Efficient Zonal Stable Election Protocol for
WSNs International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE)
Volume 3, Issue 12, December 2014.
[13] Phan Thi The, Ngo Quang Quyen, Vu Ngoc Phan and Tran Cong Hung, A PROPOSAL TO IMPROVE SEP
ROUTING PROTOCOL USING INSENSITIVE FUZZY C-MEANS IN WIRELESS SENSOR NETWORK
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.6, November 2017.
[14] C.Divya, N.Krishnan and T.Gandhi mathy, Energy Efficient Stable Election Protocol for Clustered Heterogeneous
Wireless Sensor Networks, IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN:
2278-8727Volume 12, Issue 5 ,Jul. - Aug. 2013, PP 55-61.

[15] Banoth Thirumala, B.Vijay kumar and Aloth Sowjanya, Zonal-Stable Election Protocol for Wireless Sensor
Networks International Journal of Ethics in Engineering & Management Education Website: www.ijeee.in, ISSN:
2348-4748, Volume 3, Issue 10, October 2016.
[16] S.A. Sahaaya Arul Mary, Gnanadurai Jasmine Beulah, A Zone-Based Clustering Protocol for Wireless Sensor
Networks, Advances in Information Science and Computer Engineering. ISBN: 978-1-61804-276-7.
[17] N. Javaid1, T. N. Qureshi, A.H. Khan, A. Iqbal, E. Akhtar and M. Ishfaq EDDEEC: Enhanced Developed
Distributed Energy-Efficient Clustering for Heterogeneous Wireless Sensor Networks, Elsevier, International
Workshop on Body Area Sensor Networks (BASNet-2013).
[18] Nuray AT and Daraghma SM, A New Energy Efficient Clustering-based Protocol for Heterogeneous Wireless
Sensor Networks, Journal of Electrical & Electronic Systems, doi:10.4172/2332-0796.1000161,2015.
AUTHORS
M. Muthumalathi is a Research Scholar, Department of Computer Science, School of Computer Science and
Engineering, Bharathiar University, Coimbatore, Tamil Nadu. She has completed her post-graduation and under
graduation in Nirmala college for women, Coimbatore. She has presented paper in one international conference.
P. B. Pankajavalli Phd, is an Assistant Professor in the Department of Computer Science, School of Computer
Science and Engineering, Bharathiar University, Coimbatore, Tamil Nadu, India. She has published more than 30
papers in journals, Conferences proceedings both at National and International level, 3 book chapters and filed an
Indian patent. She has received Best Teacher Award from Lions Club, Erode. Her areas of interest include Ad-hoc
Networks, Wireless Sensor Networks and Internet of Things.

Mobility-Zonal Based Stable Election Routing Protocol For Wireless Sensor Networks

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Mobility-Zonal Based Stable Election Routing Protocol For Wireless Sensor Networks

Caricato da

Copyright:

Formati disponibili

IPASJ International Journal of Computer Science (IIJCS)

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

MOBILITY-ZONAL BASED STABLE

Volume 6, Issue 10, October 2018 Page 1

2.1. Structure Based Routing Protocols

2.2 Protocol Operation Based Routing Protocols

3. DESIGN ISSUE OF ROUTING PROTOCOLS

Volume 6, Issue 10, October 2018 Page 2

4.1 Stable Election Protocol (SEP)

Election Probability for Advanced Nodes

4.2 Zonal Stable Election Protocol (Z-SEP)

Volume 6, Issue 10, October 2018 Page 3

Figure 1 Mob-ZSEP Network Architecture

Volume 6, Issue 10, October 2018 Page 4

Figure 2 Flow chart of Mob-ZSEP

Volume 6, Issue 10, October 2018 Page 5

Field area 100*100m

Figure 3 Comparison of Alive nodes

Volume 6, Issue 10, October 2018 Page 6

Figure 3A Comparison of Alive nodes with round specification

Figure 4 Comparison of Dead nodes

Figure 5 Comparison of packet send to base station

Volume 6, Issue 10, October 2018 Page 7

Volume 6, Issue 10, October 2018 Page 8

Volume 6, Issue 10, October 2018 Page 9

Potrebbero piacerti anche