i

An Improved Technique for low Energy Adaptive Clustering Hierarchy

Protocol

By

Noor Shudifat

Supervisor

Dr. Amer Abu Salem

This Thesis was Submitted in Partial Fulfillment of the Requirements for the

Master’s Degree in Computer Science

Faculty of Graduate Studies

Zarqa University

Zarqa-Jordan

Second Semester/ May, 2016.

ii

جامعة الزرقاء

إقرار تفويض

أو الهيئات أو المؤسسات أطروحتي للمكتبات/ أفوض جامعة الزرقاء بتزويد نسخ من رسالتي ،نور محمود هليل الشديفاتأنا

.عند طلبهم حسب التعليمات النافذة في الجامعةأو األشخاص

:التوقيع

:التاريخ

Zarqa University

Authorization Statement

I Noor Shudifat, authorize Zarqa University to supply copies of my thesis to libraries

establishments or individuals on request, according to the University regulations.

Signature:

Date:

iii

COMMITTEE DECISION

This is to certify that the thesis entitled (An Improved Technique for low Energy Adaptive

Clustering Hierarchy Protocol) was successfully defended and approved on -------------------------

----.

Examination Committee Members Signature

Dr. ……………………….. (Supervisor) -------------------------

Dr. ……………………….. (Member) -------------------------

Dr. ……………………….. (Member) -------------------------

Dr. ……………………….. (Member) -------------------------

iv

ACKNOWLEDGMENTS

First and foremost, thanks for Allah the Almighty for endowing me with health, patience, and

knowledge to carry out this work successfully.

I would like to express my sincere gratefulness to my supervisor, Dr. Amer Abusalem for his

great guidance and advices during the time of writing this dissertation, without his precious

support it would not have been possible to conduct this research.

Also, special thanks to the members of examination committee and all faculty members of

master’s program in computer science department for their support and encouragement.

I want as well to acknowledge my gratitude to all my friends who provided invaluable support

and advice at various stages.

Finally, I am extremely grateful to my father, my mother, my brothers and my sister, as they

have supported me for so many years and enabled me to achieve this honorable degree.

I am also extremely grateful to my husband for his love, encouragement, support and

comfortable atmosphere during the long hard work; thank you from the bottom of my heart,

loads of love and thanks to you all.

v

TABLE OF CONTENTS

Contents Page

List of table’s ........................................................................................................................................ vii

List of Figures ...................................................................................................................................... viii

List of Acronyms .................................................................................................................................... ix

Abstract in Arabic .................................................................................................................................... x

Abstract in English ................................................................................................................................. xii

Chapter 1 Introduction..................................................................................................................1

Overview .................................................................................................................................................. 1

Problem definition ................................................................................................................................... 2

Research objectives ................................................................................................................................... 2

Research contribution ............................................................................................................................... 3

Thesis Outline .......................................................................................................................................... 4

Chapter 2 Background of Low Energy Adaptive Clustering Hierarchy and Related Work 5

Application of WSN ................................................................................................................................ 5

Characteristics of WSN ............................................................................................................................. 5

Communication Protocol used in WSN .................................................................................................. 6

Algorithm Paradigms for Wireless Sensor Networks ............................................................................... 8

Sensor Node Structure ............................................................................................................................ 8

Clustering .................................................................................................................................................. 9

Design Factors for Wireless Sensor Networks ........................................................................................ 11

Low Energy Adaptive Clustering Hierarchy ("LEACH") ...................................................................... 11

What is a LEACH Protocol? ................................................................................................................... 12

LEACH Sensor Characteristics ............................................................................................................... 12

Is a LEACH protocol suitable for the WSNs? ........................................................................................ 15

Radio Signal Propagation Model ............................................................................................................ 16

Disadvantages of LEACH ....................................................................................................................... 17

Related work ........................................................................................................................................... 18

vi

Chapter 3 Research Methodology ..............................................................................................22

Methods for Studying a System .............................................................................................................. 22

Chapter 4 The Proposed Approach............................................................................................28

The Proposed Approach .......................................................................................................................... 28

Chapter 5 Simulation Evaluation ...............................................................................................32

Simulation Software ................................................................................................................................ 32

Simulation Scenarios and Assumptions ................................................................................................. 32

System Environment and Network Model .............................................................................................. 34

System Environment ............................................................................................................................... 35

Evaluation Metrics .................................................................................................................................. 35

Simulation Steps ..................................................................................................................................... 37

Simulation Analysis and Results ............................................................................................................. 37

Chapter 5 Conclusion and Future Work ...................................................................................42

Chapter 5 References ...................................................................................................................43

vii

LIST OF TABLES

Page Caption Table Number

11 Factors for wireless sensor networks. Table 2.1

36 Simulation parameters.

Table 5.1

38 Power consumption in cluster head nodes when

using a leach protocol with different number of

nodes and 9 rounds for each of them.

Table 5.2

40 Power consumption in overall network when

using a leach protocol with different number of

nodes and 9rounds for each of them.

Table 5.3

viii

FIGURES LIST OF

Page Figure Caption Number

6 Layered Architecture of WSN Figure 2.1

9 Structure of Sensor Node

Figure 2.2

24 The methods for study the performance of a system Figure 3.1

26 Research Methodology

Figure 3.2

39 power consumption in CH in leach vs. the proposed approach Figure 5.1

41 power consumption in CH in LEACH Vs. the proposed approach Figure 5.2

ix

LIST OF ACRONYMS

WSN Wireless Sensor Network

PDAs Personal Digital Assistants

ADC Analogy Digital Converter

SPINS Security Protocols In Sensor Networks

LEACH Low Energy Adaptive Clustering Hierarchy

CSMA Carrier Sense Multiple Access

RSSI Received Signal Strength Indicator

TDMA Time Division Multiple Access

LEACH-F Fixed Number of Cluster Low Energy Adaptive Clustering Hierarchy

TL-LEACH Two Level Low Energy Adaptive Clustering Hierarchy

LEACH _C Centralized Low Energy Adaptive Clustering Hierarchy

A-LEACH Advanced Low Energy Adaptive Clustering Hierarchy

MH-LEACH Multi-Hop Routing with Low Energy Adaptive Clustering Hierarchy

x

تحسين اداء بروتوكول الطاقه المنخفضه المحدده بالتجمع الهرمي

اعداد

نور شديفات

اشراف

عامر ابو سالم.د

الملخص

الشبكات الالسلكيه هي حقل جذاب يستخدم على نطاق واسع للدراسه ويتكون من عدد كبير من اجهزه

الشبكات الالسلكيه .الى المحطه االساسيه االستشعار التي تعمل على جمع البيانات من البيئه المحيطه ويرسله

تعاني من مشكله استهالك الطاقه في اجهزه االستشعار والعديد من االبحاث قامت بدراسه هذه المشكله

برتوكول الطاقه المنخفضه المحدده . وانتجت العديد من البرتوكوالت لخفض استهالك الطاقه في الشبكه

كل : كوالت المستخدمه لخفض الطاقه لكن يعاني من بعض المشاكل منهابالتجمع الهرمي هو احد هذه البرتو

وهذا سوف ، محطه االساسيهكتله االقرب لها بغض النظر عن بعد هذا المسؤول عن الالعقده تنتخب مسؤول

الن استهالك .يستهلك العديد من الطاقه لمسؤول الكتله والطاقه للشبكه كامله اذا كانت هذه المسافه بعيده

