Network Security Lab (NSL)
|Course Number and Title||Quarter Offered|
|EE 565 - Computer Networks I||Winter 2007|
|EE 418 - Network Security and Cryptography||Autumn 2006|
|EE 565 - Computer Networks I||Winter 2006|
|EE 418 - Network Security and Cryptography||Autumn 2005|
|EE 595 - Wireless Sensor Networks||Spring 2005|
|EE 565 - Computer Networks I||Winter 2005|
|EE 566 - Computer Networks II||Spring 2004|
|EE 565 - Computer Networks I||Winter 2004|
|EE 418 - Network Security and Cryptography||Fall 2003|
|EE 595 - Information Theory||Spring 2003|
|EE 565 - Computer Networks I||Winter 2003|
|EE 341 - Introduction of Digital Signal Processing||Autumn 2002|
|EE 566 - Computer Networks II||Spring 2002|
|EE 565 - Computer Networks I||Winter 2002|
|EE 566 - Computer Networks II||Spring 2001|
|EE 595 - Security in wireless communications||Spring 2001|
|EE 565 - Computer Networks I||Winter 2001|
EE 565: Computer Communication Networks I
Course Description: Introduction to computer networks, layered model, and network protocols. Error Detection, framing, reliable transmission protocols. TCP. Routing Algorithms. Queuing theory including queuing models and networks and network capacity assignment.
EE 566: Computer Communication Networks II
Course Description: Local area, metropolitan area, satellite, and packet radio networks; routing algorithms for wide area networks; optimal design of packet-switched networks; congestion and flow control; fast packet switching; gigabit networks.
EE 595: Security in Wireless Communications
Course Description: Literature review on wireless network security algorithms, different cryptographic schemes for group communication and proposed secure wireless communication schemes.
EE 595: Information Theory
Course Description: This course will serve as the first among the sequence of two courses in the area of Information Theory.
The first part of the first course will introduce the ideal of uncertainty, which is a useful measure in studying the data compression and deriving the results related to compression. Compressing data naturally leads to the need for coding strategies that can represent the data in the most efficient way. This problem is studied in the context of optimal coding and the notion of optimality is introduced. The folk wisdom of twenty questions is brought back in this context and related to the Shannon-Fano-Elias coding. We will also deal with the correlated sources in which case the Slepian-Wolf Lemma provides the main result for compression.
The second part of the first course will deal with the results that relate to the communication channel and the rate of transmission in a given noisy channels. In particular, we shall derive the result dealing with the capacity of the channel followed by the rate distortion theory followed by the network information theory. Gaussian channel will be of special interest to us. Course wraps up with the joint source-channel results.
EE 595: Wireless Sensor Networks
Course Description: In this graduate level course is intended for students planning to pursue research in the emerging area of information processing in sensor networks. The course covers various topics of interest in sensor networks. The students review the extensive literature to understand the fundamental issues in designing and analyzing sensor networks. In order to gain in depth knowledge in a specific topic of interest, the students investigate the topic in a course project.
EE 418 - Network Security and Cryptography
Course Description: Fundamental principles of cryptography and its application to network and communication security. An introduction to the fundamental tools in cryptography and the protocols that enable its application to network and communication security.
EE 341 - Discrete Time Linear Systems
Course Description: Undergraduate course covering discrete time signals and systems, impulse response, convolution. Z-transforms, discrete-time Fourier analysis. Computer laboratory.