International Journal of Computer Networking,

Wireless and Mobile Communications (IJCNWMC)

ISSN(P): 2250-1568; ISSN(E): 2278-9448
Vol. 6, Issue 5, Oct 2016, 67-76
TJPRC Pvt. Ltd

IMPROVED BEENISH: A ROUTING PROTOCOL FOR ENHANCED

EFFICIENCY IN WIRELESS SENSOR NETWORK
NAVJOT KAUR1 & RAJESH KOCHHER2
1
2

M-tech Student, DAV Institute of Engineering & Technology, Jalandhar, Punjab, India

Assistant Professor, DAV Institute of Engineering & Technology, Jalandhar, Punjab, India

ABSTRACT
Here, the major focus has been on the previous works and their future issues in real life, whatever there has
been seen change issues and drastically increased interest to design under the Wireless Sensor Networks (WSNs). In
recent work done, Wireless sensor networks have more successful used in various important field in real life like
security and military, vibration monitoring health monitoring, and industries etc. Because of the reason that the sensor
nodes has low power, very small size, low cost and self-organizing behavior in easy as well as harsh environments
become the wireless sensor networks as attractive in many types of applications. One of them a huge issue of WSN is
working to development and improvement of energy level better purpose of routing protocols. In this paper, we propose
Improved Balanced Energy Efficient Integrated Super Heterogeneous Protocol (I-BEENISH) with five types of nodes in
efficiency the Cluster Head election probability. Simulation results show that it performs better than existing clustering
protocols by achieving longer stability, lifetime and more effective messages than BEENISH.
KEYWORDS: Beenish Protocol, Wireless Sensor Networks, Improved Beenish, Cluster Head Selection & Base Station

Original Article

lengthening the life span and stability of the network. Our technique is based on changing dynamically and with more

Received: Aug 16, 2016; Accepted: Oct 03, 2016; Published: Oct 06, 2016; Paper Id.: IJCNWMCOCT20168

INTRODUCTION
Wireless Sensor Networks (WSNs) is a field related to sensing movable nodes in networks that have
many different nodes which works for different location which are deployed and place in a particular region by
the sensor using some basic types of protocols. These sensors work with some logical techniques for each protocol
by sense different types of real information from the atmosphere. WSN provides infrastructure having few
wireless station and supports to multiple nodes are independent and self-organizing for sending the information
from one station to other. In current works, it has been seen in real life like environmental traffic, military
surveillance, monitoring, pressure etc.
Clustering is techniques where nodes are bind into clusters having same types of information that are
useful for the energy efficiency more connected with same cluster transit the complete data information related to
them to cluster head (CH) from all existing nodes in wireless sensor network. The main feature of cluster head is
to work efficiently. There has been seen change under different data communication (DC) for sensor nodes and
the different base station in wireless sensor networks. Therefore, cluster head should work high potential in form
of energy as compared to expected different nodes. CH is better in aggregation to data and sends calculate right
data over BS where more number of end-users can access the data for better used in wireless sensor network.
Now, It also has been found that huge amount of energy consumption, may be reduce by making clustering

www.tjprc.org

editor@tjprc.org

68

Navjot Kaur & Rajesh Kochher

scheme, but in clustering scheme, the death time of head node are more important for better performance. In homogeneous
clustering method and heterogeneous clustering method, the Low-Energy Adaptive Clustering Hierarchy protocol named
in short forms known as LEACH; Hybrid Energy-Efficient Distributed Clustering is short forms known as HEED, and the
Threshold-sensitive Energy Efficient Sensor Network protocol is short forms known as TEEN protocols respectively.
These protocols are used for homogeneous WSNs by researchers. In heterogeneous WSNs, all sensor nodes have more
dissimilarity in energy level, and fewer energy nodes demolished due to advancement in first proceed to obtain high energy
sensor nodes. Thus, Distributed Energy Efficient Clustering (DEEC), Enhanced DEEC (EDEEC), EDDEEC and Stable
Election Protocol (SEP), Developed DEEC (DDEEC) and BEENISH are well known heterogeneous WSNs protocols.

Inter-Cluster Technique
In wireless area networks intra and inter cluster techniques can be used. In multiple nodes wireless networks there

