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

net/publication/282927333

Improvement of the Wireless Sensor Network Lifetime using LEACH with Vice-
Cluster Head

Article in Ad Hoc & Sensor Wireless Networks · August 2015

CITATIONS READS

58 3,327

4 authors, including:

Amjad Mehmood Jaime Lloret

Kohat University of Science and Technology Universitat Politècnica de València
48 PUBLICATIONS 975 CITATIONS 784 PUBLICATIONS 11,981 CITATIONS

SEE PROFILE SEE PROFILE

Houbing Song
Embry-Riddle Aeronautical University
458 PUBLICATIONS 13,285 CITATIONS

SEE PROFILE

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

DDoS attack mitigation at edge level of network with help of Artificial Intelligence Agents based solution. View project

Application of machine learning to data networks View project

All content following this page was uploaded by Jaime Lloret on 28 September 2016.

The user has requested enhancement of the downloaded file.

Improvement of the Wireless Sensor Network Lifetime using
LEACH with Vice-Cluster Head
Amjad Mehmood1, Jaime Lloret2, M. Noman3, Houbing Song4
1, 3
Institute of Information Technology, Kohat University of Science & Technology, Pakistan
2
Integrated Management Coastal Research Institute, Universidad Politecnica de Valencia, Spain
4
Department of Electrical and Computer Engineering, West Virginia University Montgomery, USA
1
amjadiitkust@gmail.com, 2jlloret@dcom.upv.es, 3mnoman55@gmail.com, 4h.song@ieee.org

Abstract

A wireless sensor network (WSN) consists of large number of spatially distributed, wirelessly
connected, self-governing sensor nodes, which are generally deployed in harsh environments. These
sensor nodes need energy to sense, process and transmit information, but their energy is limited.
Therefore, there is a need to design an energy efficient routing protocol to extend the lifetime of a
WSN. In this paper, we propose a novel cluster based routing protocol called LEACH-VH, in which a
new node type called Vice Cluster Head (VH) is introduced in addition to Cluster Head (CH). In a
cluster, the node with the highest residual energy among all nodes is selected as the CH, and the node
with second highest residual energy is selected by the CH as the VH, which serves as a backup node of
the CH. The selected VH goes to sleep mode and, when the energy of the CH decreases below a low
threshold value, say 10%, the VH wakes up to act as the CH and selects its VH. It has been
demonstrated that the lifetime of a WSN increased up to 47% compared with LEACH (Low Energy
Adaptive Clustering Hierarchy) routing protocol.

Keywords: Wireless Sensor Network, Cluster Head, LEACH, Clustering, Low Energy Consumption, VH,
LEACH-VH, Lifetime.

1 Introduction
Wireless Sensor Networks (WSNs) could be applied in a variety of applications ranging from

battlefield reconnaissance to environmental protection [1-3]. A WSN consists of spatially

distributed autonomous sensor nodes with the capabilities of sensing, processing and

transmitting information to monitor physical or environmental conditions, such as temperature,

sound, humidity, pressure, etc. [4-10].

1
Sensor nodes are powered by batteries but the battery life of a sensor node is limited. In many

applications, it is impossible to recharge or replace the battery of a sensor node. Therefore an

efficient energy-aware routing protocol is highly desirable. A huge number of protocols have

been developed to improve the energy efficiency of a WSN [11-13]. These protocols could be

categorized into flat based protocols and hierarchical based protocols and it is found that the

latter are more energy efficient than the former. The comparison between these two categories

is given in Table 1.

Hierarchical based Routing Flat based Routing

Channel Reservation-based scheduling Contention-based scheduling
Collisions is avoided Collision over-head in attendance

Reduced duty cycle due to periodic sleeping
Data aggregation by the Cluster Head
Simple but non-optimal routing
Requires global and local synchronization
Overhead of cluster formation all over the
network
Lower latency as multiple hops network
produced by CHs always available
Energy dissipation is Consistent
Energy dissipation cannot be controlled
Fair of channel allocation
Table 1: Comparison between Flat based and Hierarchical based Routing Protocols
Variable duty cycle by controlling sleep time of
nodes
Node on multi-hop path aggregates incoming
data from neighbors
Routing can be made optimal but with an added
complexity.
Links formed on the fly without synchronization
Routes formed only in regions that have data for
transmission
Latency in waking up intermediate nodes and
setting up the multipath
Energy dissipation depends on traffic patterns
Energy dissipation adapts to traffic pattern
Fairness is not guaranteed

