אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

I will start with a quick background on wireless sensor networks (WSNs), and some of the security challenges created by their unique features. Random key pre-distribution schemes address some of the difficulties by randomly assigning secure keys to sensor nodes prior to network deployment.

The discussion will focus on two very different schemes, namely the scheme of Eschenauer and Gligor, and the random pairwise scheme of Chan et al. Each of these schemes induces a non-standard graph model which differs from the classical binomial random graphs of Erdos and Renyi. In each case the quest for "secure connectivity" (under so-called full visibility) will be explored through zero-one laws for graph connectivity in the corresponding random graph model. Comparison with similar results for Erdos-Renyi graphs will be made. If time permits we will also discuss the partial visibility case.

This is joint work with former student Osman Yagan (now at CMU).

Bio:
Armand M. Makowski received the Licence en Sciences Mathematiques from the Universite Libre de Bruxelles in 1975, the M.S. degree in Engineering-Systems Science from U.C.L.A. in 1976 and the Ph.D. degree in Applied Mathematics from the University of Kentucky in 1981. In August 1981, he joined the faculty of the Electrical Engineering Department at the University of Maryland at College Park, where he is presently a Professor of Electrical and Computer Engineering. His research interests broadly lie in applying advanced methods from the theory of stochastic processes to the modeling, design and performance evaluation of a variety of engineering systems, with particular emphasis on communication systems and networks. He is an IEEE Fellow. Light refreshments will be served.