Skip to main content

Seminar:  Designing Secure and Reliable Wireless Sensor Networks

Date:February 24, 2014 
Talk Title:Designing Secure and Reliable Wireless Sensor Networks
Speaker:Osman Yagan
Time & Location:12:00pm - 1:00pm
CIC Building, Pittsburgh

Abstract

Wireless sensor networks (WSNs) are distributed collection of small sensor nodes that gather security-sensitive data and control security-critical operations in a wide range of industrial, home and business applications. The current developments in the sensor technology and ever increasing applications of WSNs point to a future where the reliability of these networks will be at the core of the society’s well-being, and any disruption in their services will be more costly than ever. There is thus a fundamental question as to how one can design wireless sensor networks that are both secure and reliable.

In this talk, we will present our approach that addresses this problem by considering WSNs that employ a randomized key predistribution scheme and deriving conditions to ensure the k-connectivity of the resulting network. Random key predistribution schemes are widely accepted solutions for securing WSN communications and the k-connectivity property ensures that the network is reliable in the sense that its connectivity will be preserved despite the failure of any k − 1 sensors or links.

Throughout, we will consider two classical key predistribution schemes, namely the Eschenauer-Gligor scheme and the pairwise scheme of Chan, Perrig, and Song. Our approach is based on the analysis of random graph models naturally induced under these schemes, and developing conditions on the network parameters (e.g., number of nodes, density of nodes in the deployed area, link failure probability, number of keys per node, key pool size), which will ensure that the resulting networks are k-connected with very high probability. The main focus of the talk will be on the latest results concerning the k-connectivity of secure WSNs under an ON-OFF communication channel model. Possible extensions to the disk communication model will also be discussed.

Speaker Bio

Osman Yağan is an Assistant Research Professor of Electrical and Computer Engineering (ECE) at Carnegie Mellon University (CMU) with an appointment in the Silicon Valley Campus. Prior to joining the faculty of the ECE department in August 2013, he was a Postdoctoral Research Fellow in CyLab at CMU. He has also held a visiting Postdoctoral Scholar position at Arizona State University during Fall 2011. Dr. Yağan received his Ph.D. degree in Electrical and Computer Engineering from the University of Maryland at College Park, MD in 2011, and his B.S. degree in Electrical and Electronics Engineering from the Middle East Technical University, Ankara (Turkey) in 2007.

Dr. Yağan's research interests are in modeling, design, and performance evaluation of engineering systems with particular emphasis on communication systems and networks. Specific research topics include wireless communications, security, random graphs, social and information networks, and cyber-physical systems.

Dr. Yağan has served as a Technical Program Committee member of several international conferences including SECRYPT 2012, IEEE GLOBECOM 2013-2014-2015, IEEE GlobalSIP 2013, and IEEE PIMRC 2014.