Generally, hierarchical protocols are round based with each round comprising a setup phase

and a steady phase. Further, a setup phase is divided into cluster selection and cluster formation

and a steady phase consists of data aggregation and data communication. To increase the

2
lifetime of a WSN, a variety of protocols have been developed, including chain based, grid

based, and cluster based, out of which, cluster based approaches are more energy efficient [14,

15]. Low Energy Adaptive Clustering Hierarchy, also called LEACH is a well-known protocol

to improve the life time of a WSN [16]. The objective of this paper is to propose a novel

routing protocol called LEACH-VH to improve the performance of the LEACH protocol. In

LEACH-VH, a new node type called Vice Cluster Head (VH) is introduced into a cluster in

addition to Cluster Head (CH). The difference of LEACH-VH from LEACH lies in the

selection of the node with second highest residual energy by the CH as the VH, which serves

as a backup node of the CH. The selected VH goes to sleep and, when the energy of the CH

decreases below a low threshold value, say 10%, the VH wakes up to act as the CH and selects

its VH. This process continues until next round.

The rest of the paper is organized as follows. Section 2 presents related work. Section 3

describes the proposed LEACH-VH protocol, and the selection mechanism of the VH in a

cluster is given in Section 4. Simulation results are presented and analyzed in Section 5.

Section 6 concludes this paper with conclusions and future work.

2 Related Work
In this section, we review all LEACH based protocols in terms of hierarchical structure, self-

organization, homogeneous feature, randomized rotation feature, aggregation feature at the

CH. A comparison is given in Table 2, which includes other parameters such as mobility,

scalability, distributed/centralized, energy efficiency and resources awareness.

LEACH was proposed by Wendi B. Heinemann in [16]. LEACH, in which each node in a

cluster has chance to act as a CH, is a justice or fair protocol. Each node in a cluster

communicates to the CH directly, and the CH performs aggregation on the collected data, and

sends the fused data to the base station (BS) directly. Like other hierarchical protocols,
3
LEACH works in rounds. In each round, cluster member nodes collect data from the

environment and send them to the CH, and the CH sends the aggregated or fused data to the

BS. In case the node having little residual energy is selected as the CH, the lifetime of the

WSN decreases accordingly.

Wendi B. Heinemann also proposed an improved version of LEACH called LEACH-C in [17].

The difference of LEACH-C from LEACH lies in its setup phase in which every node sends

the information about its current location and residual energy level to the BS. The BS selects a

node whose energy greater than some threshold value as the CH and notifies each node to act

either as the CH or a normal node in a cluster. In this way, better performance could be

achieved with LEACH-C than LEACH. Another improved version of LEACH called LEACH-

sub-CH, in which sub-CH was introduced to take over the CH in case the CH dies, was

proposed by N. Mittal et al. [18]. An adaptive version of LEACH called Adaptive Cluster

Head Election and Two-hop LEACH, i.e., ACHTH-LEACH, in which the CHs are selected

based on the placement, in terms of hops of the CHs and the BS, was proposed in [19].

Distance from the BS, the near nodes are identified as one cluster and far nodes as other

clusters using Greedy k-mean algorithm. In K-LEACH, the K-medoids algorithm is used for

uniform clustering and the CH selection is based on the maximum outstanding energy and the

Euclidian distance [20]. In Two Level LEACH, i.e., TL-LEACH, when the CH gets data from

the cluster members, the CH sends the data to an intermediate CH, rather than sending the data

to the BS directly [21]. In Energy LEACH, i.e., E-LEACH, the residual energy of the node is

a factor for a node to become the CH, which guarantees that the CH has more energy than

other nodes in a cluster [22]. In Vice LEACH, i.e., V-LEACH, a Vice CH is introduced to

serve as a CH when the CH fails to work, thus improving the overall performance of a WSN

[23]. In Cell-LEACH, a WSN is divided into many sections called cells [24]. In each cell, there

4
is one head called cell-head and several cells are combined to form a cluster which has its own

cluster-head, i.e., CH. The clustering and celling remain fixed but the cell-head and the CH are

selected randomly. In Cell-LEACH, the BS passes its interest to the CH, which passes it to its

cell-heads; cell-heads pass the same to their sensor nodes. In case a cell-head gets an

acknowledgement from a node against the interest, it allocates the TDMA schedule on the

channel to the node. Then, the node sends its data through the channel using its specified time.