اصبح من الضروري تطوير طريقه لتخفيض الطاقه بحيث الطاقه تلعب دور مهم في زياده استمراريه الشبكه

.وزياده استمراريه الشبكه

بتقديم .يجاد المسافه التي تلعب دور مهم في تقليل استهالك الطاقهتم اقتراح طريقه ال ،في هذا العمل البحثي

باختيار مسؤول الكتله بناء على ,ه المنخفضه المحدده بالتجمع الهرمي وتطويرهاخوارزميه برتوكول الطاق

اي يتم اختيار مسؤول الكتله الذي من خالله المسافه تكون اقل ما يمكن للمحطه الرئيسيه , المسافه

النتائج المستخلصه الى تقليل افضل في استهالك توصلت . واستخدامها باعداد من العقد والدورات المختلفه

xi

الطاقه لمسؤول الكتله والطاقه للشبكه كامله مع ازدياد في عدد العقد والدورات وبالتالي زياده استمراريه

.الشبكه

xii

Improved Technique for Low Energy Adaptive Clustering Hierarchy protocol

By

Noor Shudifat

Supervisor

Dr. Amer Abu Salem

ABSTRACT

Wireless sensor networks (WSN) is an attractive and widely used field to study, it consists a

large number of a sensor nodes that work to collect data from the surrounding environment, and

sends it to a base station. WSN has a limitation in power consumption of sensor node, and a lot

of researchers study it and proposed many protocols to reduce power consumption in a network.

Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of the protocols to reduce

a power consumption but LEACH sufferers some of problems such as: each node selects the

closest cluster-head itself regardless of how far from base station this will consume the energy of

cluster head nodes and a power consumption in overall network if the distance is far. Because

power consumption is a significant factor in extending the life time of a network, there is a desire

for developing a new method to decrease power consumption and extend the life time of a

network.

this research proposes an approach to find a distance that plays an important role in reducing

power consumption in cluster head nodes and in overall network. By introducing an algorithm of

LEACH, develop it, by selecting a cluster head according to distance means that select a cluster

head that through it a distance is minimum to base station, and then using it in different number

xiii

of nodes and rounds, the achieved results conclude a better reduction of power consumption in

cluster heads and overall network as the number of rounds and nodes are raised and hence the

life time of a network will be increased.

1

Chapter 1

Introduction

1.1 Overview

WSNs (Wireless Sensor Networks) are one of the most rapidly improving

information technologies, WSN monitor environmental conditions that change rapidly

over time. This environmental condition behaviour is either caused by external factors

or initiated by the system designers themselves (Singh, 2016).

WSN is a wireless network that consists of spread small and autonomous devices

called sensor nodes that are homogenous or heterogeneous to sense or to monitor an

environmental or physical condition and communicates the information gathered from

monitored environment through wireless links, the data collected sent to a central

point.

Mobile computers, such as smart cards, notebook computers and portable

computers, these intelligent connected devices, will grow of the computer industry.

Many of the people that have these computers have desktop machines on LANs and

WANs backward at the office and want to be connected to their home base even when

far from home. Since having a wired connection is unattainable in cars and airplanes,

there is a lot of interest in wireless networks. Wireless Networks have many uses. A

popular one is the Portable office. People on the road need to use their Portable

electronic tool to send and receive telephone calls, faxes, and electronic mail, read

remote files, login on remote machines, and do this from anywhere on land, sea, or

air. Another use is for salvage workers at catastrophe sites where the telephone system

2

has been damaged. Computers there can send messages, hold records, and so on

(Mascolo, et al., 2002).

Distinguishing attribute of a wireless network is that communication takes place

between computer devices. These devices have personal digital assistants (PDAs),

personal computers (PCs), laptops, servers, and printers. Computer devices have

processors, memory, and a means of link with a specific kind of network.

Conventional cellphones do not drop within the definition of a computer device;

however, modern phones and even audio headsets are beginning to mix computing

power and network adapters. Eventually, most electronics will show wireless network

connections (Yick. et al., 2008).

1.2 Problem definition

Research of routing protocols in wireless sensor networks is one of the hot

subjects at this stage. LEACH Protocol is the first protocol of hierarchical Routings

which suggests data fusion; it is of milestone importance in clustering routing

protocols. Lots of hierarchical routing protocols are improved ones based on LEACH

protocol (Singh et al., 2010). So, when wireless sensor networks progressively go into

our lives, it is of great importance to study on LEACH protocol, but LEACH protocol

suffers from a problem such extra transmission by that each node selects a cluster-

Head that is closest to it regardless of how far from base station it is, and this will

consume a lot of its energy for cluster head nodes and a power consumption in overall

network if the distance is far.

1.3 Research objectives

This research aims at achieving the following objectives:

3

1. To reduce power consumption in cluster head by selecting a cluster head

according to minimum distance

2. To reduce power consumption in overall networks by reducing power

consumption in a cluster head and when a cluster head is located between a

normal nodes and a base station will reduce extra transmission and the power

consumption of overall network will be reduces.

1.4 Research contribution

distance from normal nodes to every cluster heads and base station is calculated and

selecting a cluster head that through it a distance is minimum and this leads to reduce

power consumption in cluster head and when a cluster head is located between a

normal nodes and base station and a power consumption for a cluster head reduced a

power consumption in overall networks will be reduced.

4

Thesis Outline

The remainder of this thesis is organized as follows:

Chapter 2: The second chapter provides a discussion of the general

background in WSN and Low Energy Adaptive Clustering Hierarchy

("LEACH") Background, and presents a related literature review about

LEACH protocol.

Chapter 3: This chapter discusses the research methodology used to study the

current system and the simulation methodology used to implement the new

algorithms.

Chapter 4: This chapter provides more details about the proposed model:

explains the overview and official description of the proposed algorithms in

the model.

Chapter 5: This chapter presents the mathematical analysis for the proposed

algorithm along with simulations conducted to evaluate the performance of

proposed algorithm and compare it with existing algorithm.

Chapter 6: In this chapter the dissertation is summarized and conclusions are

presented for possible future directions.

5

Chapter 2

Background of Low Energy Adaptive Clustering Hierarchy and

Related Work

This chapter gives a discussion of the general background in WSN and Low

Energy Adaptive Clustering Hierarchy ("LEACH") background, and presents a

related literature review about LEACH protocol.

2.1 Applications of WSN

WSN has an attracted domain because it is applied for different applications

such as:

1- Area monitoring: WSN is used to monitor a condition over some

regions for example in military, where the sensors are used to detect

enemy intrusion [(Yick. et al., 2008), (Prasanna, 2012), (Vaish,

2009)].

2- Structural health monitoring: WSN can be used to monitor the health

such as monitor temperature pressure (Prasanna, 2012).

3- Data logging: WSN are also used for monitoring information, such as

the monitoring of the temperature in a fridge to the scale of water in

overflow tanks in nuclear power plants. The statistical information then

applied to display if the system has been working well or not

(Prasanna, 2012).

2.2 Characteristics of WSN

6

The main characteristics of WSN are (Raghuwanshi, 2003):

1. Minimum power due to using batteries.

2. If a node is fails, there is an ability to cope with this type of failure.

3. Mobility of a node: It is the ability of the network to maintain mobile

nodes and unstable data paths.

4. There is a lot of heterogeneity of node.

5. Scalability: It is the ability of the network to grow without excessive

overhead.

6. Ease of use.