are one or more intervening nodes along the path that receive and send the packets via wireless links. As compared to
networks with single wireless links, wireless networks with multiple hops can extend the limit of a network and improve
connectivity. Transmission over many shortened links might require less power for transmission and energy than over
long links. Moreover, they enable higher data rates resulting in higher throughput and more efficient use of the wireless
medium. Wireless networks having multiple hops avoid wide deployment of cables and can be cost effective. In case of
dense networks several paths can be made available that can be used to increase strength of the network. In single-hop
inter-cluster technique member of cluster directly send the data to cluster head which then sends to base station. In
multi-hop inter-cluster technique cluster members send the data to other cluster members and then to cluster head and then
to other cluster head which to nearer to base station.

RELATED WORK

Leach
Low-Energy Adaptive Clustering Hierarchy (LEACH) is an adaptive clustering based homogeneous protocol that

follows same level of energy to all working nodes. It randomly works and selects to nodes by creating cluster head in
optimizing zone. LEACH is more suitable and capable to perform local optimization with minimize the weight age of data
that must be transmitted in organized manner over base station in successful condition. In this process, numbers of rounds
for communication of information are treated. Each rotation carries with set-up phase and steady phase upto completion.
Yet, it has been considered that first phase is the setup phase for cluster creation and CH selection was take place
nearly. CHs make the choice to prepare by the each node under to selected plane including number between 0 and 1.
Threshold depends on measure working formula T (n) = P/ [1-P(n mod 1/P)]. It is used to check a node, which has chance
to become CHs for current working round. In this, P refers to percentage of CHs, n is the number of current working round.
If node contains value less than T (n) it turn into CHs for current round and cannot be CHs for the next one / P rounds.
Therefore probability of remaining nodes must be increased. Node contain value less than T (n) elect itself as CHs and
send message to all other nodes. Succeeding this setup phase steady phase begins. In steady phase CHs node gather all data
from nodes of cluster, makes it shorten and relays it to the sink.

Impact Factor (JCC): 6.2143

NAAS Rating: 3.27

Improved BEENISH: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Network

69

EDDEEC
In case of Enhanced Developed Distributed Energy Efficient Clustering named as EDDEEC [6]. This scheme

supports three-level heterogeneous working in WSNs. It provides similar method of selection for CH. It will base on initial
energy level, last energy level and average energy level of network follows to DEEC. In EDEEC, after few rounds
completion, some super nodes and advanced nodes have similar last energy level as normal nodes under continually CH
selection process. Therefore, it performs to penalize pattern for advance sensor nodes and super sensor nodes. Same issue
rises with DEEC, it proceeds to penalize pattern to advance nodes and DDEEC is restricted until when it works for
two-level heterogeneous networks only.
To avoid this problem, three-level heterogeneous WSNs, EDDEEC works with different function which
described in under EDEEC. It will calculate to computing probabilities of normal nodes, advance nodes and super nodes.
These phenomenons are based on absolute remaining energy level such T

, that provides the value and in hat value

in advance. The super sensor nodes have well energy level similar to case of normal nodes. Using T

, all kinds of

nodes has well probability for CH selection in WSNs.

BEENISH
BEENISH protocol works to similar in DEEC protocol, in such condition, the selecting CH for left over energy

level of the proper nodes; it is widely used to the mean energy of network [2]. However, DEEC is based on normal nodes
and advance nodes. BEENISH uses the new concept of four category of dissimilar nodes such: normal nodes, advance
nodes, super nodes and the ultra-super nodes.
The possibility may arise four types of nodes under in equations (1),(2),(3),(4)
( )
(

)))) ( )

(
(

)(

( )
(

))))( )
( )
)))) ( )

(
(

( )
(

)))) ( )

For normal node

(1)

For advanced node

(2)

For super node

(3)

For ultra-super node

(4)

Here ( ) denotes to average energy at round r of the network, E (r) denotes to residual energy at round r, m, m1
denotes to fraction between node heterogeneity[11],

denotes probability of optimum number of cluster head,

denotes to initial energy and a, b, u is boost a power for advance, super nodes and ultra-super nodes.
This paper explains to WSN, which consider nodes with four different levels of energy. In recent terminology,
Cluster Heads (CHs) are created to elect the nodes on the bases of lasting energy level of nodes [4]. In this surveyed, the
many heterogeneous clustering protocols were proposed for wireless sensor networks and compared using several
parameters such level of heterogeneity, criteria of CH selection process, intra cluster topology structure, data transfer speed
from CH to base station (known as sink node) [5]. It was proposed and evaluated a new distributed energy-efficient
clustering scheme better for different heterogeneous wireless sensor networks, which is named as DEEC. In DEEC
protocol, the cluster-heads are made and elected on probability for proportion between residual energy of each node and

