SEP routing protocol in WSN

Slides:



Advertisements
Similar presentations
Hierarchical Trust Management for Wireless Sensor Networks and its Applications to Trust-Based Routing and Intrusion Detection Presented by: Vijay Kumar.
Advertisements

Presented by Rick Skowyra
Presentation: Energy Efficient Communication Protocol for Wireless Microsensor Networks Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan.
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
Sensor network Routing protocol A study on LEACH protocol and how to improve it.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
Improvement on LEACH Protocol of Wireless Sensor Network
Aeon LEACH An Efficient LEACH protocol in Heterogeneous and Homogenous Wireless Sensor Networks Under Guidance Of: Dr. Mohammad Mozumdar Presented By :
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
POWER EFFICIENCY ROUTING ALGORITHMS OF WIRELESS SENSOR NETWORKS
ABSTRACT impact of heterogeneity of nodes, in terms of their energy
By Areeba Rao with Dr. Nadeem Javaid COMSATS, Institute of Information Technology, Islamabad, Pakistan AM-DisCNT: Angular Multi-hop DIStance based Circular.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :
Vikramaditya. What is a Sensor Network?  Sensor networks mainly constitute of inexpensive sensors densely deployed for data collection from the field.
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
Multimedia & Networking Lab
Design of a distributed energy efficient clustering (DEEC) algorithm for heterogeneous wireless sensor networks.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Wireless Sensor Network Protocols Dr. Monir Hossen ECE, KUET Department of Electronics and Communication Engineering, KUET.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN) Mohammad Rajiullah & Shigeru Shimamoto.
SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Authors: N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi
MCEEC: MULTI-HOP CENTRALIZED ENERGY EFFICIENT CLUSTERING ROUTING PROTOCOL FOR WSNS N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi.
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Group Members Usman Nazir FA08-BET-179 M.Usman Saeed FA08-BET-173
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering Stanislava Soro Wendi B. Heinzelman University of Rochester IPDPS 2005.
“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
Ing-Ray Chen, Member, IEEE, Hamid Al-Hamadi Haili Dong Secure and Reliable Multisource Multipath Routing in Clustered Wireless Sensor Networks 1.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
In the name of God.
Threshold sensitive Energy Efficient sensor Network (TEEN)
Introduction to Wireless Sensor Networks
On the Lifetime of Wireless Sensor Networks
Distributed Algorithms for Mobile Sensor Networks
Wireless Sensor Network Protocols
Presented by: Rohit Rangera
Wireless Sensor Network Architectures
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
Net 435: Wireless sensor network (WSN)
Networks and Communication Systems Department
Distributed Clustering for Scalable, Long-Lived Sensor Networks
Leach routing protocol in WSN
Authors: Ing-Ray Chen; Yating Wang Present by: Kaiqun Fu
A Survey on Routing Protocols for Wireless Sensor Networks
Project Net 435.
Leach routing protocol in WSN
LEACH Protocol for Wireless Sensor Networks
Distributed Minimum-Cost Clustering for Underwater Sensor Networks
Edinburgh Napier University
Presentation transcript:

SEP routing protocol in WSN Lab 2 Networks and Communication Systems Department TA. Maram Almuhareb SEP routing protocol in WSN

Introduction A WSN is made up of multiple stations meant for detection, called sensor nodes. The most important aspect of WSN applications is its lifetime which is primarily constrained and limited by the amount of energy consumed by the sensors, which are driven by un-rechargeable batteries also hard to replace due to deployment In hostile environments.

Cont. Once the nodes begin to exhaust their energies (become dead), the tolerance of the network goes on decreasing, until such a time when it can no longer be operational. The period of time from the beginning of network operation till the first node dies may be referred to as the stability period

The Problem An endeavor to study a protocol that may increase this stability period of a WSN as one of the aims of increasing the efficiency and lifetime of the network to improve WSN’s commercial viability. We will study the effect of a protocol named Stable Election Protocol (SEP) and try to make some small, innovative changes to improve this stability period.

PERFORMANCE MEASURES We define here the measures we use to evaluate the performance of clustering protocols: Stability Period: is the time interval from the start of network operation until the death of the first sensor node Network lifetime: is the time interval from the start of operation (of the sensor network) until the death of the last alive node Total Energy Consumption by the nodes in each round

PERFORMANCE MEASURES Number of dead (total, advanced and normal) nodes per round: This instantaneous measure reflects the total number of nodes and that of each type that have not yet expended all of their energy. Number of cluster heads per round: This instantaneous measure reflects the number of nodes which would send directly to the sink information aggregated from their cluster members. Throughput: We measure the total rate of data sent over the network, the rate of data sent from cluster heads to the sink as well as the rate of data sent from the nodes to their cluster heads.