2.3 Communication Protocol used in WSN

WSN used layered architecture as shown in Figure 2.1 (Alkhatib, and Baiche,

2012):

Application Layer

Transport Layer

Network Layer

Data Link Layer

Physical Layer

Figure 2.1 Layered Architecture of WSN.

1. Physical Layer

The purpose of physical layer is to increase the reliability by reducing path

loss effect and shadowing. The objective of this layer is establishing connection, data

7

rate, modulation, data encryption, signal detection, frequency generation and signal

detection.

2. Data Link Layer

The purpose of Data link layer is to guaranty interoperability amongst

communication between nodes to nodes. The objectives of this layer are: error

detection, multiplexing, forbidding of collision of packets, and iterative transmission.

3. Network Layer

The objective of a Network layer is to discover best track for efficient routing

mechanism. This layer is responsible for transferring the data from node to node, node

to base station, node to sink, node to cluster head and vice versa. The LEACH and

PEGASIS (Power-Efficient Gathering in Sensor) Information Systems are the

protocols which describe the mechanism to avoid the energy consumption (power of

sensor) so as to upgrade the life of sensors.LEACH gives cluster based transmission

while PEGASIS is a chain protocol. WSN use ID based protocols and data centric

protocols for transferring mechanism. In WSN, every node in the network acts as a

router (because they use propagation mechanism), so as to secure routing protocol.

Encryption and decryption mechanism are applied for secure routing.

4. Transport Layer

The purpose of Transport Layer is to establish communication for external

networks i.e. sensor network coupled to the internet. This is the most challenging

problem in wireless sensor networks.

5. Application Layer

8

The purpose of Application Layer is to present final output by ensuring smooth

information flow to lower layers. The objective of this layer is data collection,

management and processing of the data through the application software for obtaining

reliable results. SPINS (Security Protocols in sensor Networks) supply data

authentication, replay protection, semantic protection and low overhead.

2.4 Algorithm Paradigms for Wireless Sensor Networks

Sensor applications request the communication of nodes to run certain steps or

algorithms. In fact, three types of algorithms can be run on wireless sensor networks

(Boukerche, et al., (2009)):

Centralized Algorithms: They are run in a node that has the knowledge of

the whole network. These algorithms are quite rare because of the cost of

transferring the data to make the node know the status of the complete

network.

Distributed Algorithms: The communication is propped by message-passing.

Local based Algorithms: The nodes use limited data obtained from a close

area. With this local information, the algorithm is run in one node.

2.5 Sensor Node Structure

The main components of WSN node are shown in Figure2.2: Communication

unit, processing unit, sensing unit, power unit (Raghuwanshi, 2003).

9

Figure 2.2: Structure of Sensor Node (Singh, et al., 2010)

Sensing unit: consists of sensors and analogy digital converter (ADC),

sensors equipped with a battery, and this battery will expire after a time and

it is hard to replace it in some applications that is used for such as: in

homeland defence, military surveillance, and environmental sensing, and

thus a WSN has a limitation of energy, that the consumption of energy in a

WSN fall in: sensing, computing, and communicating. The ADC in sensing

unit is used to convert a signal from analog to digital by ADC. Sensors

sense physical or environmental phenomena and generate an analogy signal

then ADC is used to convert this signal to digital signal.

Processing unit: the processing unit consists of microcontroller and

microprocessor and it provide control to sensor node.

Communication unit: it is responsible for data transmission and reception

over a channel.

Power unit: consists of battery for supplying power to derive other

component in the system.

2.6 Clustering

10

A network can be divided into several clusters, and this technique is called

clustering. Clustering means the division of data into groups of similar object, these

groups are called clusters. In a WSN with a large number of energy constrained

sensor it is important to organize sensors into clusters to minimize the energy

consumption (Vaish, 2009).

The advantages of clustering are: reduce the energy consumption, scalability,

prolong the network lifetime, reduce the delay, and handle the heterogeneity of

network.

In every cluster there is a cluster head responsible of its cluster, and the sensor

in WSN collects data from the surrounding environment sends this data to cluster

head, a cluster head then aggregates data then sends it to sink node, and the sink may

be is connected to other sink node or to the internet.

A network in a WSN can be classified to structured _based or operation _based,

and depending on operation based protocol, WSN can be classified into: multipath

based routing, query based routing, negotiation based routing, QoS based routing,

and coherent based routing, while a network structure protocol can be classified into:

flat based routing, hierarchical based routing, and location based routing. Hierarchical

based routing divides the network into different clustered layers. Different sensors

nodes are grouped into cluster with a cluster head responsible of routing from cluster

to base station or to other cluster head but first data aggregated into cluster head then

the routing begins (Yick. et al., 2008).

There are some challenges while transmitting the sensed information in the

networks or outside the network when using a cluster based routing protocol such as:

some cluster based routing protocol are suitable for small regions or small number of

11

nodes only, some of cluster based routing protocol are suitable to deploy a node in

static manner thus it is not suitable for mobile nodes, in some cluster based routing

protocols the distribution of cluster head is concentrated to one area only, some

cluster based routing protocol is not suitable for time critical application, some cluster

based routing protocol allows all cluster heads to send data aggregated to base station

which reduces the energy consumption (Yick. et al., 2008).

2.7 Design Factors for Wireless Sensor Networks

The common factors that influence a design of WSN are shown below in Table

2.1

Table 2.1 Factors for Wireless Sensor Networks (Römer, 2005)

2.8 Low Energy Adaptive Clustering Hierarchy ("LEACH")

As a new information gain and processing technology, WSN has a wide range of

implementation in military, environmental observation, smart furniture and space

investigation, and so on (Mascolo, et al., 2002). WSN can be as an autonomy system

made up of many sensor nodes prepared to intercommunicate by wireless radio, and it

can participate in real time monitoring, perceiving and gathering information of

various environmental or monitoring objects and transmit this information to the base

Factor Options

Node

deployment

Random, manual, one-time, iterative

Mobility Immobile, partly, all; occasional, continuous; active, passive

Network

topology

Single-hop, star, networked stars, tree, graph

Coverage Sparse, dense, redundant

Connectivity Connected, intermittent, sporadic

Network size Hundred, thousand, more

Communications Laser, infrared, radio-frequency (narrowband, spread spectrum,

UWB)

12

station. It does not need a stable network support and it has rapid employment,

survivability and other features so it has a good application prospect．

Research of routing protocols in wireless sensor networks is one of the hot

subjects at this stage. LEACH Protocol is the first protocol of hierarchical Routings

which suggests data fusion; it is of milestone importance in clustering routing

protocols. Lots of hierarchical routing protocols are improved ones based on LEACH

protocol (Singh S., et al., 2010). So, when wireless sensor networks progressively go

into our lives, it is of great importance to study LEACH protocol.

2.9 What is a LEACH Protocol?

LEACH is a hierarchy routing protocol used in WSN to increase the life time of a

network, in LEACH protocol sensors organize themselves in a cluster and one of

these nodes acts as cluster head, only a cluster head is allowed to send to base station,

cluster head collects data from all nodes then aggregates and compress it and send it

to base station. LEACH is a self-organizing, clustering, and adaptive protocol. Leach

has the proposition according to Sensor features and Base Station (Barai, L., and

Gaikwad, M., 2014).

2.10 LEACH Sensor Characteristics

In LEACH protocol sensors and base station has some characteristics such as

(Ramesh, and Somasundaram, 2011):