www.tjprc.org

editor@tjprc.org

70

Navjot Kaur & Rajesh Kochher

the average energy of the network. The epochs of being cluster-heads for nodes are treated according to their initial energy
level and residual energy level [6]. Analyzes estimated four routing protocols including- BEENISH, DEEC, TEEN, and
compares by using QualNet simulator. On the basis of performance metrics such as Throughput, Average Jitter and
Average End-to-End Delay, total packets received, packet delivery ratio, and energy consumption in transmit mode,
receive mode, sleep and idle mode [7]. Enhanced Distributed Energy Efficient Clustering or EDEEC [8] was used the
concept of three level heterogeneous networks. It explains of three types of nodes-normal nodes, advanced nodes and super
nodes- based on primary energies. EDEEC explains different probability values for normal, advanced and super nodes.
EDDEEC in [9] provides the same old concept as of DDEEC but in three types of heterogeneous nodes. Therefore, the
research work is being done in the direction of utilizing four types of heterogeneous sensor nodes in the BEENISH
protocol [10] and the selection procedure of cluster head is done on the basis of residual form of energy level for the hops
with reference to the mean energy of sensor network as similar to DEEC.

THE PROPOSED PROTOCOL: IMPROVED-BEENISH

In this section, we present details of our protocol Improved BEENISH. Our proposed protocol also has same idea
of calculating probabilities of choosing cluster head based on initial or first, left over energy level of the nodes and average
energy of network as supposed in DEEC. Our protocol uses inter-cluster technique.
The average energy of rth round from [11] is given as:
(r)= E total (1- )

(5)

R denotes total rounds during network lifetime and can be estimated from [11] as:
R=

(6)

Eround is the energy dissipated in a network during single round and calculated as:
Eround = L(2NEelec + NEDA + kmp

+ Nf s

(7)

Where Eelec is energy used per bit for running circuit of transmitter and receiver. Free space ( f s) model is used if
distance is in less than threshold otherwise multi path (mp) model.
k= number of clusters,
EDA= Data aggregation cost expended in CH
dtoBS= Average distance between CH and BS
dtoCH= Average distance between cluster members and CH
Assuming all nodes are uniformly distributed over network so, dtoBS and dtoCH can be calculated as following
dtoCH=

, dtoBS=0.765

(8)

By finding the derivative of ERound with respect to k to zero, we get the kopt optimal number clusters as in
kopt =

Impact Factor (JCC): 6.2143

(9)

NAAS Rating: 3.27

Improved BEENISH: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Network

71

Our probabilities for choosing cluster head in Improved BEENISH as proposed are given as follows:
( )
(

(
( )(

) )) ( ))

)
(

( )(

) )) ( ))

)
(

( )(

) )) ( ))

)
(

( )(

) )) ( ))

)
(

( )(

) )) ( ))

)
(

) )) ( ))

For normal nodes if E (r) >T

(10)

For advanced nodes if E (r) >T

(11)

For super nodes if E (r) >T

(12)

For ultra-super nodes if E (r) >T

(13)

For ultra-ultra-super nodes if E (r) >T

(14)

for all nodes if E (r) <= T

(15)

Here ( ) is average energy at round r of the network, E (r) is residual energy at round r.x, m, x1, fm is fraction
between node heterogeneity,

is probability of optimum number of cluster head,

is initial energy and b, a, sp,fa is

boost a power for advance, super nodes and ultra super nodes and ultra-ultra super node.
The value of absolute residual energy level, Tabsolute, is written as:
Tabsolute = zE0

(16)

Where, z (0, 1). If z = 0 then we have protocol used in traditional time. In realism, lower energy nodes like
advanced and super nodes may have not become a CH in rounds r, it is also possible that some of them become CH and
same is with the normal nodes. So, actual value of z is not known surely. So Tabsolute = (0.7) E0.
To achieve the most favourable number of CH at beginning of each round, node take decision to become a CH or
not based on probability threshold measured by expression in the following equation
G

( )=
0,

(17)

The node which is under set that belongs to G only they are eligible to be cluster head otherwise the nodes which
already been selected as cluster head in a round gets out of the set of G. So in this way the threshold value selects the
cluster head among the normal, advance, super, Ultra-super nodes and ultra-ultra super nodes by using the value of pi from
the above equations.

SIMULATIONS AND RESULTS

