2. Leach Protocol

advertisement

Optimizing Energy Efficiency in Wireless

Sensor Network Using LEACH Protocol

Thirunavukarasu.T

1

, Dhanabhavithra.K

2

, Monika.E

3

and Radhika.S

4

1 Department of Information Technology

SNS College of Technology,

Coimbatore-35 thirufive@gmail.com

2, 3, 4 Final year students

Department of Information Technology

SNS College of Technology,

Abstract:

Coimbatore-35 dhanabhavithrait@gmail.com

2 monikaelangovan@gmail.com

3 radhi.goa@gmail.com

4

Wireless Sensor Networks are the emerging among various sensors in order to not drain the battery of a single sensor. technology which is a combination of sensors, communication and computer technologies. Sensors only have limited energy resources and hence their functionality continues until their energy is drained. Because of these sensors the sensor nodes lifetime gets decreased. Thus a protocol called LEACH is proposed which uses randomized cluster head selection to reduce the energy consumption of the sensor nodes and hence the lifetime of sensor nodes can be extended. This paper addresses certain factors like energy consumption, throughput, packet received and bandwidth to prove the efficiency of

LEACH protocol. Simulation results show that the increased sensor nodes lifetime is achieved by the proposed protocol when compared to other protocols.

Thus the LEACH (Low Energy Adaptive Clustering

Hierarchy) protocol is used in the proposed techniques which reduces the nodes energy consumption and increases the sensor networks lifetimes. The below flowchart explains the sensor networks process.

Start

Keywords: LEACH, Cluster-Head, TDMA, WSN.

Deploy Sensor Network

1.

I

NTRODUCTION

Wireless Sensor Networks serves as the most attractive field for many researchers. But it consists of many micro devices called sensor nodes which are powered by batteries. They are widely employed in many applications such as environment monitoring, earthquake detection, etc where replacement of batteries is not practical. Therefore they should be managed carefully to minimize the consumption of energy. Several reaches have tried the use of various protocols for this situation but even the use of

MAC protocol for transmission consumes more power and hence sensor networks lifetime decreases. The main factor to be considered is the nodes energy consumption. To solve this problem the lifetime of each sensor is to be handled carefully. Different network architecture and routing protocols are analyzed after analyzing those techniques, network construction based on clustering mechanism is said to be the efficient method is energy consumption.

In these techniques, the nodes organize themselves into local clusters, with one node acting as the local base station or Cluster-Head. In conventional clustering algorithm, a particular cluster head is chosen for the operation and it is fixed throughout the system lifetime. In this case they die quickly ending the useful lifetime of all the nodes belonging to those clusters. This can be overcome by using LEACH protocol which includes randomized rotation, such that cluster head position rotates

Initialize Sensor Nodes

Information is gathered from sensor nodes

Information is sent to base station through sensor nodes

2.

L

EACH

P

ROTOCOL

Stop

The proposed LEACH protocol is a clustering based protocol which utilizes randomized rotation of local cluster heads. The main goal of this protocol is to increase the sensor nodes lifetime. Initially the LEACH protocol includes distributed cluster formation. LEACH protocol

uses randomization and selects a few sensor nodes as cluster heads. They are rotated to evenly distribute the energy load among the sensor in the network.

In some conventional clustering algorithms, a particular cluster head will be chosen and fixed throughout the system lifetime and so they die quickly. They also make an ending to the useful lifetime of all the nodes belonging to that cluster.

But here in LEACH randomized rotation of high-energy cluster head position is performed so that it rotates among various sensors in order to not drain the battery of a single sensor.

One of the main processes that our protocol performs is local data fusion. This is performed to “compare” the amount of data being sent from the clusters to the base station. This further helps in reducing energy dissipation and enhancing system lifetime. election. In order to decrease the overhead of set-up phase, the time length of each round should be increased. Every node uses a stochastic algorithm is each round to determine whether it can become a CH in this round. The

CH also creates a schedule for each node in its cluster to transmit its data.

Since these are only a few CH it only affects a small number of nodes mainly a CH drains the battery of the node. In order to avoid this, we spread this energy over multiple nodes, also the CH nodes are not fixed, and rather their position is self-elected at different time intervals.

Thus the LEACH protocol improves the energy efficiency.