• Sensors are sensing surroundings at fixed rate.

• Sensors communicate among each other and to the base station.

• All sensors are homogenous and have energy constraint.

13

• Nodes located close to each other have correlated data.

While a Base Station:

• Base station is fixed.

• Base station is located far from sensors.

In LEACH protocol, a cluster head is not fixed, LEACH uses a concept of rounds

and each round consists of two phases: setup phase, steady state phase and each phase

consists of two phases (Dhawan,and Waraich, 2014)

Set-up Phase:

1. Advertisement Phase.

2. Cluster Set-up Phase.

In a setup phase, every single node elects itself to become a cluster head by

picking a random number between 0 and 1 and then compute threshold T (n) formula

as shown below (2.1) (Heinzelman, et al., 2000):

Such that:

P: desired Percentage to become a Cluster head.

r: Current Round.

G: Set of nodes that have not been selected as Cluster head in last 1/P rounds.

14

If a random number is less than a computed T (n) the node becomes a cluster head

and a node that become a cluster head in a round 0 will not become a cluster head in

next 1/p round and a T(n) will be 1 after 1/p-1 and all nodes will be eligible again to

become a cluster head, after a cluster head is elected the cluster head broadcast an

advertisement message to the rest of the nodes by using Carrier sense multiple access

(CSMA MAC protocol), and each node decides to which cluster to belong according

to received signal strength indicator (RSSI) of advertisement, and after a node selects

a cluster head it transmits its selection using CSMA MAC protocol, during this all

cluster head must keep receiver on.

Steady Phase:

1. Schedule Creation

2. Data Transmission

In Steady Phase a cluster head creates Time Division Multiple Access (TDMA)

schedule according to number of nodes in cluster after a member node receives the

schedule, it transmits data in its own time slots, and leftover in the sleep state in other

slots. After a frame time of data transmission, the cluster head turn on the data

compression algorithm to process the data and transmits the results directly to the sink

node.

The Figure 2.3 below shows the Pseudo code of LEACH protocol.

15

Figure 2.3 Pseudo code describing the operation of LEACH protocol (Kole et al., 2014)

2.11 Is a LEACH protocol suitable for the WSNs?

LEACH protocol is suitable for the WSNs under the following assumptions

(Mehndiratta et al., 2013):

Notation:

N: number of nodes.

CH:cluster head.

Setup phase:

In this phase cluster are created …..Cluster heads are chosen

forEach(node N)

N selects a random number r between 0 and 1

If (r <threshold value)

N become a CH

N broadcasts a message advertising its CH status

Else

N become a regular node

N listen to advertising message of CHs

N chooses the CH with strongest signal as its cluster head

N informs the selected CH and becomes a member of its cluster

EndIf

forEach(CH)

CH creats a TDMA schedule for each node to transmit data

CH communicates the TDMA schedule to each node in the cluster

Endfor

Steady State phase:

forEach(regular node N)

N collects sensed data

N transmits the sensed data to the CH in the corresponding TDMA time slot

Endfor

forEach (CH)

CH receives data from the nodes of the cluster

CH aggregates the data

CH transmits the data to base station

Endfor

16

1. All senor nodes are static, similar and have the same amount of initial energy.

All nodes expend energy at the same rate and are able to know their residual

energy and control transportation power and distance.

2. Every node can directly communicate with every other node, including the

sink node.

3. The Sink node is fixed and far away from the wireless network. Thus we can

ignore the energy consumed by the sink node.

4. Every node has data to transmit in every time frame. The data transmitted by

sobering nodes are related and can be fused.

2.12 Radio Signal Propagation Model:

Radio Signal Propagation Model is used to describe the state of energy

communication and can be divided to free space model and to multiple propagation

model according to the distance between the sending node and receiving node.

The protocol supposes that the communication channel is symmetrical; the Energy

consumption of l bits message among two nodes for a distance of d can be shown as

Formula (Liao, and Zhu, 2013).

(2.2)

ERX(l)=Eelec*l (energy consumption for receiving l bit data) .

ETx(l,d):is the energy consumption of l bit data to node for a distance d .

Eelec: energy consumption for transmitter and receiver circuit.

fs and mp are the amplifier parameters of transformation correspondent to the

multi-path fading model and the free-space technique respectively.

17

do: is threshold distance between and multipath fading and a free space model such

that do can be calculated according to Formula (Liao, and Zhu, 2013).

(2.3)

Energy consumption of radio signal transmission is proportional to the distance d.

If transmission distance is short, do ≤ d and d2 is used; else if transmission distance is

long, do > d and d4 is used (Liao, and Zhu, 2013)

The energy consumption to transmitting a data from non-cluster head node to

cluster head node is:

ETx(l,d)=Eelec*l+ fs*l*d2 (2.4)

While transmitting a data from a cluster head node to base station is (Liao, and

Zhu, 2013):

ETx(l,d)=Eelec*l+ mp*l*d4 (2.5)

LEACH does not supply visibility about position of sensor nodes and the number

of cluster heads in the Network.

2.13 Disadvantages of LEACH:

• Each Cluster-Head immediately communicates with BS no problem the distance

between CH and BS. It will consume a lot of its energy if the distance is long.

• The CH uses most of its energy for transmitting and gathering data, because, it will

die faster than other nodes.

18

• The CH is always on and when the CH die, the cluster will become useless because

the data collected by cluster nodes will never reaches the base station [(Liao, and

Zhu, 2013), (Braman, Umapathi, 2014)].

2.14 Related work

Power consumption is the main concern in developing (WSN) applications.

Consequently, several strategies have been introduced for estimating the power

dissipation of this kind of application. These strategies can help to predict the WSN

lifetime, give recommendations to application developers and may optimize the

energy dissipated by the WSN applications.

Heinzelman, et al., (2000) proposed a clustering algorithm for sensor networks,

called Low Energy Adaptive Clustering Hierarchy (LEACH). LEACH forms clusters

by employing a distributed algorithm, where nodes produce independent decisions

without any centralized control. LEACH organizes the nodes in the network into

clusters and selects one of them as CH. The operation procedure of LEACH is divided

into rounds. Each round starts with a setup phase when the clusters are organized, the

second is a steady-state phase when data is transmitted from nodes to the CH and then

to the BS.

LEACH-E (Energy Low Energy Adaptive Clustering Hierarchy) presents a new

approach to define lifetime of sensor in that all a node have the same energy and same

probability to become a cluster head then, after the first round the residual energy will

be change and the cluster head will the nodes with high residual energy thus the nodes

themselves determine whether they become cluster-heads. A communication with the

base station is not necessary (Handy, et al., 2000).

19

Kumar et al., (2011) Discussed a LEACH-F (Fixed number of cluster Low

Energy Adaptive Clustering Hierarchy) this protocol uses centralized approach for

cluster formation. Once the cluster formation process is done, then there is no need to

re-clustering phase in next round. The clusters are fixed and only rotate cluster head

nodes within its clusters; the steady-state is the same as classical LEACH. The

advantages of this protocol are that re-clustering is not needed once the fixed number

of clusters is formed; they are maintained throughout the network. The disadvantages

of this protocol provide no flexibility of adding or removing the nodes once clusters

are formed and nodes cannot adjust their behaviour on node dying.

Depedri et al., (2003) introduced a new adaptive strategy to select cluster

heads and to distinguish their election’s frequency considering the dissipated energy