In order to save the energy and the bandwidth of the channel, redundant data is filtered at cell-

head. The same procedure applies to cell-heads sending the data to the CH. CHs send the data

to the BS using intermediate CHs as relay nodes. An improved version based on Particle Swam

Optimization (chaos-PSO), in which both residual energy and the distance of the CH from the

BS are considered, is proposed in [25]. In a multi hop version of LEACH, CHs are not only

responsible for collecting data from their member nodes, but also act as relay nodes to the CHs

sending their data to the BS [26]. Such a tree structure prolongs the lifespan of a WSN

compared with single hop LEACH. In l-LEACH, in addition to the residual energy, the CH

location is considered via its coordinates [27]. The coordinates are used to select the CH near

the cluster member nodes and the distance between the CH and non-CH nodes is calculated for

each cluster. With the assistance of the first order radio representation, the energy dissipated is

calculated and subtracted from the nodes’ residual energy. Nodes having less energy than the

minimum are depleted from the network. In LEACH Energy Consumption Routing protocol,

i.e., LEACH-ECD, the outstanding energy of a node is considered for the selection of the CH

[28]. In each cluster, there is an assistant node which balances the work load among nodes in

the cluster. In LEACH-R protocol, in addition to selecting CH based on the outstanding energy

of the nodes in the cluster, the distance of the CH from the BS is also considered for inter-

cluster communication [29]. In a multi-hop version of LEACH protocol called M-LEACH,

periodic and random strategies are used to select the cluster head [30]. Another LEACH based
5
protocol that uses multi-hop, called LEACH-L, is proposed in [31]. When the CH is close to

the BS, it sends the data directly; otherwise, it uses the multi-hop technique to send the data to

the BS by using relay CHs. LEACH-B is a decentralized version whose goal is to balance the

energy workload among the nodes in the cluster [32]. In LEACH-F, once the clusters are

formed, they remain fixed throughout the whole life of the WSN, thus avoiding energy cost in

forming clusters each round [33]. LEACH-M, in which the node with the less attenuation and

minimum mobility is selected as a CH, is proposed to address mobility issue [34]. In [35], the

concept of vice cluster head concept is introduced. When the CH’s energy drops due to heavy

load, it announces the node with the highest energy value as the CH and broadcasts it to all its

members. Then, the CH selects a member node, which has the maximum energy in the cluster

to be Vice CH (VCH). All cluster members send their data to the VCH, which then sends the

data to the BS after the aggregation process. This avoids a new round in the steady-phase. In

order to avoid the earlier death of the VCH, a round of new CHs sets up for all nodes. This

CH-VCH-CH communication cycle improves the lifetime. This paper proposes a novel VH

selection approach. Consider table 2 which provides a comparison of various LEACH based

protocols in the literature.

Clustering Routing Resources

Mobility Scalability Hop count Energy efficiency
Protocol awareness

LEACH [16] Fixed BS Limited Single-hop High Good

LEACH-C [17] Fixed BS Limited Single-hop High/small network Good

LEACH-sub-CH [18] fixed BS Good Single-hop Very High Very Good

ACHTH-LEACH
Fixed BS Very Good Multi-hop Very High Very Good
[19]

6
 K-LEACH [20] Fixed BS Very Good Multi-hop Very High Very Good

TL-LEACH [21] Fixed BS Very Good Multi-hop Very High Good

E-LEACH [22] Fixed BS Very Good Single-hop Very High Good

V-LEACH [23] Fixed BS Very Good Single-hop Very High Very Good

LEACH-Cell [24] Fixed BS Very Good Multi-hop Very High Very Good

Improved LEACH
Fixed BS Good Single-hop Very High Very Good
[25]

MR-LEACH [26] Fixed BS Very Good Multi-hop Very High Very Good

I-LEACH [27] Fixed BS Very Good Multi-hop Very High Very Good

LEACH-ECD [28] Fixed BS Good Single/Multi-hop Very High Very Good

LEACH-R [29] Fixed BS Good Multi-hop Very High Very Good

M-LEACH [30] Fixed BS Very Good Multi-hop Very High Very Good

LEACH-L [31] Fixed BS Very Good Multi-hop / Single-hop Very High Very Good

B-LEACH [32] Fixed BS Very Good Single-hop Very High Very Good

LEACH_F [33] Fixed BS Very Good Single-hop Very High Very Good

