From ayanoglu at uci.edu Mon Nov 2 17:09:24 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Mon, 2 Nov 2009 17:09:24 -0800 (PST) Subject: [CPCC] SEMINAR: ICs for Multi-Antenna Radios 11/9 Monday 10 AM Message-ID: CPCC SEMINAR Integrated Circuits for Multi-Antenna Radios: Prospects and Challenges by Fred Tzeng November 9, 2009, Monday 10 AM 2430 Engineering Hall (Colloquium Room) ABSTRACT Multi-antenna wireless communications has gained considerable momentum recently due its capability to enhance system performance. A major impediment associated with conventional multi-antenna radios is the need to replicate multiple transmit/receive chains, one for each antenna. This results in substantial increases in power and chip area, both of which are critical commodities in integrated circuit design. This talk discusses the challenges of designing integrated circuits for multi-antenna communications, and also discusses on-going research in this area. SPEAKER'S BIOGRAPHY Fred Tzeng received the B.S. and M.S. degrees in electrical engineering in 2005 and 2008, respectively, from the University of California, Irvine, where he is currently pursuing the Ph.D. degree in electrical engineering. Since 2004, he has been with the Nanoscale Communication IC Lab at the University of California, Irvine, as a graduate student researcher. He has also held summer internships at GE Global Research and Qualcomm. He has three pending patents and is the co-founder of ZeroWatt Technologies Mr. Tzeng is the recipient of various awards and fellowships. From ayanoglu at uci.edu Thu Nov 5 20:31:12 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Thu, 5 Nov 2009 20:31:12 -0800 (PST) Subject: [CPCC] TALK: Secure Neighbor Discovery in Mobile Networks 11/16 Monday 4 PM Message-ID: TALK Secure Neighbor Position Discovery in Mobile Networks by Dr. Claudio Casetti Dipartimento di Elettronica Politocnico di Torino November 16, 2009, Monday 4 PM 2430 Engineering Hall (Colloquium Room) ABSTRACT In mobile ad-hoc networks, knowledge of neighbor positions is a requirement in a number of important tasks. However, distributed techniques to perform secure neighbor position discovery, suitable for mobile ad-hoc environments, are missing. In this talk, we address this need by proposing a lightweight Secure Neighbor Position Discovery (SNPD) that relies only on information exchange among neighbors, without any need of a-priori trustworthy nodes. The challenges that an SNPD system must address are multi-faceted: (i) devices running an SNPD need to be able to track their own position and relate it to a common, reliable time reference; (ii) on-demand, real-time knowledge of neighbor positions and identities is needed; (iii) neighboring devices can be faulty or under the control or influence of an adversary, and must be properly detected. While we assume that the devices are compliant with the first requirement, we focus on designing an SNPD mechanism that addresses the latter two requirements and allows nodes to validate the positions of neighbors within their communication range in a distributed manner. We envision a system where nodes act individually but cooperate and leverage the contribution of neighbors to weed out wrong-doers. Our proposal results in a lightweight scheme that can be executed by any mobile node, at any point in time, without prior knowledge or assumed trustworthiness of the other nodes that participate. We present a detailed security analysis of our protocol in presence of one or multiple (independent or colluding) adversaries, and we show its performance in vehicular and pedestrian ad hoc network environments. SPEAKER'S BIOGRAPHY Claudio Casetti is an Assistant Professor within the Wireless Networks Group at the Dipartimento di Elettronica of Politecnico di Torino, Italy. His research interests are in the field of wireless communications, specifically ad-hoc networks and vehicular networks. He has published more that 110 papers in refereed journals and leading international conferences, and holds three patents. He has been involved in the chairing committe of several leading international conferences, including IEEE GLOBECOM, IEEE INFOCOM and IEEE/IFIP WONS. Currently he serves as an editor for the Journal of Computer Networks (JCN). He is a Member of IEEE. The Wireless Networks Group in the Dipartimento di Elettronica of Politecnico di Torino has a long-term experience in modeling, simulating, and implementing network protocols for wireless networks. Scientific publications from members of the group cover the fields of wireless LANs, ad hoc wireless networks, sensor networks, vehicular networks, and mesh networks. Host: Prof. Athina Markopoulou From ayanoglu at uci.edu Mon Nov 9 13:36:51 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Mon, 9 Nov 2009 13:36:51 -0800 (PST) Subject: [CPCC] SEMINAR: Low Power 10 GS/s 5 bit ADC 11/16 Monday 10 AM Message-ID: CPCC SEMINAR A Low Power 10 GS/s 5 bit ADC in 0.13um CMOS Technology by Darya Mohtashemi November 16, 2009, Monday 10 AM 2430 Engineering Hall (Colloquium Room) ABSTRACT In high-speed data communication systems with bit rates of 10Gb/s and higher, some form of channel equalization is required to ensure error free data transmission. Digital equalization has been shown to have favorable performance over more conventional analog techniques, therefore, high- speed ADCs are becoming fundamental components of high-speed communication systems. The bottleneck in such systems has been the design of the ADC with reasonable power dissipation. This talk focuses on the challenges of designing a low power 10GS/s flash ADC in 0.13um CMOS and the high-speed design techniques used in the development of this A/D converter. SPEAKER'S BIOGRAPHY Darya Mohtashemi received the B.S. degree in Electrical Engineering from K. N. Toosi University of Technology in Tehran, Iran in 2004 and the M.S. degree in Electrical Engineering from the University of California, Irvine in 2006. She is currently pursuing her PhD degree at the University of California, Irvine. Her research interests include the design of high- speed analog/mixed-signal integrated circuits for optical communications with a focus on high-speed ADC design. She has held two summer internships at ClariPhy Communications Inc. where she was an analog IC design engineer intern. Ms. Mohtashemi received the UC Irvine Henry Samueli Endowed Fellowship in 2006. She is a student member of IEEE. From ayanoglu at uci.edu Sun Nov 15 17:37:47 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Sun, 15 Nov 2009 17:37:47 -0800 (PST) Subject: [CPCC] REMINDER: TALK: Secure Neighbor Discovery in Mobile Networks 11/16 Monday 4 PM Message-ID: [If interested in meeting with the speaker, please send email to the host athina at uci.edu.] TALK Secure Neighbor Position Discovery in Mobile Networks by Dr. Claudio Casetti Dipartimento di Elettronica Politocnico di Torino November 16, 2009, Monday 4 PM 2430 Engineering Hall (Colloquium Room) ABSTRACT In mobile ad-hoc networks, knowledge of neighbor positions is a requirement in a number of important tasks. However, distributed techniques to perform secure neighbor position discovery, suitable for mobile ad-hoc environments, are missing. In this talk, we address this need by proposing a lightweight Secure Neighbor Position Discovery (SNPD) that relies only on information exchange among neighbors, without any need of a-priori trustworthy nodes. The challenges that an SNPD system must address are multi-faceted: (i) devices running an SNPD need to be able to track their own position and relate it to a common, reliable time reference; (ii) on-demand, real-time knowledge of neighbor positions and identities is needed; (iii) neighboring devices can be faulty or under the control or influence of an adversary, and must be properly detected. While we assume that the devices are compliant with the first requirement, we focus on designing an SNPD mechanism that addresses the latter two requirements and allows nodes to validate the positions of neighbors within their communication range in a distributed manner. We envision a system where nodes act individually but cooperate and leverage the contribution of neighbors to weed out wrong-doers. Our proposal results in a lightweight scheme that can be executed by any mobile node, at any point in time, without prior knowledge or assumed trustworthiness of the other nodes that participate. We present a detailed security analysis of our protocol in presence of one or multiple (independent or colluding) adversaries, and we show its performance in vehicular and pedestrian ad hoc network environments. SPEAKER'S BIOGRAPHY Claudio Casetti is an Assistant Professor within the Wireless Networks Group at the Dipartimento di Elettronica of Politecnico di Torino, Italy. His research interests are in the field of wireless communications, specifically ad-hoc networks and vehicular networks. He has published more that 110 papers in refereed journals and leading international conferences, and holds three patents. He has been involved in the chairing committe of several leading international conferences, including IEEE GLOBECOM, IEEE INFOCOM and IEEE/IFIP WONS. Currently he serves as an editor for the Journal of Computer Networks (JCN). He is a Member of IEEE. The Wireless Networks Group in the Dipartimento di Elettronica of Politecnico di Torino has a long-term experience in modeling, simulating, and implementing network protocols for wireless networks. Scientific publications from members of the group cover the fields of wireless LANs, ad hoc wireless networks, sensor networks, vehicular networks, and mesh networks. Host: Prof. Athina Markopoulou From ayanoglu at uci.edu Sun Nov 15 19:57:20 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Sun, 15 Nov 2009 19:57:20 -0800 (PST) Subject: [CPCC] REMINDER: SEMINAR: Low Power 10 GS/s 5 bit ADC 11/16 Monday 10 AM Message-ID: CPCC SEMINAR A Low Power 10 GS/s 5 bit ADC in 0.13um CMOS Technology by Darya Mohtashemi November 16, 2009, Monday 10 AM 2430 Engineering Hall (Colloquium Room) ABSTRACT In high-speed data communication systems with bit rates of 10Gb/s and higher, some form of channel equalization is required to ensure error free data transmission. Digital equalization has been shown to have favorable performance over more conventional analog techniques, therefore, high- speed ADCs are becoming fundamental components of high-speed communication systems. The bottleneck in such systems has been the design of the ADC with reasonable power dissipation. This talk focuses on the challenges of designing a low power 10GS/s flash ADC in 0.13um CMOS and the high-speed design techniques used in the development of this A/D converter. SPEAKER'S BIOGRAPHY Darya Mohtashemi received the B.S. degree in Electrical Engineering from K. N. Toosi University of Technology in Tehran, Iran in 2004 and the M.S. degree in Electrical Engineering from the University of California, Irvine in 2006. She is currently pursuing her PhD degree at the University of California, Irvine. Her research interests include the design of high- speed analog/mixed-signal integrated circuits for optical communications with a focus on high-speed ADC design. She has held two summer internships at ClariPhy Communications Inc. where she was an analog IC design engineer intern. Ms. Mohtashemi received the UC Irvine Henry Samueli Endowed Fellowship in 2006. She is a student member of IEEE. From ayanoglu at uci.edu Tue Nov 17 11:43:29 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Tue, 17 Nov 2009 11:43:29 -0800 (PST) Subject: [CPCC] SEMINAR: Computational Complexity of Decoding OSTBCs 11/23 10 AM Message-ID: CPCC SEMINAR Computational Complexity of Decoding Orthogonal Space-Time Block Codes by Ender Ayanoglu November 23, 2009, Monday 10 AM 2430 Engineering Hall (Colloquium Room) ABSTRACT Orthogonal Space-Time Block Codes (OSTBCs) have been around for more than a decade. It is well-known that the orthogonality properties of OSTBCs lead to their decoding on a symbol-by-symbol decoupled basis. In the original OSTBC papers, a metric which provides this decoupling is introduced. Furthermore, basic Maximum Likelihood techniques have been employed by several authors to come up with a number of other decoding metrics. In this talk, we will quantify the computational complexity of decoding OSTBCs. We will unify the approaches from the literature and will show four equivalent metrics which have the same computational complexity. We will compare these metrics with the one in the original OSTBC papers and show that, with a slight change, they become equivalent. Finally we will provide a version of the optimal metric where the division operation is avoided and the computational complexity is minimum. We will also discuss the computational complexity of a number of OSTBC examples and calculate their computational complexity. We will explain when the computational complexity is substantially reduced. SPEAKER'S BIOGRAPHY Ender Ayanoglu the Ph.D. degree from Stanford University, Stanford, CA in 1986, in electrical engineering. He was with the Communications Systems Research Laboratory of AT&T Bell Laboratories (Bell Labs, Lucent Technologies after 1996) until 1999 and was with Cisco Systems until 2002. Since 2002, he has been a Professor in the Department of Electrical Engineering and Computer Science, the Henry Samueli School of Engineering, University of California, Irvine where he is currently the Director of the Center for Pervasive Communications and Computing and holds the Conexant-Broadcom Endowed Chair. Dr. Ayanoglu is the recipient of the IEEE Communications Society Stephen O. Rice Prize Paper Award in 1995 and the IEEE Communications Society Best Tutorial Paper Award in 1997. From 1993 until now, he has been an Editor of the IEEE Transactions on Communications and from 2004 to 2008 served as its Editor-in-Chief. He served on the Executive Committee of the IEEE Communications Society Communication Theory Committee from 1990 until 2002, and from 1999 to 2002, was its Chair. From ayanoglu at uci.edu Wed Nov 18 14:09:16 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Wed, 18 Nov 2009 14:09:16 -0800 (PST) Subject: [CPCC] NETSYS SEMINAR: Trust and Reputation in Networks 11/20 11 AM Message-ID: NETWORKED SYSTEMS PROGRAM SEMINAR Opportunistic Routing in Wireless Networks with Congestion Diversity by Prof. John Baras, Lockheed Martin Chair in Systems Engineering Department of Electrical and Computer Engineering University of Maryland, College Park November 20, 2009, Friday 11 AM Donald Bren Hall 6011 ABSTRACT Trust and reputation are critical concepts in networks, communication, control, computer, social, web-based social, economic, biological. Trust evaluation leads to the development of relations and collaborations. These evaluations are based either on direct communal monitoring and inference by the nodes, or on indirect references and credentials. We describe new fundamental ways for analyzing and evaluating trust in autonomic networked systems. The indirect evaluation process is modeled as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. We develop a novel formulation of trust computation as linear iterations on partially ordered semirings. The direct trust evaluation process is modeled as iterated games on dynamic graphs. We present several explicit examples. We present the methodology of constrained coalitional dynamic games that we have developed for studying the effects of trust on collaboration. We provide several examples with quantitative evaluation of trust on distributed inference and control systems using a combination of these new algebraic and analytical methods. SPEAKER'S BIOGRAPHY John S. Baras, Lockheed Martin Chair in Systems Engineering B.S. in Electrical Eng. from the Nat. Techn. Univ. of Athens, Greece, 1970; M.S. and Ph.D. in Applied Math. from Harvard Univ. 1971, 1973. Since 1973 with the Electrical and Computer Engineering Department, and the Applied Mathematics Faculty, at the University of Maryland College Park. Since 2000 faculty member in the Fischell Department of Bioengineering. Founding Director of the Institute for Systems Research (ISR) from 1985 to 1991. Since 1991, has been the Director of the Maryland Center for Hybrid Networks (HYNET). Fellow of the IEEE and a Foreign Member of the Royal Swedish Academy of Engineering Sciences. Received the 1980 George Axelby Prize from the IEEE Control Systems Society and the 2006 Leonard Abraham Prize from the IEEE Communications Society. Professor Baras' research interests include control, communication and computing systems. From ayanoglu at uci.edu Sun Nov 22 17:59:31 2009 From: ayanoglu at uci.edu (Ender Ayanoglu) Date: Sun, 22 Nov 2009 17:59:31 -0800 (PST) Subject: [CPCC] REMINDER: SEMINAR: Computational Complexity of Decoding OSTBCs 11/23 10 AM Message-ID: CPCC SEMINAR Computational Complexity of Decoding Orthogonal Space-Time Block Codes by Ender Ayanoglu November 23, 2009, Monday 10 AM 2430 Engineering Hall (Colloquium Room) ABSTRACT Orthogonal Space-Time Block Codes (OSTBCs) have been around for more than a decade. It is well-known that the orthogonality properties of OSTBCs lead to their decoding on a symbol-by-symbol decoupled basis. In the original OSTBC papers, a metric which provides this decoupling is introduced. Furthermore, basic Maximum Likelihood techniques have been employed by several authors to come up with a number of other decoding metrics. In this talk, we will quantify the computational complexity of decoding OSTBCs. We will unify the approaches from the literature and will show four equivalent metrics which have the same computational complexity. We will compare these metrics with the one in the original OSTBC papers and show that, with a slight change, they become equivalent. Finally we will provide a version of the optimal metric where the division operation is avoided and the computational complexity is minimum. We will also discuss the computational complexity of a number of OSTBC examples and calculate their computational complexity. We will explain when the computational complexity is substantially reduced. SPEAKER'S BIOGRAPHY Ender Ayanoglu received the Ph.D. degree from Stanford University, Stanford, CA in 1986 in electrical engineering. He was with the Communications Systems Research Laboratory of AT&T Bell Laboratories (Bell Labs, Lucent Technologies after 1996) until 1999 and was with Cisco Systems until 2002. Since 2002, he has been a Professor in the Department of Electrical Engineering and Computer Science, the Henry Samueli School of Engineering, University of California, Irvine where he is currently the Director of the Center for Pervasive Communications and Computing and holds the Conexant-Broadcom Endowed Chair. Dr. Ayanoglu is the recipient of the IEEE Communications Society Stephen O. Rice Prize Paper Award in 1995 and the IEEE Communications Society Best Tutorial Paper Award in 1997. From 1993 until now, he has been an Editor of the IEEE Transactions on Communications and from 2004 to 2008 served as its Editor-in-Chief. He served on the Executive Committee of the IEEE Communications Society Communication Theory Committee from 1990 until 2002, and from 1999 to 2002, was its Chair. He is one of the inventors of the 56K modem, which comes assembled in every laptop computer with hundreds of million implementations in the world.