and proposed a new idea for cluster’s formation, which considers the total path energy

consumption between the node and the last receiver, and considers the energy

consumption by cluster heads to transfer their broadcast packets

Two level Low Energy Adaptive Clustering Hierarchy this protocol adding

another level in the cluster two levels in TL-LEACH comparing to the respect of

LEACH that considers only a one level. That TL-LEACH is able to deliver more data

packets than the Original LEACH protocol as TL-LEACH improves energy efficiency

by using a cluster head node as relay node in between cluster head nodes. (Loscrì, et

al., 2005).

Muruganathan et al., (2005) introduces a LEACH _C a centralized clustering-

based routing protocol that utilizes the high-energy base station to achieve most

energy-intensive tasks. By using the base station, each node sends its current location

and energy level to the base station and the base station uses this global knowledge

20

via GPS or other tracking methods to produce better clusters require less transmission

of energy. The base station will choose only those nodes to become cluster head

nodes which have enough energy level and broadcast this information to all nodes in

the network.

Sindhwani, and Vaid, (2013) introduces Vice Cluster Head Low Energy

Adaptive Clustering Hierarchy which improves the drawback in LEACH protocol by

having vice-cluster head in each cluster that takes the role of cluster head when cluster

head dies, this reduces overhead of selecting new cluster head each time when a

cluster head dies and the data will always reach to the base station and causes

increasing a life time of a network.

Boukerche, (2009) DE-LEACH guarantee that nodes which are far away from

base station will be cluster head only when they have enough energy for doing this

task and nearby nodes specially in the mid of the sensing area have the maximum

probability to be a cluster head in a round.

Abdellah, and hssane, (2010) Proposed Advanced Low Energy Adaptive

Clustering Hierarchy A-LEACH is an extension of the LEACH, which improves the

stable area of the clustering hierarchy and reduces probability of failure nodes

employing the particular parameters of heterogeneity in networks. In these networks

some high energy nodes called CAG nodes become cluster head to collect the data of

their cluster members and transfer it to the sink or Gateways to minimize the energy

consumption of cluster head because it is employed to route information from cluster

head to the sink, which permits to minimize the failure probability of clusters head

and this increase the lifetime of the network.

21

Farooq et al., (2010) Multi-hop Routing with Low Energy Adaptive

Clustering Hierarchy partitions the network into different layers of clusters and in

each layer there are a cluster head and then cluster heads collaborates with adjacent

layers to transmit sensor’s data to the base station. MH-LEACH adopts an optimal

path between cluster head and base station

Liao, and Zhu (2013) shows that An Energy Balanced Clustering Algorithm

Based on LEACH Protocol depend on the residual energy and distance factors, and

these improve cluster-head election and the strategy of non-cluster head node

Selecting the optimal cluster-head.

Bakaraniya and Mehta, (2013) K-LEACH, to prolong the lifetime of a sensor

network by regular clustering through k-medoids algorithm and balancing the

capacity of entire network among all active nodes. It guarantee regular clustering of

nodes and gives suitable location of CH. It uses the combination of clustering,

maximum residual energy criterion and a random chosen of CHs only after almost

50% of rounds of operations of the network gets over, whereas the LEACH protocol

does totally random selection of CHs, which leads to very poor chosen of CHs and

consequently leads to highly inefficient lifetime and energy retention by the network.

Kole et al., (2014) Distance Based Cluster Formation improves LEACH

protocol to enhance network lifetime. The distance of the node from base station is a

significant in cluster formation which will minimize some extra transmissions in

existing LEACH protocol.

22

Chapter3

Research Methodology

Simulations play a critical role in the development and testing of sensor

networking protocols. The aim of this chapter is to provide details about the

simulation procedures and evaluation methods that were commonly used through this

research. This chapter describes the research methodology and methods, investigation

procedures, simulation tool that were used in designing different network scenarios,

the network simulation environments, and the validation techniques used throughout

this research.

Methods for Studying a System

There are various methods available for the study of a system. Figure 3.1

identifies methods for studying a system and illustrates how they are related to each

other (Law and Kelton, 2000).

1. Experiment with actual system - this is used when it is possible to make

changes to the actual system, and the actual system can work under the new

conditions. However, it is not often feasible to make changes to an actual

system and allow it to operate under new conditions.

2. Experiment with a model of the system - this is used when the system is

complex, when experimentation with the actual system is costly, and when it

is very difficult to make the actual system. If the actual system does not exist,

then experimentation with a model of the system is used.

3. Physical model - this means a physical representation of something. It is

suitable for engineering and management systems.

23

4. Mathematical model - the system is represented in terms of logic and

quantitative relationships in order to study the relationship between the

changes that have been made to the system and how the system reacts.

5. Analytical solution – this is used after building the mathematical model. The

mathematical model must be examined to see how it can be used to study the

system being represented. Analytical solution is a good method to study a

system when an analytical solution to a mathematical model is available and

when it is computationally efficient.

6. Simulation - this is used when real systems are very complex and the

mathematical models of them are also complex.

There are three methods for performance evaluation, namely simulation,

analytical modeling, and measurement (Jain, 1991). This research is based on a

network simulation. Measurements from real systems are excluded because the

implementation of the proposed approach in real sensor networks would have been

too time consuming for this study.

24

Generally, and for primary investigations, the simulation gives ability to

change network topologies, protocols and parameters to be carried out easily and in

realistic time. Simulation provides more flexibility than the real network

implementation and has fewer complications. Furthermore, more control over the

network conditions could be achieved by using simulations. And the analytical model

was developed to validate the simulation results.

Figure 3.1- The methods for study the performance of a system

25

As there is no human aspect to this research, the use of questionnaires,

observation, case studies and sampling is not appropriate. However, future work could

investigate the human aspects of this issue by using the results to design a

questionnaire which measures the satisfaction of users and operators.

The research method of this study involves data collection from a simulation

runs using MatLab. Within the simulation process, data was collected from simulation

runs and then quantitatively analyzed. The analysis and critical evaluation of data

were based on two criteria: (i) the results collected from the simulation of the previous

existing strategies and (ii) the results collected from the simulation of the proposed

approach.

Figure 3.2 illustrates the research methodology applied in this research. It

follows a logical progress of sequential events and information that begins with the

identification of the problem, namely an improvement that can be made to sensor

networks, in particular LEACH protocol, for a more efficient, effective and stable

network with improved longevity based on the research of the current literature and

consensus of opinion of researchers in the field. Becoming more specific, cluster head

election strategies were identified as the area where a new strategy might bring

advantages to LEACH and thus increase its popularity and ease of application.

Based on the literature review and current schemes being used, a new strategy

was developed for testing and analysis to observe its performance in comparison to

the original LEACH. Establishing the parameters and building the scenario whereby

the proposed approach could be tested with results that would be valid and relevant

was the next step. Appropriate tools were selected as recognized within the industry

for their veracity and ease of use. There a followed simulation and analysis of the

26

results to confirm the performance of the proposed approach when compared to the

original approach.

Figure 3.2 - Research Methodology

MatLab was more reliable and suitable for this kind of research work, since

MatLab has features of high-level language programming and its interactive

environment that help scientist and engineers to come across solutions to problem

1

•Problem Identification and Selection (Sensor Networks) •State of art

•Problem history

•Knwloedge gap

2

•Literature Review ( Sensors and LEACH Protocol) •State of art study

•Books, paper and journals

•Internet resources