LEACH_M [34] Fixed BS Very Good Single-hop Very High Very Good
Improved LEACH
Fixed BS Very Good Single-hop Very High Very Good
[35]

Table 2: Comparison of LEACH based Protocols

3 LEACH-VH Protocol
It is known that cluster-based protocols are more energy efficient than flat, tree or grid based

protocols. In the cluster based protocols, there are normally three types of nodes: non-CH

nodes, CH nodes, and the BS. The CH nodes perform more jobs than non-CH nodes and

consume the energy faster [31, 32]. The basic idea in designing the communication protocol is

to balance the energy workload among the nodes in the cluster. In order to increase the lifetime

of the cluster by supporting the CH, in this paper, the concept of Vice CH (VH) is introduced

7
and a novel LEACH-Vice Head protocol called LEACH-VH, in which both a CH and a VH are

selected based on the residual energy, is proposed.

In the proposed LEACH-VH protocol, clusters are formed and CHs are selected randomly in

the same way as LEACH. Each node in the cluster has same initial energy at the beginning.

The selected CH gets the residual energy information from all the cluster member nodes and

selects the node with the highest residual energy in the cluster as its VH. The selected VH goes

to sleep mode, i.e., without performing any task such as storing, forwarding, idle-listening,

sensing and other tasks. In this way, most of its energy could be saved for the next coming

rounds.

A topology consisting of 4 clusters with 5 nodes per cluster is shown in Figure 1. Each cluster

includes a CH and a VH, and the CH has a connection with the BS.

BS

VH

CH

Members

Figure 1: LEACH-VH Topology

8
3.1 LEACH-VH Algorithm
The selected VH goes to sleep mode, and when the energy of the CH decreases below a low

threshold value, say 10%, the VH wakes up to act as the CH and selects its VH. The new CH is

assumed to have same privileges and tasks as the previous CH, and the previous CH acts as a

regular cluster member. Similarly, the new CH selects its VH based on the residual energy, in

the same way as it was selected by the previous CH. Also the new CH broadcasts that it is the

new CH and the nodes in the cluster reply an acknowledgement packet to the new CH. Then

the new CH sends a TDMA schedule to them. This process is repeated throughout the lifetime

of the cluster. In this way, he overall lifetime of the cluster is prolonged, and thus the lifetime

of WSNs is also prolonged. LEACH VH algorithm is shown in Figure 2 and the protocol

operation is shown in Figure 3.

Algorithm of LEACH-VH
clusterHead ElCH, VH;
node memberNode;
Step1:
For 1 to N
Check (Node)
If ElNode > Elhigh
then
ElNode = VH
Sleep (Wait till wake-up Call)
if (ElCH >= 10)
Works as CH and Transmit data to BS

Else
Wake-up call to VH.
Do handing taking of data
Mnode CH
CH VH
VH Do announcement to members that now I am CH

Go to step 1.

Figure 2: LEACH-VH Algorithm

9
 CH gets energy information from all nodes

No
ElNode > Elhigh Set as non-VH

Yes

ElNode VH

VH sleeps until receives a wake-up call

Yes
ElCH >= 10 Transmits collected data to BS

No

Send wake-up
call to the VH

CH Becomes
Regular Node

VH becomes CH

VH announces the members

that it is the new CH

Figure 3. LEACH-VH Protocol Operation

3.2 LEACH-VH Message Flow Diagram

The message flow diagram of our proposed protocol is shown in Figure 4. In LEACH-VH,

there are four entities: regular nodes, CHs, VHs, and the BS. The only difference from [16] is

the introduction of VHs.

10
 Regular
CH VH BS
Nodes
Send their energy values

Node having
highest energy is
selected as VH
Goes down to sleep
Send data packets
Checks its energy.

Sends data to BS

If its energy is <10%

=> Send call to Wake
Previous CH serves as
normal nodes in the Now VH serves as

Notify all nodes in cluster to

send their data new CH
Checks its energy. If
energy >10% =>
Perform aggregation
and send data to BS
Join the new CH

Send TDMA Schedule

Sends data to CH

Send data to BS
Notify all nodes in cluster to
send their data new CH Otherwise wakeup VH

Figure 4. LEACH-VH Message Flow Diagram

4 Performance Evaluation
This section presents the performance evaluation results from simulations to demonstrate the

effectiveness of the proposed LEACH-VH protocol. The performance of the LEACH-CH is

compared with other well-known LEACH-based protocols, including LEACH, LEACH-C,