In this section, result for improved BEENISH protocol with five energy levels for heterogeneous WSNs with
MATLAB is presented. WSNs having 100 nodes which are placed in a area of dimension 100m 100m. It has been
assumed that all nodes are either immovable or mobility with less motion. It is also assumed that energy loss due to signal
collision and between signals intervention of dissimilar nodes that are due to dynamic random channel conditions is

www.tjprc.org

editor@tjprc.org

72

Navjot Kaur & Rajesh Kochher

ignored. In this plot, BS is placed at center of network field. The metrics used for interpretation are lifetime, stability
period and packets with data which are successfully sent to BS and cluster head. Simulation or radio parameters considered
for simulation are as follows
Table 1: Simulation Parameters
Parameters
Network Field
Number of Nodes
E0(initial energy
of normal nodes)
Message Size
Eelec
Efs
Eamp
EDA
d0 (threshold distance)
P
Z
C

Values
100 m, 100m
100
0.5J
4000 bits
50nJ/bit
10nJ/bit/m2
.0013pj/bit/m4
5nJ/bit/signal
70m
0.1
0.7
0.2

p is the desired percentage of CH nodes in the sensor population.

We assume a network having 10 normal nodes with E0 energy, 30 advanced nodes with 2.0 times greater energy
than to normal nodes, 30 super nodes with 3 times greater energy than to normal nodes, 20 ultra super nodes with 4 times
greater energy than to normal nodes and 10 ultra ultra super nodes with 5 times greater energy than to normal nodes
The parameters use for the simulation; x=.3, m=.3, x1=.2, fm=.1, b=2, a=3, sp=4, fa=5

Performance Metrics
Here, we briefly describe all the performance metrics which provides more knowledge to study and evaluate the

performance of different Protocols in real life.

Network Lifetime: refers to time period from start of operation until the end of the last alive node complete.

Stability Period: relates to the time difference between the initiation of the simulation operation till the end
of the first node complete.

Instability Period: refers to time period from death of first sensor node until the death of last sensor node.

Number of alive sensor nodes: includes a measure that reflects the total number of sensor nodes that has not
yet used all of their energy in whole process.

Network energy consumption: includes a measure to find the total energy dissipation of the wireless sensor
network. It is calculated at each round of the protocol under working condition. Less the energy dissipation
means to longer lifetime of network.

Throughput: It defines measure the total rate of data sent by sensor nodes of network. Longer the lifetime is
required in network where the data is required from the network until the death of last node even that data is
unreliable. If we need reliable data then stability period should be long and smaller the instability period.

Impact Factor (JCC): 6.2143

NAAS Rating: 3.27

Improved BEENISH: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Network

73

Packets to BS: It the number of packets sent to base station. In packets to base station, the data is sent to each
sensed station to check the load of each station in wireless region. Figure 1 compares the data sent to BS in case of
I-BEENISH and BEENISH the throughput; the packets sent to Base Station are found to be much enhanced after
implementing the proposed approach.

Figure 1: Packets Sent to Base Station

Table 2: Number of Packets Sent to Base Station
b/w BEENISH and I-BEENISH
Number of
Rounds
4000
8000
12000
16000
18000

Number Of Packets Sent

To Base Station(* 105)
BEENISH I- BEENISH
2.01
2.05
3.70
3.85
4.25
5.0
4.26
5.45
4.26
5.5

Dead Nodes:
If the sensor node is deployed in the field becomes faulty. The faulty node is also known as dead node. The node

whose energy get reduced to zero becomes dead. Figure 2 depict number of dead nodes during lifetime of network. Here
we have found that first and last node in case of I-BEENISH dies earlier as compared to BEENISH. First node for
I-BEENISH dies at 2143 and BEENISH dies at 1229 rounds and all nodes dies at 19000 and 12652 rounds respectively

Figure 2: Number of Dead Nodes

www.tjprc.org

editor@tjprc.org

74

Navjot Kaur & Rajesh Kochher

Table 3: Number of Dead Nodes b/w BEENISH and I-BEENISH

Number of
Rounds
4000
8000
12652
18000
19000

Number of Dead Nodes

BEENISH I- BEENISH
14
5
62
32
100
78
97
100

Packets to CH
It the number of packets sent to CH. In Cluster heads, packets are created at each level to measure the

performance of each protocol. Figure 3 shows that packets to cluster head in case of I-BEENISH is more as compared to
BEENISH

Figure 3: Packets Sent to Cluster Head

Table 4: Number of Packets Sent to Cluster Head
b/w BEENISH and I-BEENISH
Number of
Rounds
4000
8000
12000
16000
18000

