Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.

Slides:



Advertisements
Similar presentations
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY Presented By: Abbas Kazerouni EE 360 paper presentation, winter 2014, EE Department, Stanford.
Advertisements

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Mikhail Nesterenko Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari.
Protocols for Wireless Sensor Networks
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
An Application-Specific Protocol Architecture for Wireless Microsensor Networks Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan (MIT)
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.
Introduction to Wireless Sensor Networks
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
AES based secure LEACH for WSN’s. Obstacles of WSN Security Limited resources-Limited memory, code space and energy. Unreliable Communication-Densely.
Aeon LEACH An Efficient LEACH protocol in Heterogeneous and Homogenous Wireless Sensor Networks Under Guidance Of: Dr. Mohammad Mozumdar Presented By :
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.
Kai Li, Kien Hua Department of Computer Science University of Central Florida.
LEACH-SC Presented By M. Jaffar Khan
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures ProtocolRelevant Attacks TinyOS beaconingBogus routing information, selective forwarding,
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :
CuMPE : CLUSTER-MANAGEMENT AND POWER EFFICIENT PROTOCOL FOR WIRELESS SENSOR NETWORKS ITRE’05 Information Technology: Research and Education Shen Ben Ho.
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
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
Multimedia & Networking Lab
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
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.
ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Hybrid Indirect Transmissions (HIT) for Data Gathering in Wireless Micro Sensor Networks with Biomedical Applications Jack Culpepper(NASA), Lan Dung, Melody.
Authors: N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Ching-Ju Lin Institute of Networking and Multimedia NTU
MCEEC: MULTI-HOP CENTRALIZED ENERGY EFFICIENT CLUSTERING ROUTING PROTOCOL FOR WSNS N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi.
Group Members Usman Nazir FA08-BET-179 M.Usman Saeed FA08-BET-173
Data Dissemination Based on Ant Swarms for Wireless Sensor Networks S. Selvakennedy, S. Sinnappan, and Yi Shang IEEE 2006 CONSUMER COMMUNICATIONS and NETWORKING.
Simulation of DeReClus Yingyue Xu September 6, 2003.
Jinfang Jiang, Guangjie Han, Lei Shu, Han-Chieh Chao, Shojiro Nishio
Data funneling : routing with aggregation and compression for wireless sensor networks Petrovic, D.; Shah, R.C.; Ramchandran, K.; Rabaey, J. ; SNPA 2003.
“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.
A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
An Application-Specific Protocol Architecture for Wireless Microsensor Networks 컴퓨터 공학과 오영준.
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Protocols for Wireless Sensor Networks
Threshold sensitive Energy Efficient sensor Network (TEEN)
Wireless Sensor Networks 5. Routing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
Networks and Communication Systems Department
SEP routing protocol in WSN
Leach routing protocol in WSN
Leach routing protocol in WSN
Protocols.
Protocols.
Presentation transcript:

Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of Computer Science and Engineering University of Bridgeport, Bridgeport, Connecticut Fig. 1. Four main parts for a typical WSN. Introduction Wireless sensor Networks (WSN’s) as illustrated in fig. 1, are composed of a huge number of sensor nodes with limited energy resources. Designing an energy efficient protocol is a key issue that needs to be dealt with in order to expand the life span of the entire network. We propose to analyze the performance of LEACH (Low Energy Adaptive Clustering Hierarchy) as well the TEEN (Threshold sensitive Energy Efficient sensor Network) protocols. Further we discuss the security features of SEC-LEACH and we propose adopting the authentication mechanism of SEC-LEACH to the TEEN. We show improvement by running experimental testing with multiple rounds. The new proposed SEC-TEEN improves the network security in order to make it more robust to external threats. Sec-LEACH vs. TEEN When nodes communicate in a sensor network, LEACH balances the draining of energy during that communication. In a wireless sensor network, LEACH rotates CHs randomly among all sensors in the network in order to distribute the energy consumption among all the sensors. LEACH works in rounds. In each round, LEACH elects CHs using a distributed algorithm and then dynamically clusters the remaining sensors around the CHs. Consequently, Sensor-to-BS communication takes place using this clustering structure for the rest of the current round. Secure Low Energy Adaptive Clustering Hierarchy protocol (Sec-LEACH) is the same as LEACH protocol but with some modification to improve the level of security and to protect the network from many kinds of attacks such as sinkhole and selective forwarding attacks. Sec- LEACH randomly assigns each sensor with a ring of keys taken from key pool pseudo that have been generated at the time when the network is deployed. In TEEN routing protocol, nodes are arranged in hierarchical clustering scheme in which some nodes act as 1 st level and 2 nd level cluster heads. After forming the cluster head, it gets the attribute from the user. Once the attribute is received the cluster head broadcasts the attribute. These are hard and soft thresholds for sensed attributes (values) to its cluster members. Hard threshold is the minimum possible value of an attribute to trigger a sensor node to switch on its transmitter and transmit to the cluster head. The sensor nodes start sensing and transmitting the sensed data when it exceeds hard threshold. Nodes transmit only when the sensed attribute is in the range of their target. By doing that we are reducing the number of transmissions significantly. Converting TEEN into Sec- TEEN In our proposal, we used the security techniques given by Sec-LEACH to design our secure TEEN protocol. In other words, we propose to generate a large pool of S keys and their ids prior to network deployment. Each node is then assigned a ring of m keys drawn from the pool pseudo-randomly, without replacement. The new TEEN algorithm can then be run with the modifications described below. When a self- elected CH broadcasts its adv message, it includes the ids of the keys in its key ring. The remaining nodes now cluster around the closest CH with whom they share a key. During the self- election, CH broadcasts its id and a nonce. Then each ordinary node in the network computes the set of key ids, chooses the closest CH with whom it shares a key, and sends a CH a join-req message, protected by a MAC. The MAC is generated, and includes the nonce from CH’s broadcast to prevent replay attacks, as well as the id r of the key chosen to protect this link (so that the receiving CH knows which key to use to verify the MAC). At the end of the setup phase, the CHs send the time slot schedule to the nodes that chose to join their clusters. In the steady- state phase, the CH broadcasts to its members along with its adv message the values of hard threshold and soft threshold. Simulation Model In terms of Data Overload, Sec-TEEN works with extra conditions for sending data at each node, such condition reduces the total transactions required in the network communications. This leads to highly reduced data overload compared with Sec-LEACH. This trend can be exhibited by analyzing the following graph; Fig. 2. Total data overhead in Sec-LEACH and Sec- TEEN after 500 rounds for network size (100 nodes). Our experiment shows that for the network of size 100 nodes, both Sec-LEACH and Sec-TEEN have different volume of data being transmitted between nodes to cluster heads and vice versa. Referring to Fig. 2, we find that both of the Sec- LEACH and Sec-TEEN produce different total data overhead in the specified network. From this point, when it comes to our Sec-TEEN protocol, it remarkably involves fewer amounts of data sent between nodes in the system. It is noticed from Figure 2 that after a period of time both protocols will start having a steady phase in terms of data overhead and that obviously is due to the energy being completely consumed by all of the nodes. The highest data volume sent by the Sec-TEEN was 1.76 x 10 7 bits where it was 3.1 x 10 7 bits in the case of Sec-LEACH. Referring to Fig. 3 below and after applying both algorithms on the network, we were able to achieve better results in terms of energy saving. When comparing the two protocols, we found that the Sec- TEEN performs much better than Sec-LEACH. Sec- TEEN has significant lower values of the energy consumed by the nodes than what is consumed by the Sec-LEACH. However, the two protocols have a remarkably considerable variation in such values in the case of energy saving. Fig. 3. Total energy consumption occur in Sec-LEACH and Sec-TEEN after 500 rounds, for network size (100). Our experiment shows that the variation of energy consumption is very significant for the simulation network of 100 sensors. With a 0.5 Joule energy initially given to each node in both protocols, we can tell that nodes in the Sec-TEEN tend to consume their energy at a slower rate if compared to the Sec- LEACH nodes. Consequently, as can be seen from the Fig. 3, a WSN of 100 nodes using Sec-TEEN have consumed all of their energy at time 246. However, the nodes have consumed the energy at time 224 for the Sec- LEACH. This improvement comes from the nature of how Sec-TEEN works. Using the hard as well as soft threshold values improved the performance of Sec- TEEN. Data are not sent when the sensed data do not belong to the range of desired values which saves the energy needed transmission. According to the energy saving analysis, we can easily figure out that the number of alive nodes at any point in Sec-TEEN will be much higher than Sec-LEACH. This can be depicted in Fig. 4, below; keeping in mind, the number of alive nodes depends on the energy consumption by the network. Fig. 4. Alive nodes in Sec-LEACH and Sec-TEEN after 500 rounds, for network size of 100 sensors. We have proved using a simulation for WSN that Sec- TEEN has improved the network in terms of energy consumption when compared to Sec-LEACH. This was achieved by reducing the data overhead and reducing the transmission of packets by having soft & hard thresholds. Conclusion