LEACH-F, E-LEACH, TL-LEACH, and V-LEACH for the following cases:

i. Energy consumed by each node with respect to the simulation time

ii. Number of nodes alive with respect to the simulation time

iii. Number of nodes alive with respect to the simulation time

11
 iv. time for the first node to die with respect to the simulation time

v. time for half nodes to die with respect to the simulation time

vi. CHs die ratio with respect to the simulation time

4.1 Network Model

All the nodes in the network are deployed randomly. Clusters are formed based on LEACH

protocol. LEACH-VH is a single hop protocol, and the BS is located outside the network area.

Both the nodes and the BS are stationary after the deployment and the node battery is not

rechargeable once it is deployed. Therefore, the energy of the node is the important concern in

our case, like other routing protocols for WSN. The energy of the network is divided into two

categories: electronic energy and amplification energy. The electronic energy is the energy

used for sending and receiving the information, which is normally equal for all the nodes in the

network. The amplification energy depends on the distance between the nodes and can be

further divided into free space (d2) and multi-path fading (d4). The energy exhausted for the

transmission of a k-bit packet over a distance dist is given by equations (1) and (2):

E t(k, tdist) = k Eelec + p∈fsdist2 if tdist =< dist (1)

E t (k, tdist) = kEelec + p∈mpdist4 if tdist >dist (2)

And the radio expends its power based on equation (3):

ER(k)= k Eelec (3)

The notations used are summarized in Table 3.

Simulation Parameter Value

Tdist Transmission Distance
dist2 free-space Distance
dist4 multi-path fading
Eelec Electronic Energy
K p-bit packet
Dist Threshold distance

12
 ∈fs Coefficient for free-space fading

∈mp Coefficient for multi-path fading

Table 3: Notation used in the equations

4.2 Simulation Results and Analysis

A special plug-in of OMNeT++ called Castalia-3.2 is used in the performance evaluation [36].

Castalia is particularly useful in simulation and evaluation of WSNs and Body Area Networks

(BANs) consisting of low-power devices. OMNeT4.2++ based platforms can operate in

windows, MAC OS X, Linux and other Unix-like operating systems [37]. A simulation

environment with a network with 100 nodes placed on a 100 m × 100 m area is established.

And the widely-used parameters are adopted, as summarized in Table 4.

Simulation Parameter Value

Network Area 100m* 100m
Initial Energy 6 Joules
CH Percentage 0.05
Packet header Size 25 byte
Data Size 500 byte
Num of Nodes 100 nodes

Simulation Time 500 Sec

Control Packet Size 100 bit
Broadcast packet size 25 bytes
Round Length 20 sec
Eelec 50 nj/bit

∈fs 10 pj/bit/m4

Table 4: Network Model Parameters

Figure 5 shows that LEACH-VH outperforms all other protocols in terms of energy

consumption. LEACH selects the CH without considering the node state. LEACH-C

outperforms LEACH because the residual energy is considered in the selection of CH.

13
LEACH-F beats LEACH and LEACH-C because clusters are formed only once, avoiding

energy cost due to the formation of the clusters at each round. Also LEACH-L, LEACH-F and

TL-LEACH are better than LEACH and LEACH-C because extra parameters are included.

LEACH-VH is better than other protocols because it considers the residual energy and selects a

VH in case the energy of the CH decreases below a low threshold value. Figure 5 shows that

the LEACH-VH protocol consumes 26.69% of the total energy, which is about 41.178%,

27.31%, 18.418%, 17.088%, 13.596%, and 11.578% less than LEACH, LEACH-C, LEACH-F,

LEACH-L, TL-LEACH, and VLEACH, respectively.

400 LEACH LEACH-C LEACH-F LEACH-L

350 TL-LEACH V-LEACH LEACH-VH

300
Energy Consumed[Joules]

250

200

150

100

50

0
0 50 100 150 200 250 300 350 400 450 500
Time[Seconds]

Figure 5: Energy consumption comparison.

Figure 6 shows the number of nodes alive over the time. The simulation results demonstrate

that the number of active nodes after 600 seconds are 77, in LEAH-VH protocol, but in the

cases of LEACH, LEACH-C, LEACH-F, LEACH-L, TL-LEACH, and V-LEACH, the number

of active nodes are 31, 48 , 56 , 63, 67, and 70 respectively.

14
 120 LEACH LEACH-C LEACH-F LEACH-L

No of Nodes Alive With respect to Simulation Time

TL-LEACH V-LEACH LEACH-VH