Number Of Packets Sent To

Cluster Head(* 104 )
BEENISH
I- BEENISH
4.24
4.42
7.06
8.18
8.44
10.67
8.54
12.39
8.54
12.61

CONCLUSIONS
In this paper, Improved BEENISH protocol is proposed for WSNs. Improved BENISH is flexible energy
conscious protocol which changes the possibility of nodes to become a CH in a useful way to disburse equal amount of
energy between sensor nodes. We observe the performance of protocol by performing simulations to check the usefulness
of newly proposed protocol. The selected metrics used for simulation for this study are network lifetime, stability period
and packets sent to BS.. Improved BEENISH is proved to be the most efficient protocol as compared to BEENISH for all
types of WSNs based on the factors of stability period, network lifetime and throughput.

Impact Factor (JCC): 6.2143

NAAS Rating: 3.27

Improved BEENISH: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Network

75

REFERENCES
1.

F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.Cayirci, A survey on sensor networks, IEEE Communications Magazine,
Vol.40, No.8, pp.102-114, 2002

2.

T.N. Quereshi, N.Javaid, A.H. Khan,A. Iqbal, E.Akthar, M.Ishfaq, BEENISH: Balanced Energy Efficient Network Integrated
Super Heterogeneous Protocol for Wireless Sensor Networks International workshop on Body Area Sensor Networks, pp:
914-919, 2013.

3.

Li Qing, Qingxin Zhu, Mingwen Wang, Design of a distributed energy-efficient clustering algorithm for heterogeneous
wireless sensor networks, Computer communications, pp: 2230-2237, 2006.

4.

B. Elbhiri, R. Saadane, S. El Fkihi, D. Aboutajdine, Developed Distributed Energy-Efficient Clustering (DDEEC) for
heterogeneous wireless sensor networks, 5th International Symposium on I/V Communications and Mobile Network (ISVC),
2010.

5.

Jaspinder Kaur, and Varsha Sahni, A New Approach for Energy efficient Linear Cluster Handling Protocol In WSN,
International Journal Of Computer Science And Information Security, Vol.14 No.3,2016

6.

Parul Saini,ParveenSharma, Enhanced Distributed Energy Efficient Clustering Scheme for heterogeneous WSN, 1st
International Conference on Parallel, Distributed and Grid Computing 2010

7.

N. Javaid, T. N. Qureshi, A.H. Khan, A. Iqbal, E. Akhtar, M. Ishfaq, Enhanced Developed Distributed Energy-Efficient
Clustering for HeterogeneousWireless Sensor Networks, International Workshop on Body Area Sensor Networks,2013

8.

G. Smaragdakis, I. Matta, A. Bestavros,SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor
network, in: Second International Workshop on Sensor and Actor Network Protocols and Applications (SANPA), 2004.

9.

Parul Saini, Rohit.K.Sharma, E-DEEC- Enhanced Distributed Energy Efficient Clustering Scheme for heterogeneous WSN,
in: 2010 1st International Conference on Parallel, Distributed and Grid Computing (PDGC - 2010).

10. Jaspinder Kaur, Varsha Sahni A survey on hierarchical cluster routing protocols of WSN, International Journal Of
Computer Applications, Vol.130, No.17, 2015
11. N. Javaid, T.N.Qureshi, A.H.Khan, A. Iqbal, E. Akhtar, M.Ishfaq, EDDEEC: Enhanced Developed Distributed EnergyEfficient Clustering for Heterogeneous Wireless Sensor Networks, International Workshop on Body Area Sensor Networks
(BASNet-2013), pp.914-919, 2013.
12. M. Yarvis, N. Kushalnagar, H. Singh, Exploiting heterogeneity in sensor networks, Proceedings of 24th Annual Joint
Conference of the IEEE Computer and Communications Societies (INFOCOM),Miami, FL, United States, pp. 878-890,2005.
13. Li Qing, Qinqxin Zhu, and Ming en Wang, Design of a distributed energy-efficient clustering algorithm for heterogeneous
wireless sensor networks, Com uter Communications Journal Elsevier, vol. 29, issue 12, pp 2230- 2237, 2006.
14. S.K. Singh, M.P. Singh, and D.K. Singh, Energy-efficient Homogeneous Clustering Algorithm for Wireless Sensor Network,
International Journal of Wireless & Mobile Networks (IJWMN), Aug. 2010, vol. 2, no. 3, pp. 49-61

www.tjprc.org

editor@tjprc.org