LEACH protocol’s operation is separated into two phases:

1) Setup phase

2) Steady state phase

In setup phase, each node will choose a random value between 0&1. If the chosen value is less than the threshold, the node will act as the cluster-head. This

Cluster Head broadcast news to other nodes and each node decides to join with cluster node according to signal strength.

In steady state phase, the data sent from nodes such as data fusion& aggregation is processed by the cluster head nodes and transmitted to sinks i.e., data is transferred to the base station.

Set up steady state phase

Clusters formed

Slot for node 1 Slot for node 1

Frame

This protocol lets the data transmission phase last for a fixed period, then move to the new round of cluster head

3.

B

LOCK

D

IAGRAM

To construct a wireless sensor network using LEACH protocol, initially the sensor nodes must be selected according to the location. Then the sensor nodes are placed at specific locations at certain distances. Here certain protocols are used to support the LEACH protocol.

Such protocols used here are TDMA, FA, and DFA.

TDMA

Time division multiple access is a multiplexing method that divides the network connection into time slices, where each device on the TDMA network connection gets one

(or) more time slices during which it can transmit ((or) receive data.

With this TDMA protocol, each user is reassigned an exclusive slot that it can use is every IR, irrespective of whether it has a packet to deliver or enough energy to transmit.

ALOHA

Framed ALOHA

Dynamic Framed ALOHA

The Dynamic Framed-ALOHA (DFA) protocol is mainly used for wireless sensor networks with energy limitations and energy-harvesting capability. The performance of DFA in this system is evaluated in terms of the time efficiency (or throughput), which is routinely used to evaluate medium access protocols

The Framed ALOHA is a contention management mechanism which is used in wireless networks. Aloha is a very simple protocol in which the source just sends a frame of data whenever it desires. A target receiver confirms a frame whenever it receives one, and the source sends another whenever it desires. If the target receiver does not confirm the receipt of the frame within a specified time, the source resends it until it receives a confirmation.

Delivery ratio analysis

Wireless

The deliver probability measures the capability of the protocol to successfully deliver the packet of any sensor.

The statistical equivalence of all sensors makes the probability independent of the specific sensor. A sensor fails to report its measurement during an IR if it has an energy shortage. It is always relevant to evaluate the delivery probability when the system is in steady state.

Sensor nodes

TDMA

Delivery Ratio

Analysis

TDMA, FA, DFA

Event Based

Discrete

Markov

Chain

Declaration

Framed-

ALOHA

DFA

Time Efficiency

Analysis

TDMA, FA, DFA

Back Log

Algorithm

Implementation

Graph

Based

Analysis using

LEACH

Figure 1 Construction of Wireless Sensor

Network Using LEACH Protocol

Time efficiency analysis

The time efficiency measures the probability that any slot allocated by the protocol used within the IR is successfully used.

Discrete Markov Chain Analysis

To analyze the continuous instances in every packet communication Discrete Markov Chain process is used.

DMC works only depending on the event based access,

DMC does not work in fixed time factors. DMC is a random process. A discrete-time random process involves a system which is in a certain state at each step, with the state changing randomly between steps. Here this process helps to analyze and compare the protocols.

Back Log Algorithm

Applying the back log algorithm, we can test the DFA process based on energy comparison. Here backlog estimation is designed by accounting for the interplay of

EH, capture effect and multiple accesses. Computational complexity of optimal estimators is generally intractable for a large number of sensors even for non-EH systems.

We thus propose a low-complexity two-steps backlog estimation algorithm.

Network Construction

To deploy Wireless Sensor Networks environment based nodes, depending on the region, implementing the sensor nodes. Sensor nodes collect the information from the nearest neighbors and store it’s in storage node. Also Bandwidth, Energy consumption, Data

Rate, Throughput are calculated.

MAC Protocol Declaration

To implement the TDMA protocol, TDMA might not be time efficient due to many empty slots, when the probability of having a new measurement α and the EH rates are small. At the time of data transmission Framed

ALOHA (FA) is a special case of DFA where only one single frame of size is announced, as retransmission of collided packets is not allowed.

Analyzing Delivery Probability

Delivery probability ratio and time efficiency of

TDMA, FA and DFA are analyzed by applying the

Discrete Markov Chain (DMC) model. To analyze the continuous instances in every packet communication,

DMC work only depending on the event based access,

DMC does not work in fixed time factors. Applying the back log algorithm, we can test the

DFA process based on energy comparison.

Graph

Report

Generation

To generate the time efficiency based on packet delivery ratio graphs. These graphs fully depend on the

TDMA, FA, and DFA. Through this graph, proposed system proves that LEACH protocol gives better performance in backlog functionalities.

Figure2 Graph for throughput

Figure3 Graph for Energy Transmission

Figure4 Graph for bandwidth

Figure5 Graph for Packet receiver

C

ONCLUSION AND

F

UTURE

E

NHANCEMENT

The survey of LEACH protocol and their simulation results are analyzed. It has been proved that this protocol aims to maximize the lifetime of the network by increasing the nodes lifespan. Clustering is said to be one of the best techniques for efficient utilization of energy. Also traffic which induces delay and causes collision of nodes or death of nodes is also controlled because of the randomization process.

The future enhancement is to improve the quality of services in terms of delay, throughput in sensor networks using IEEE 802.15.4 standards protocols and also experimenting results using tools such as QUALNET,

MATLABs which are possible and simulation results can also be compared.

R

EFERENCES

[1] D Saha, M R Yousuf and M A Matin, International

Journal of Wireless & Mobile Networks, Vol.3, No.6,

December 2011, ‘Energy Efficient Scheduling Algorithm

For S-Mac Protocol In Wsn’s’.

[2] Fabio Iannello, Student Member, IEEE, Osvaldo

Simeone, Member, IEEE, and Umberto Spagnolini, Senior

Member, IEEE, ‘Medium Access Control Protocols For

Wireless Sensor Networks With Energy Harvesting’.

[3] G. Pierobon, A. Zanella, and A. Salloum, IEEE

Transactions on Vehicular Technology, vol. 51, pp. 781–

788, 2002, ‘Contention-TDMA Protocol: Performance

Evaluation’.

[4] Ge Ran a, Huazhong Zhang b, Shulan Gong,

‘Improving On Leach Protocol Of Wireless

Sensornetworks Using Fuzzy Logic’.

[5] I. Cidon and M. Sidi, Information Theory, IEEE

Transactions on, vol. 34, no. 1, pp. 101–110, Jan 1988,

‘Conflict Multiplicity Estimation And Batch Resolution

Algorithms’.

[6] IEEE 802.11 standard, 1997, ‘Wireless LAN Medium

Access Control (MAC) And Physical Layer (PHY)

Specifications’.

[7] J. A. Paradiso and T. Starner, IEEE Perv. Comput.

Mag., vol. 4, no. 1, pp. 18–27, Jan.-Mar. 2005, ‘Energy

Scavenging For Mobile And Wireless Electronics’.

[8] L. Ren-Shiou, P. Sinha, and C. E. Koksal, Proc. 2010

IEEE INFOCOM. R. Bellman, Dynamic Programming.

Princeton University Press, Princeton, NJ. 1957,

Republished 2003, ‘Joint Energy Management and

Resource Allocation In Rechargeable Sensor Networks’.

[9] P. Gupta, and P. R. Kumar, IEEE Transactions on

Information Theory, vol. 34, no. 5, pp. 910-917, 2000,

‘The Capacity of Wireless Networks’.

[10] P. Jacquet, P. Minet, P. M¨uhlethaler, and N.

Rivierre, January 1997, pp. 11–25, ‘Priority and collision detection with active signalling: The channel access mechanism of hiperlan’ in Wireless Personnel

Communication.

[11] Padmavathy.T, Gayathri, Indhumathi, Karthiga,

‘Energy Constrained Reliable Routing Optimized Cluster

Head Protocol For Multihop Under Water Acoustic Sensor

Networks’.

[12] Pedro H. J. Nardelli‡, Mariam Kaynia†, Matti Latvaaho

, ‘

Efficiency of the Aloha Protocol in Multi-Hop

Networks’.

[13] Shashidhar Rao Gandham , Milind Dawande_, Ravi

Prakash and S. Venkatesan, Department of Computer

Science School of Management University of Texas at

Dallas, Richardson, TX 75080, ‘Energy Efficient Schemes

For Wireless Sensor Networks With Multiple Mobile Base

Stations’.

Download