100

80

60

40

20

0
0 100 200 300 400 500 600
Time[Seconds]

Figure 6. Number of alive nodes along the time

Figure 7 shows the comparison among the protocols with regard to the time when the first node

in the cluster die. It is obvious that LEACH-VH is much better than other protocols: in

LEACH-VH, the first node dies after 89.12 sec, while in LEACH, LEACH-C, LEACH-F,

LEACH-L, TL-LEACH, and V-LEACH, the first node die time is 36.5 sec, 47.65 sec, 57.65

sec, 63.45 sec, 69.56 sec, and 73.12 sec, respectively.

15
 90
80
70
60
Time [Seconds]

50
40
30
20
10
0

Figure 7. The Time When the First Node Die

Figure 8 shows the time when half of the nodes die. The time when half of the nodes die for

LEACH, LEACH-C, LEACH-F, LEACH-L, TL-LEACH, and V-LEACH are 352.2 sec,

492.34 sec, 599.32 sec, 597.45 sec, 615.23 sec, and 645.67 sec, respectively. But for LEACH-

VH, the time is 701.56 sec. This is due to the fact that LEACH-VH does not perform CH

selection again and again and the VH is kept in sleep mode, thus saving energy compared with

other protocols.

16
 800

700

600
Time[Seconds]

500

400

300

200

100

Figure 8. The Time when Half Nodes Die

Figure 9 shows the CH die ratio with respect to the simulation time. From the simulation

results, after 1000 seconds of simulation time, about 16 CHs died in LEACH-VH, whereas in

LEACH, LEACH-C, LEACH-F, LEACH-L, TL-LEACH, and V-LEACH, the number is about

26, 27, 23, 22, 22, and 21, respectively.

17
 4,5 LEACH LEACH-C LEACH-F
LEACH-L TL-LEACH V-LEACH
4 LEACH-VH

3,5
No of CH Die Ratio

2,5

1,5

0,5

0
100 200 300 400 500 600 700 800 900 1000
Time[Seconds]

Figure 9. CH Die ratio with respect to the simulation time

5 Conclusions and Future Directions

LEACH protocol is a clustering protocol that is widely used in extending the lifetime of a
WSN. In this paper we proposed a novel routing protocol called LEACH-VH to improve the
performance of LEACH, by introducing the concept of VH to support CH. In LEACH-VH,
both CH and VH are selected based on the residual energy of the nodes in a cluster. The
selected VH goes to sleep mode and, when the energy of the CH decreases below a low
threshold value, say 10%, the VH wakes up to act as the CH and selects its VH. It has been
demonstrated that the lifetime of a WSN increased significantly compared with other LEACH
protocols.

In the future, we plan to include an artificial neural network in LEACH-VH for better

performance and compare it with other protocols. Also, we will evaluate the performance of

the proposed system for multimedia compared with other protocols proposed in [38] [39].

18
References

[1] Miguel Garcia, Diana Bri, Sandra Sendra, Jaime Lloret (2010), Practical Deployments of

Wireless Sensor Networks: a Survey, Journal on Advances in Networks and Services, Vol.

3, Issue 1&2, pp. 170-185.

[2] Diana Bri, Miguel Garcia, Jaime Lloret, Petre Dini (2009), Real Deployments of Wireless

Sensor Networks, The Third International Conference on Sensor Technologies and

Applications (Sensorcomm 2009), Athens, Greece, June 18-23.

[3] K. Dimitri (2013) "Maximizing the Lifetime of a Wireless Sensor Network with Fixed

Targets", Ad-hoc & sensor wireless networks, Vol. 17, Issue. 3-4, pp. 253-268.

[4] Jaime Lloret, Miguel Garcia, Diana Bri and Sandra Sendra (2009), A Wireless Sensor

Network Deployment for Rural and Forest Fire Detection and Verification, Sensors, Vol. 9,

Issue 11, Pp. 8722-8747, doi:10.3390/s91108722

[5] Sandra Sendra, Angel T. Lloret, Jaime Lloret, and Joel J. P. C. Rodrigues (2014), A

Wireless Sensor Network Deployment to Detect the Degeneration of Cement used in

Construction, International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC). Vol.

15, Issue 1/2/3, pp. 147-160.

[6] Y. Kim and Y. Han (2012), "Maximizing Network Lifetime for Connected and Non-

overlapped Target Coverage in Wireless Sensor Networks", Ad Hoc & Sensor Wireless