3 •The Proposed Approach (Enhanced LEACH) •new algorithm

4

•Simulation Implementation •Scenario building

•simulator configuration

5

• The Result •Graph results

•reconmendation and conclusion

27

with adapting programming language. MatLab is used widely for science disciplines

of algorithms development, modelling energy consumption, data analysis and

visualization (Etter and Kuncicky, 2011).

28

Chapter 4

The Proposed Approach

This chapter describes the proposed approach and algorithms which are used

in this thesis. The critical goal of this approach is to reduce the power consumption,

meaning reducing power consumption in cluster head nodes and overall network and

increase the life time of a network. It starts with the traditional scheme (LEACH

protocol) that is mentioned in the chapter 2, explores how it can be improved step by

step. The idea of the proposed approach starts by describing the operation of LEACH

protocol as seen in chapter 2 in Pseudo code.

4. 1 The Proposed Approach

The Proposed approach is the same as the LEACH protocol in such that two

approaches (LEACH and the Proposed) have two phases: setup phase and steady

phase.

In a setup phase: Every node selects a random number between zero and one

if that number is less than or equal to some threshold (threshold (T (n)) as

calculated according to equation below (Heinzelman, et al., (2000)) a node

becomes a CH else a node becomes an ordinary node this process is repeated

to all nodes and when a cluster heads are chosen.

(4.1)

29

Such that:

P: desired Percentage to become a Cluster head.

r: Current Round.

G: Set of nodes that have not been selected as Cluster head in last 1/P rounds.

After cluster heads are chosen then they broadcast advertisement message to

all ordinary nodes. Ordinary nodes must select an appropriate cluster head for it by

computing the distance (a distance is calculated a according to Euclidean distance

Formula as seen below (Zhang, et al., 2014) from itself to each cluster head to base

station and repeats this process to all cluster heads to each base station (base station is

fixed).

(4.2)

A minimum distance is chosen and an ordinary node selects a cluster head that

has the minimum and an ordinary node sends a message to inform a cluster head that

through it the distance is minimum, and that it will be a member of it, this process is

repeated to all nodes until all nodes select appropriate cluster head for it and

according to number of rounds that is Required.

After receiving a request message from ordinary nodes cluster heads create a

TDMA schedule for each member in it. TDMA schedule asigns a time slot for every

ordinary member node in it, it means that every ordinary member node is only

30

allowed to send in its allowed time slot for it else it waits to allow time and go in

sleep mode (Römer, 2005) then a setup phase is completed.

In Steady phase:

After a setup phase is completed a steady phase begins, a steady phase is the

same as in LEACH protocol, such that an ordinary node collects a data from

surrounding environment and then sends this data (in its allowed time slot for it) to

cluster heads that chosed by in the setup phase energy consumed to transmit data

through cluster head is calculated as below in Formula (Ramesh and Somasundaram,

2011)

ETx(l,d)=Eelec*l+ fs*l*d2 (4.3)

In such:

ETx (l,d): is the energy consumed to send l bit data .

Eelec: energy consumed by the transmitter and the receiver circuit.

fs: amplifier parameters of transformation corresponding to the free-space

technique.

d: Euclidean distance between an ordinary node and cluster head as shown above.

L: packet data.

Cluster heads receive collected data from its members and runs the data

compression algorithm to aggregate the collected data. Cluster heads send a

compressed data to base station. The amount of energy consumed is calculated by

equation 4.4 (Ramesh and Somasundaram, 2011):

ETx (l,d)=Eelec*l+ mp*l*d4

(4.4)

In such:

31

mp is the amplifier parameters of transformation correspondent to the multi-path

fading model.

Pseudo code for describing the operation of the proposed approach is shown

below, the improvements done by the proposed approach is shown in bold font:

Notation:

N: number of nodes.

CH:cluster head.

Setup phase:

In this phase cluster are created …..Cluster heads are chosen

forEach(node N)

N selects a random number T(n) between 0 and 1

If (T(n) <threshold value)

N become a CH

N broadcasts a message advertising its CH status

Else

N become a regular node

N listen to advertising message of CHs

EndIf

forEach CHs

Calculate a distance from N to CH and from CH to base station

Endfor

N chooses the CH with minimum distance from it to CH to base Station

N informs the selected CH and becomes a member of its cluster

Endfor

forEach (CH)

CH creates a TDMA schedule for each node to transmit data

CH communicates the TDMA schedule to each node in the cluster

Endfor

Steady State phase:

forEach (regular node N)

N collects sensed data

N transmits the sensed data to the CH in the corresponding TDMA time slot

Endfor

forEach (CH)

CH receives data from the nodes of the cluster

CH aggregates the data

CH transmits the data to base station

Endfor

32

Chapter 5

Simulation Evaluation

This chapter presents and discusses results of simulation process to evaluate

the performance in the routing protocol (LEACH) and The Proposed approach,

Firstly, an introduction of simulation software, and the evaluation analysis and

evaluation of system; finally, an analysis of the results were presented with intense

discussion.

5. 1 Simulation Software

In this research, MatLab® commercial software version R2009a has been used to

implement and simulate the proposed approach. The simulation performed on

TOSHIBA® PC, Intel® Pentium® CPU, and p6100 2.00GHz, RAM is 2 GB. Many

factors have been taken into consideration that plays main role in the designed

scenarios.

The choice of MATLAB was made because of its powerful features and flexibility

enough to adjust the variables and network parameters, MatLab was more reliable and

suitable for this kind of research work, since MatLab has features of high-level

programming language and its interactive environment that helps scientists and

engineers to come across solutions to problem with adapting programming language.

MatLab is used widely for science disciplines of algorithms development, modelling

energy consumption, data analysis and visualization (Etter and Kuncicky, 2011).

5. 2 Simulation Scenarios and Assumptions

33

This study evaluates performance parameters here: a power consumption in:

normal node and cluster head nod and normal node plus cluster head node.

Normal nodes: is used to evaluate the power consumption in it .Node

calculates a distance from it to every cluster head in a network and from

cluster head to base station and selects a minimum distance between all

distances that calculated before. The distance is calculated according to

Euclidian Formula below:

Distance (node(x,y),cluster head(x,y))=

(5.1)

Distance (cluster head(x,y),base station(x,y))=

(5.2)

Distance =minimum (Distance (node(x,y),cluster head(x,y)+ Distance (cluster

head(x,y),base station(x,y)))……. (5.3)

After a normal node selects a way to send a data through it, and sends a data to

appropriate cluster head and after that power consumption to normal node is add to

previous normal nodes to obtain the energy to all normal nodes.

Cluster head node: after a data reached to cluster head the cluster head apply

a compression schema and aggregates all data in it and sends a compressed

34

data to base station. And after all rounds and energy to every cluster head is

added to other to obtain the total energy for all cluster heads.

The summation of normal node and cluster head node: after calculating

power consumption for the normal node and power consumption for cluster

head nodes, the result from power consumption for the normal node is add to

result to power consumption for cluster head to obtain total power

consumption to all nodes in a network.

5. 3 System Environment and Network Model

To demonstrate some concepts in the proposed approach, this section describes

the network model and system environment assumptions for the proposed scheme.

1. The network field Dimensions are (yard .Length, yard .width).

2. Fixed coordinates of base station (Sink.x,Sink.y).

3. The network constitutes of a group of nodes (N) that communicate together.

Where N is the number of nodes in the field.

4. Optimal election probability of a node to become a cluster head (p).

5. Each node has an initial energy (Eo), and energy for transfer (Energy. transfer)

and energy for receiving (Energy. receive).

6. If the communication distance is less than distance threshold d0 free Space

channel model is used otherwise, multi-path fading model is used.

7. Energy.aggr is used for data aggregation energy.

8. Sensor nodes are homogenous.

9. The Proposed method uses cluster-based structure.

35

5. 4 System Environment

1. Nodes read and collect a data from the surrounding environment.

2. Every node in a network has a random number between 0 and 1.

3. A threshold T (n) is calculated.

4. If a random number of a node is less than or equals to threshold it is selected

to be cluster head to the current round if not it will be a normal node.

5. Every normal node calculates a distance from it to every cluster head and from

a cluster head to base station.

6. Non-cluster heads must listen to the medium and choose away that has a

minimum distance.

7. Non-cluster heads sends a data collected to cluster head that has minimum

distance if a node selects and sends through it according TDMA schedule.

8. Cluster head aggregates data collected from nodes and send it to base station.

5. 5 Evaluation Metrics

Power consumption: show the effect of power consumption when the Proposed

approach and LEACH simulates in all cases using MatLab simulator.

The input data for a simulation is presented in Table 5.1 below (Sharma et al, 2016).

36

Table 5.1 Simulation parameters

Parameter Default value

Simulation area 100m×100m

Number of nodes 100 nodes

Packet Length(default packet length from cluster head to

base station )

6400bit

ctrPacket Length(default packet length from normal node to

cluster head)

200bit

Initial energy 0.5Joule

Base station coordinates (50,50)

Probability to node to become a cluster head 0.1

Energy for transferring of each bit 50*0.000000001 nJ/bit

Energy for receiving 50*0.000000001 nJ/bit

Energy for free space model 10*0.000000000001 PJ/bit/

m2

Energy for multipath model 10*0.000000000001pJ/bit/m4

Energy for data aggregation

5*0.000000001 nJ

37

5. 6 Simulation Steps

Simulation process is carried on and applied precisely for the purpose of achieving

best results:

Step 1: Input data shown in Table 5.1 were selected, tabulated and applied

collectively on different scenarios using LEACH protocol and the second scenario

and using the Proposed for a span area of 100m x 100m.

Step 2: Run two versions for each scenarios.

Step 3: Simulation results show a variety of plotted graphs and tables using the

assigned metrics for two of networks with different number of nodes and different

number of rounds.

5. 7 Simulation Analysis and Results

This section illustrates the impact of power consumption in CH and in overall

network by using different scenarios in that every scenario has a different number of

nodes and rounds and suppose there is a base station at a center. Results are detailed

in the following sections.

In cluster head nodes

In cluster head node the simulation is done to monitor power consumption in CH in

LEACH protocol and the proposed approach:

The number of rounds equal 9 and the number of nodes are 45, 50, 55,60,70,75,80,

and 85.

38

In overall network

In overall network the simulation is done to monitor power consumption in overall

network Scenario the number of rounds equal 9 and the number of nodes are 45, 50,

55,60,70,75,802, and 85.

In cluster head nodes

Table 5.2 below shows Power consumption in cluster head nodes when using LEACH

Protocol with different number of nodes and 9 rounds for each of them.

Table 5.2 Power consumption in Cluster Head Nodes when using a LEACH Protocol with different

number of Nodes and 9 rounds for each of them.

Table 5.2 shows a result of power consumption in cluster head nodes in LEACH and

power consumption in the proposed method. In such when a number of nodes are

increased power consumption in proposed approach is less because a a normal node

must selects a cluster head that through it a distance is minimum so extra transmission

will not occur and a cluster head locates between a normal node and a base station so

a power consumption for cluster heads will reduce.

45 50 55 60 70 75 80 85 Number of

nodes

21.8456 24.3267

26.8085

29.2927

34.2565 36.7381 39.2212 41.7026

Power

consumption

in CH in

leach

21.2544 23.5575

25.9223

28.3267

33.0802 35.4083 37.8050 40.2099

Power

consumption

in CH in

proposed

method

39

Figure 5.1 below shows Matlab plot for a power consumption in LEACH and

proposed approach for different number of nodes and 9 rounds

Figure 5.1 a power consumption in LEACH and proposed approach for different number of nodes and

9 rounds

The final extracted result plot for cluster heads shows Improvement over a

LEACH protocol in such a LEACH line above the proposed line it means proposed

approach consumes power less than LEACH protocol.

In Overall network

40

Table 5.3 below shows the impact of Power consumption in overall network

nodes when using LEACH Protocol with different number of nodes and 9 rounds for

each of them.

Table 5.3 Power consumption in overall network when using a LEACH Protocol with different number

of Nodes and 9 rounds for each of them.

Table 5.3 shows a result of power consumption in overall network nodes in

LEACH and power consumption in the proposed method. In such when a number of

nodes are increased power consumption in proposed approach is less because a power

consumption for cluster head nodes is less so the power consumption for overall

network is reduced.

Figure 5.2 below shows Matlab plot for a power consumption in LEACH and

proposed approach for different number of nodes and 9 rounds

45 50 55 60 70 75 80 85 Number of

nodes 22.6280 25.1433 27.6930 30.2009 35.3502 37.8633 40.7486 43.2740 Power

consumption

in leach 22.1593 24.6214 26.9767 29.3822 34.0399 36.4571 39.1023 41.5468 Power

consumption

in proposed

method

41

Figure 5.2 a power consumption in LEACH and proposed approach for different number of nodes and

9 rounds

The final extracted result plot for cluster heads shows Improvement over a

LEACH protocol in such a LEACH line above the proposed line it means proposed

approach consumes power less than LEACH protocol.

42

Chapter 6

Conclusion and Future Work

The aim of this work was to investigate power consumption when normal nodes

select appropriate cluster head that has a minim distance from it to base station have

affect and reduce battery power consumption and therefore prolong Lifetime of

network.

A simulation based performance study was conducted to examine the power

consumption of the proposed strategy from compared LEACH, and the results show

that, the power consumption is reduced, and hence the life time of a network will be

increased. As the number of rounds is increased, the reduced power consumption will

be more reduced; finally, the proposed approach performs better in comparison with

other existing strategy.

The subject of reducing power consumption in WSNs is interesting topic due to

importance of extending a life time of a WSN. For future work of this thesis is to

extend it in multi hop routing.

43

REFERENCES

Abdellah, E., hssane, A., (2010). Advanced Low Energy Adaptive Clustering

Hierarchy. (IJCSE) International Journal on Computer Science and Engineering

2.07, Vol. 02, No. 07, 2491-2497.

Alkhatib, A., and Baicher, G., (2012). Wireless Sensor Network Architecture.

International Conference on Computer Networks and Communication Systems

(CNCS 2012) IPCSIT vol.351.

Bakaraniya, P., and Mehta, S., (2013). K-LEACH: An improved LEACH

Protocol for Lifetime Improvement in WSN. International Journal of

Engineering Trends and Technology (IJETT) – Volume 4 Issue 5, ISSN: 2231-

5381.

Barai, L., and Gaikwad, M., (2014). Performance Evaluation of LEACH

Protocol for Wireless Sensor Network. International Journal of Innovative

Research in Advanced Engineering (IJIRAE) Volume 1 Issue, ISSN: 2349-2163.

Boukerche, A., (2009).Algorithms and Protocols for Wireless Sensor

Networks. In 2nd edition, Canada: John Wiley & Sons.

Braman, A., Umapathi, G., (2014). A Comparative Study on Advances in

LEACH Routing Protocol for Wireless Sensor Networks: A survey,

International Journal of Advanced Research in Computer and Communication

Engineering Vol. 3, Issue 2 , 7722-1271 .

Boukerche, A.; Nakamura, E.F.; Loureiro, A.F (2009). Algorithms and Protocols

for Wireless Sensor Networks. In: Azzedine Boukerche,Eduardo F.Nakamura and

Antonio A.F.Loureiro, Algoritms for Wireless Sensor Networks.; Boukerche,

A., Ed.; John Wiley & Sons: Hoboken, NJ, USA.

Depedri, A., Zanella, A., and Verdone, R., (2003). An Energy Efficient Protocol

for Wireless Sensor Networks, www. cwc. oulu.fi/~carlos//WSNPapers/DE03.

pdf.

44

Dhawan, H., Waraich, S., (2014). A Comparative Study on LEACH Routing

Protocol and its Variants in Wireless Sensor Networks: A Survey.

International Journal of Computer Applications Volume 95– No.8, (0975 – 8887).

Etter, D. M. and Kuncicky, D. C. (2011). Introduction to MATLAB, Prentice Hall.

Farooq, M., Dogar, A., and Shah, G., (2010). MR-LEACH: Multi-hop Routing

with Low Energy Adaptive Clustering Hierarchy. Fourth International

Conference on Sensor Technologies and Applications, pages 262-268.

Handy, M., Haase, and Timmermann, D., (2000). Low Energy Adaptive

Clustering Hierarchy with Deterministic Cluster-Head Selection. Fourth IEEE

Conference on Mobile and Wireless Communications Networks, Stockholm,

erschienen in Proceedings, S. 368-372, ISBN 0-7803-7606-4.

Heinzelman,W., Chandrakasan,.A, and Balakrishnan,.H (2000). Energy-Efficient

Communication Protocol for Wireless Microsensor Networks.Proceedings of

the 33rd Hawaii International Conference on System Sciences (7695-049).

Jain, R. (1992). The Art of Computer Systems Performance Analysis:

Techniques for Experimental Design, Measurement, Simulation, and

Modelling. John Wiley and Sons (113-115).

Kole, S., Vhatkar, K., and Bag, V., (2014). Distance Based Cluster Formation

Technique for LEACH Protocol in Wireless Sensor Network. International

Journal of Application or Innovation in Engineering & Management (IJAIEM),

Volume 3, Issue 3 ISSN 2319 - 4847.

Kumar, V., Jain, S., and Tiwari, S., (2011). “Energy Efficient Clustering

Algorithms in Wireless Sensor Networks: A Survey,” International Journal of

Computer Science Issues (IJCSI), Vol.8, Issue 4, No 2, pp.1694-0814.

Kumar, V., Jain, S., and Tiwari, S., (2011). “Energy Efficient Clustering

Algorithms in Wireless Sensor Networks: A Survey,” International Journal of

Computer Science Issues (IJCSI), Vol.8, Issue 4, No 2, pp.1694-0814.

Law, A., and Kelton, W., (2000), Simulation Software. Simulation Modelling

and analysis. 3rd edition, McGraw Hill.

45

Liao, Q., Zhu, H., (2013). An Energy Balanced Clustering Algorithm Based on

LEACH Protocol. Proceedings of the 2nd International Conference on Systems

Engineering and Modeling (ICSEM-13), Vol.5, Issue.3, pp.90-95, 2.

Loscrì, V., Morabito, G., and Marano, S., (2005). A Two-Level Hierarchy for

Low-Energy Adaptive Clustering Hierarchy (TL-LEACH). Vehicular

Technology Conference, 1988, IEEE 38TH

(7803-9152).

Mascolo, C., Capra, K., and Emmerich, W., (2002): Middleware for Mobil

Computing (Asurvay). In advanced Lectures in Networking,

Gregori,G.Anastasi,S.Basagni.Springer.LNCS 2497.

Mehndiratta, N., Manju, and Bedi, H., (2013). Wireless Sensor Network

LEACH Protocol: A Survey. International Journal of Emerging Research in

Management &TechnologyISSN, (Volume-2, Issue-3), 2278-9359.

Muruganathan, S., and Fapojuwo, A., (2005). A Centralized Energy-Efficient

Routing Protocol for Wireless Sensor Networks, IEEE Radio

Communications 43.3 (2005): S8-13.

Prasanna, S., Rao, S., (2012). An Overview of Wireless Sensor Networks

Applications and Security. International Journal of Soft Computing and

Engineering, IJSCE, Volume-2, Issue-2, ISSN: 2231-2307.

Ramesh, K., and Somasundaram K., (2011). A Comparative Study of Cluster

Head Selection Algorithms in Wireless Sensor Networks, International journal

of computer science & engineering survey (IJCSES) vol.2, no.4 (1205.1673).

Raghuwanshi, S., (2003). Virginia Polytechnic Institute and State University,

No. 11-14-2219.

Römer, K., (2005). Time Synchronization and Localization in Sensor

Networks. Swiss Federal Institute of Technology Zuric, Diss. ETH No. 16106.

46

Singh, H., (2016). Prevention of Security Attacks in WSN Using ANN,

International Journal of Science And Higher Engineering Research (IJSHER)

Volume 1, Issue 2, ISSN (Online): 2347-4890, 294.

Sindhwani, N., and Vaid R., (2013) .V Leach: An Energy Efficient

Communication Protocol for WSN. Mechanica Confab 2.2, Vol. 2, No.2, ISSN:

2320-2491.

Singh, S., Singh, M., and Singh, D., (2010). A Survey of Energy-Efficient

Hierarchical Cluster-Based Routing in Wireless Sensor Networks. Int. J. of

Advanced Networking and Applications 570 Volume: 02, Issue: 02, Pages: 570-

580.

Singh, K., Singh M., and Singh, D., (2010). A Survey of Energy-Efficient

Hierarchical Cluster-Based Routing in Wireless Sensor Networks. Int. J. of

Advanced Networking and Applications 570 Volume: 02, Issue: 02, Pages: 570-

580.

Sharma, T., Tomar, G., Berry, I., Kapoor, A., and Jasuja, S., (2016). Cluster

Head Election with Hexagonal Node Deployment Technique in Wireless

Sensor Networks. International Journal of Future Generation Communication and

Networking Vol. 9, No. 1 (2016), pp. 247-258.

Vaish, R., (2009).Application Of Wireless Sensor Networks for

Environmental Monitoring and Development of an Energy Efficient Cluster

Based Routing, A THESIS, National Institute of Technology, Rourkela.

Venkatraman, K., Daniel, J., and Murugaboopathi, G., (2013). Various Attacks

in Wireless Sensor Network: Survey. International Journal of Soft Computing

and Engineering (IJSCE), Volume-3, Issue-1 ISSN: 2231-2307.

Yick, J., Mukherjee, B., and Ghosa, D., (2008). Wireless sensor network survey,

Computer Networks 52 2292-2330.

Zhang, L., Wahba, G., and Yuan, M., (2014). Distance Shrinkage and Euclidean

Embedding via Regularized Kernel Estimation, Journal of the Royal Statistical

Society: Series B (Statistical Methodology) 1409.5009v1.

47

48