SEP SEP is a WSN protocol that assumes heterogeneity in a network, making it the basis to prolong the stability period in a hierarchically clustered. For Heterogeneous networks, it is assumed that each node has different energy

How SEP works Nodes are treated differently based on their initial energy levels. The nodes with lower energy are called normal nodes and assigned a weighted election probability Pnrm which is lower to Padv which is the weighted election probability assigned to the advanced nodes, i.e., the nodes with higher energy levels.

Cont. This ensures that higher energy nodes have higher probability of being elected CH, thus ensuring that the energy within the network is consumed in a balanced manner thus prolonging the stability period.

Stochastic Threshold Algorithm Cluster-heads can be chosen stochastically (randomly based) on this algorithm: If n < T(n), then that node becomes a cluster-head The algorithm is designed so that each node becomes a cluster-head at least once  Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. In the approach, advanced nodes have higher probabilities to become a cluster head in a particular round than the normal nodes. 

Flow chart

PROPOSED PROTOCOL We have analyzed a heterogeneous sensor network environment. There two types of nodes : Advanced node : have higher energy source Normal nodes: less energy source Where m is the percentage of advance and normal nodes having a times more energy than the normal nodes that are distributed randomly over the sensor field.

SEP Simulation on Matlab The proposed approach has been implemented in MATLAB and the performance has been evaluated by simulation. In this work, we have measured the lifetime of the network in terms of rounds when the first sensor node dies. Simulation Area in meter xm=100; ym=100; Number of Nodes in the field 100 Base Station Location x and y Coordinates of the Sink (50,50) Initial Energy of sensor in Joul 0.5 Optimal Election Probability of a node to become cluster head 0.1 maximum number of rounds 1000 The following set of results represent the simulation of both LEACH at 0.1 probability that is the percentage of total nodes which can become cluster head is 20% of the total number of nodes. Table 1: Various parameters and their values

Simulation parameter

Simulation and Analysis of Results The parameters taken into consideration while evaluating SEP are as follows: Round Number vs Number of Dead Nodes (with variation of round number ) Round Number vs Average Energy of Each node (with variation of round number ) Round Number vs Throughput in Kbits (with variation of round number )

Simulation results Figure 1: 100 Node Figure 1 is showing the WSN in active mode with active as well as with some dead nodes represented by yellow triangle . As it is SEP so all nodes represented by circles are normal nodes and nodes with circle and and all nodes represented by plus (+) are advance nodes and with star(*) are cluster heads. the blue lines which are representing the different clusters and each has its CH Figure 1: 100 Node

Cont. Figure 2: 1700 Rounds Figure 3: 1800 Rounds

Cont. Figure 4: 1900 Rounds Figure 5: 2000 Rounds

Cont. Figure 6: 1700 Rounds Figure 4: 1800 Rounds

Cont. Figure 8: 1900 Rounds Figure 9: 2000 Rounds

Cont. Figure 10: number of dead normal nodes Figure 11: number of dead advance nodes

Cont. Figure 12: number of cluster heads Figure 13: Throughput in Kbits

Analyses of Results In figures 2 – 13 show SEP behavior in the presence of heterogeneity Our SEP protocol successfully extends the stable region by being aware of heterogeneity through assigning probabilities of cluster-head election weighted by the relative initial energy of nodes. Due to extended stability, the throughput of SEP is also higher than that of current (heterogeneous- oblivious) clustering protocols.

Analyses of Results Is also observed that the advanced nodes follow the death process of normal nodes, as the weighted probability of electing cluster heads causes the energy of each node to be consumed in proportion to the node’s initial energy Furthermore, as shown in Figure 13, the throughput from cluster heads to the sink. The throughput of SEP is significantly larger than that of LEACH in the stable region and for most of the unstable region. This means that because SEP guarantees cluster heads in more rounds then these cluster heads will report to the sink. SEP is more resilient than LEACH in judiciously consuming the extra energy of advanced nodes—SEP yields longer stability region for higher values of extra energy

Conclusion From the above graphs it is clearly visible that in the simulations, the SEP is much better than LEACH, with regard to all important performance parameters, such as Total Energy Consumption, Total Data received by BS, Number of dead Nodes at simulation end, and the main focus as well as Stability Period.

References G. Smaragdakis, I. Matta and A. Bestavros, “SEP: A Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks”, Proceedings of the 8th International Workshop SAPNA, pp. 1-11, 2004 SEP Code https://www.mathworks.com/matlabcentral/fileexc hange/44282-sep--a-stable-election-protocol--in- wireless-sensor-network