Networks, Vol. 15, Issue 1. pp.65-82.

[7] Sendra, S., Lloret, J., García, M., & Toledo, J. F. (2011). Power Saving and Energy

Optimization Techniques for Wireless Sensor Neworks. Journal of communications, Vol.

6, Issue 6, pp 439-459.

19
[8] Ousmane Diallo, Joel J. P. C. Rodrigues, Mbaye Sene, and Jaime Lloret (2013), Distributed

Database Management Techniques for Wireless Sensor Networks, IEEE Transactions on

Parallel and Distributed Systems, DOI: 10.1109/TPDS.2013.207.

[9] M. Biyuan, W. Dong, C. Chen, J. Bu, and Q. Wang (2014). "An Efficient Differencing

Algorithm for Reprogramming Wireless Sensor Networks." Ad Hoc & Sensor Wireless

Networks, Vol. 21, No. 3-4, pp. 201-218

[10] K. Maraiya, K. Kant, N. Gupta, (2011). Wireless Sensor Network: A Review on Data

aggregation, International Journal of Science & Engineering Research, Vol. 2, No. 4. pp.1-

[11] C. Bo-Chao, L. Guo-Tan, T. R. Yuh, H. H. Ping, (2012). “Network Lifetime bounds for

hierarchical wireless sensor networks in the presence of energy constraints”, Computer

Networks, Vol. 56, pp. 820-831.

[12] L. Yang, Y. Zhan, J. Chen, B. Mo, W. Dong, C. Chen, J. J. Bu et al. (2014) "An

Integrated Approach to Sink and Sensor Role Selection in Wireless Sensor Networks:

Using Dynamic Programming.", Ad Hoc & Sensor Wireless Networks, Vol. 21,No. 3-4,

pp. 177-199.

[13] Amjad Mehmood, S. Khan, Bilal Shams, and Jaime Lloret, (2014) “Energy-efficient

multi-level and distance-aware clustering mechanism for WSNs”, International Journal of

Communication Systems, DOI: 10.1002/dac.2720.

[14] Jaime Lloret, Miguel Garcia, Diana Bri and Juan R. Diaz, A Cluster-Based Architecture

to Structure the Topology of Parallel Wireless Sensor Networks, Sensors, Vol. 9, No. 12,

pp. 10513-10544, December 2009. doi:10.3390/s91210513

20
[15] L. Xuxun, (2012). A Survey on Routing Clustering Protocols in Wireless Sensor Networks,

Sensors, Vol. 12, No. 8, pp. 11113-11153; doi:10.3390/s120811113

[16] W. R. Heinzelman, A. Chandrakasan, H. Balakrishnan, “LEACH: Energy-efficient

communication protocol for wireless microsensor networks,’’. In Proceedings of 33rd

Hawaii International Conference on System sciences, Maui, Hawaii, pp. 3005–3014, Jan.

2000

[17] Heinzelman W. B., Chandrakasan A. P., Balakrishnan H. (2002), ”An application specific

protocol architecture for wireless microsensor networks,” IEEE Trans on Wireless

Communications, Vol. 1, No. 4, pp. 660-670, doi: 10.1109/TWC.2002.804190

[18] N. Mittal, D. Pal Singh, A. Panghal, R.S. Chauhan, 2010, "Improved Leach

Communication Protocol for WSN", 2010-National Conference on Computational

Instrumentation CSIO Chandigarh, pp. 153-156

[19] L. Guo, Y. Xie, C. Yang , Z. Jing, 2010,"Improvement on LEACH by combining Adaptive

Cluster Head Election and Two-hop transmission", 2010 International Conference in

Machine Learning and Cybernetics (ICMLC), Qindao, 2010., vol. 4. pp. 1678-1683

[20] P. Bakaraniya, S. Mehta, 2013 ,"K-LEACH: An improved LEACH Protocol for Lifetime

Improvement in WSN", International Journal of Engineering Trends and Technology

(IJETT) , Vol. 4, No. 5, pp. 1521-1526.

[21] V. Loscri, G. Morabito, S. Marano,2005 ,A Two-Levels Hierarchy for Low-Energy

Adaptive Clustering Hierarchy (TL-LEACH), Proceedings of IEEE Vehicular Technology

Conference, Dallas, 25-28 September 2005, pp. 1809-1813.

[22] F. Xiangning, S. Yulin, 2007,"Improvement on LEACH Protocol of Wireless Sensor

Network", Sensor Technologies and Applications, SensorComm 2007. Valencia, Spain.

21
[23] Muneer Bani Yassein, A. Al-zou'bi, Yaser Khamayseh, and Wail Mardini, (2009)

"Improvement on LEACH protocol of wireless sensor network (VLEACH)," International

Journal of Digital Content Technology and its Applications, Vol. 3, No. 2, pp. 132-136.

[24] A. Yektaparast, F. H. Nabavi, A. Sarmast, 2012, "An improvement on LEACH protocol

(Cell-LEACH)", 14th International Conference on Advanced Communication Technology

(ICACT) PyeongChang, pp. 992-996.

[25] Z. Liu, Z. K. Liu, L. Wen, 2011, "A Modified LEACH Protocol for Wireless Sensor

Networks", 4th International Workshop on Advanced Computational Intelligence, Wuhan,

China, pp. 766-769.

[26] M. O. Farooq, A. B. Dogar, and G. A. Shah, 2010, "MR-LEACH: Multi-hop routing with

low energy adaptive clustering hierarchy," in Proc. Fourth International Conference on

Sensor Technologies and Applications (SENSORCOMM 2010). July 18 - 25, 2010 -

Venice/Mestre, Italy, pp. 262-268.

[27] N. Kumar, J. Kaur, 2011, "Improved LEACH Protocol for Wireless Sensor Networks",

Wireless Communications, 7th International Conference on Networking and Mobile

Computing (WiCOM), Wuhan, pp. 1-5,DOI. 10.1109/wicom.2011.6040360.

[28] Q. Wang, F. Zhang, L. Hao, H. Liao, M. Xiong, Y. Cheng, 2010," LEACH-ECD: Routing

Protocol Based on Energy Consumption", 2nd IEEE Symposium on Web Society (SWS),

Beijing, pp.244-249,DOI.10.1109/SWS.2010.5607445.

[29] N. Wang, Z. Zhou, H. Zhu, 2012 "An Energy Efficient Algorithm Based on LEACH

Protocol", 2012 International Conference on Computer Science and Electronics

Engineering (ICCSEE) Hangzhou, pp.339-242,DOI.10.1109/ICCSEE.2012.150.

[30] Mhatre, V., & Rosenberg, C. (2004). “Homogeneous vs heterogeneous clustered networks:

a comparative study”. IEEE ICC 2014, pp. 34–38.

22
 [31] F. Shang, Y. Lei, (2010). An Energy-Balanced Clustering Routing Algorithm for Wireless

Sensor Network, Wireless Sensor Network, 2, 777-783 doi:10.4236/wsn.2010.210093

[32] V. Kumar, S. Jain, S. Tiwari (2011) “Energy Efficient Clustering Algorithms in Wireless

Sensor Networks: A Survey”, IJCSI International Journal of Computer Science Issues,

Vol.8, Issue 4, No 2, September 2011.

[33] Heinzelman, W. B. (2000). Application-specific protocol architectures for wireless

networks (Doctoral dissertation, Massachusetts Institute of Technology).

[34] D.S. Kim, Y. Chung, (2006), "Self-Organization routing protocol supporting mobile nodes

for Wireless Sensor Networks", in Proc. First International Multi-Symposiums on

Computer and Computational Sciences, Hangzhou, China

[35] Z. Fuzhe, X. You, L. Ru (2012), "Improved LEACH Routing Communication Protocol for

a Wireless Sensor Network", International Journal of Distributed Sensor Networks,

Volume 2012 (2012), Article ID 649609, 6 pages. http://dx.doi.org/10.1155/2012/649609

[36] Documentation and Tutorials of Castalia Simulator for WSN and BAN.

http://castalia.research.nicta.com.au/index.php/en/ (last accessed date: 15 October 2014)

[37] Documentation and Tutorials of OMNET++. http://www.omnetpp.org/ (last accessed date:

15 October 2014).

[38] Muhsin Atto, Chris Guy (2014), Routing Protocols and Quality of Services for Security

Based Applications Using Wireless Video Sensor Networks, Network Protocols and

Algorithms, Vol 6, No 3. pp. 119-137

[39] Moad Yassin Mowafi, Fahed Hasan Awad, Mohammed A Al-Batati (2013), Opportunistic

Network Coding for Real-Time Transmission over Wireless Networks, Network Protocols

and Algorithms, Vol 5, No 1. pp. 1-19

23

View publication stats