Rajeev Shorey

Vehicular networks have been the subject of much attention lately. A Vehicular Ad-Hoc Network, or VANET, is a form of mobile ad-hoc network, which provides communications among nearby vehicles and between vehicles and nearby fixed equipment, usually described as roadside equipment. Enabled by short-range to medium-range communication systems (vehicle-to-vehicle or vehicle-to-roadside), the vision of vehicular networks includes real-time and safety applications, sharing the wireless channel with mobile applications from a large, decentralized array of service providers. Vehicular safety applications include collision and other safety warnings. Non-safety applications include real-time traffic congestion and routing information, high-speed tolling, mobile infotainment, and many others.

Several factors have contributed to the surging interest in vehicular networks. In December 2003, the U.S. FCC approved 75 MHz of spectrum for Dedicated Short Range Communications (DSRC), and the resulting DSRC system is expected to be the first wide-scale vehicular network in North America. The IEEE 1609 Family of Standards for Wireless Access in Vehicular Environments (WAVE) has come out with standards for vehicular communications at all the layers: the MAC (IEEE 1609.4), Networking (IEEE 1609.3), Security (IEEE 1609.2) and Application layer (IEEE 1609.1).

The goal of this tutorial is to discuss detailed developments in the area of vehicular networks - from standards, protocols, government efforts across the world to numerous technical challenges in the area.

For more details, follow this link.

Speaker Bio
Rajeev Shorey is currently the Vice-Chancellor of NIIT University in Nimrana, near Delhi. Till August 2009, he was the Lab Group Manager of the Vehicle Communications and Information Management Group of India Science Lab (ISL) at GM Research and Development, Bangalore. Prior to joining GM Research, Rajeev was a Research Staff Member at the IBM Research Laboratory, New Delhi from 1998 to October 2005.

Rajeev received his Ph.D in Electrical Communication Engineering from the Indian Institute of Science, Bangalore, India in 1996. Dr. Shorey's work has resulted in more than 50 publications in international journals and conferences and several US patents, all in the area of wireless and wired networks. He has 10 issued US patents and several pending patents to his credit.

Rajeev serves on the Editorial boards of IEEE Transactions on Mobile Computing and Wireless Networks Journal of Mobile Communication, Computation and Information. He has thrice been the guest editor of IEEE Journal on Selected Areas in Communications, including a special issue on "Vehicular Networks" that was published in October 2007. He is the editor of the book titled "Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions" published by John Wiley, US in March 2006. Rajeev is the General Chair of the Sixth ACM International Workshop on VehiculAr Inter-NETworking (VANET 2009), a workshop in conjunction with ACM MobiCom 2009. Rajeev has given numerous talks and seminars in industry and academia all over the world and given several Tutorials in International conferences.

For his contributions in the area of Communication Networks, Rajeev was elected Fellow of the Indian National Academy of Engineering in 2007. He is a Fellow of the Institution of Electronics and Telecommunication Engineers, India. He is a Senior Member of IEEE and a Member of ACM.

Amos Korman

Informative labeling schemes consist in labeling the nodes of graphs in such a way so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting merely the labels of the corresponding nodes (and no other source of information). Common types of queries include, for example: adjacency (are the two nodes adjacent?), distance (what is the distance between the two nodes?), routing (which of my neighbors is the closest to the other node?), connectivity (what is the vertex connectivity between the two nodes?). Typically, the main goal of such schemes is to minimize the label size, that is, the maximum number of bits stored in a label.

Informally, the goal of a labeling scheme is to encode global information using small distributed spaces, so that information concerning a few nodes can be inferred only by using the corresponding local data structures. This relation between global and local knowledge places the field of informative labeling schemes between the very well studied centralized environment and the less studied distributed environment. In the future, this field may help to build a bridge for a better understanding of the relations between these two important environments.

For more details, follow this link.

Speaker Bio
Amos Korman is currently working as a permanent researcher in CNRS & Paris 7. Amos received his Ph.D in computer science from the Weizmann Institute of Science, Rehovot, Israel in 2006 under Prof. David Peleg. His thesis on informative labeling schemes received the Dean's Prize for Ph.D. students.

Amos is regularly publishing papers in leading conferences for theory of computer science such as ICALP, SODA, PODC, DISC, SPAA etc. In addition to his scientific experience, Amos is also interested in north Indian classical music and plays tabla under the guidance of Pandit Nayan Ghosh.

Jiannong Cao

Pervasive computing aims at creating smart environments providing people with services that are convenient, seamless, intelligent, and invisible. The environments consists of seamlessly interconnected smart devices deployed to every corner of our life, sensing for people and their surrounding contexts and providing functionalities that are composed as services. Pervasive computing applications include smart spaces, assisted environments for individuals with special needs, Emergency services, social networking, intelligent logistics and information systems, and entertainment.

One big barrier to the wide spread development of pervasive computing applications lies in the increased complexity of the programming task. There is a big gap between high-level application requirements, and low-level complex system organization and operations. Middleware can help bridge the gap - supporting rapid development and deployment of applications by domain experts with minimal programming expertise. However, pervasive computing poses new challenges to middleware research. In this tutorial, I will describe the main functionalities of middleware, namely programming abstractions and interfaces, system services, and runtime support, present the design dimensions. discuss the key challenging issues, and describe the state of art of research in developing pervasive computing middleware, including the major research projects. I will also describe the open problems and point out future research directions.

For more details, follow this link.

Speaker Bio
Jiannong Cao received the BSc degree in Computer Science from Nanjing University, Nanjing, China, and the MSc and the Ph.D degrees in Computer Science from Washington State University, Pullman, WA, USA. He is currently a professor and associate head in the Department of Computing at Hong Kong Polytechnic University, Hung Hom, Hong Kong. He is also the director of the Internet and Mobile Computing Lab in the department. Before joining Hong Kong Polytechnic University, he was on the faculty of Computer Science at James Cook University and University of Adelaide in Australia, and City University of Hong Kong. His research interests include mobile and pervasive computing, computer networking, parallel and distributed computing, and fault tolerance. He has published over 250 technical papers in the above areas. His recent research has focused on wireless networks and mobile and pervasive computing systems, developing test-bed, protocols, middleware and applications. His research is supported by grants from HK RGC, HK ITC, HK PolyU, Huawei, and Nokia. Dr. Cao is a senior member of China Computer Federation, a senior member of the IEEE, IEEE Computer Society, and the IEEE Communication Society, and a member of ACM. He is the Coordinator in Asia of the Technical Committee on Distributed Computing (TPDC) of IEEE Computer Society. He is also a member of the IEEE Technical Committees on Distributed Processing, Parallel Processing, IEEE Fault Tolerant Computing, and Self-Organization and Complex Distributed Systems. Dr. Cao has served as an associate editor and a member of editorial boards of several international journals, including Pervasive and Mobile Computing Journal, Wireless Communications and Mobile Computing, Peer-to-Peer Networking and Applications, and Journal of Computer Science and Technology. He has also served as a chair and member of organizing / program committees for many international conferences, including IEEE Percom, MASS, ICDCS, IPDPS, ICPP, RTSS, SRDS, PRDC, ICC, Globecom, WCNC, UIC, and EUC.

C. Pandurangan

Research in Secure Distributed computing is contributing to the foundations of both Distributed Computing and Cryptology. This tutorial attempts to highlight the intricate and inherent relationship that exist between these areas and show how the challenges in both have lead to some exciting results in the recent past. We begin with a taxonomy for this area which allows one to categorize all the problems in this domain in a unified fashion and lead to more systematic study of this area. Then we discuss various protocols for secure message transmission that is perfect under various fault models such as passive, fail-stop, Byzantine and Hybrid).We move on to more fundamental problems in cryptology such as verifiable secret sharing(VSS), and Multi-party Computations( MPC) in the second part of the tutorial. besides discussing key design methodologies, we discuss few open problems as well that may act as a trigger for fruitful future research.

Contents:

1. A Taxonomy for message transmission protocols.
2. Perfect security and complexity measures
3. Possibility, feasibility and optimality of protocols.
4. Multi-party computations
5. Information checking, WSS, and VSS protocols.
6. Protocols for synchronous and asynchronous MPC and Byzantine agreement problems.
7. Conclusions and open problems.

For more details, follow this link.

Speaker Bio
Prof C.Pandu Rangan served at IIT, Madras for the past 27 years and he has extensively published on various aspects of cryptology in the past ten years. He is a Fellow of Indian national academy of Engg (FNAE) and serves as Vice president for CRSI (Cryptology Research Society of India). He is in the editorial boards of LNCS series published by Springer Verlag and in the editorial board of Int. Journal on Parallel and Distributed Computing.

Hillol Kargupta

This tutorial will present an overview of how data intensive networked transportation systems work and the emerging role of decision support systems in this domain. The subject matter of this tutorial will be based on the existing academic work in this area and the speaker’s experience in building a commercially successful system in this area. The tutorial will particularly focus on commercial vehicle telematic systems that operate in the mobile resource management vertical. These systems are distributed and comprised of complex network of mobile and static heterogeneous computing nodes. These environments are also often data rich with information generated by sensors like GPS devices, vehicle performance data bus (e.g. onboard diagnostic data---OBD-II/J1708), and RFID sensors tracking equipments, just to name a few. Decision support systems in such environments require paying close attention to the distributed nature of the data and computing sources. Since many of the nodes in such environments are usually connected over limited bandwidth wireless networks, conventional centralized data management and mining applications for decision support do not work well. This tutorial will explain how lessons from distributed systems and algorithms can be used to build commercial-grade distributed data mining systems for the next generation of transportation applications. The presentation will offer the algorithmic foundation and a case study using the MineFleet® vehicle performance data mining system developed by Agnik. The tutorial will also identify several new avenues for research and in-vehicle distributed applications that require advanced decision support.

For more details, follow this link.

Speaker Bio
Hillol Kargupta is a Professor in the Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County. He received the PhD degree in computer science from the University of Illinois at Urbana-Champaign in 1996. He is also a co-founder of Agnik LLC, a data analytics company for distributed, mobile, and embedded environments. His research interests include distributed and ubiquitous data mining, privacy issues in mining, data stream mining for resource-constrained devices, and peer-to-peer data mining. He is also interested in information, communication, and social interaction.

Dr. Kargupta won a US National Science Foundation CAREER award in 2001 for his research on ubiquitous and distributed data mining. He along with his coauthors received the best paper award at the 2003 IEEE International Conference on Data Mining for a paper on privacy-preserving data mining. He won the 2000 TRW Foundation Award and the 1997 Los Alamos Award for Outstanding Technical Achievement. His research has been funded by the US National Science Foundation, US Air Force, Department of Homeland Security, NASA, and various other organizations. He has published more than 80 peer-reviewed articles in journals, conferences, and books. He has co-edited two books: Advances in Distributed and Parallel Knowledge Discovery, AAAI/MIT Press, and Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT Press. He is an associate editor of the IEEE Transactions on Knowledge and Data Engineering, IEEE Transactions on Systems, Man, and Cybernetics, Part B and Statistical Analysis and Data Mining Journal. He was the program-co-chair of the 2005 SIAM Data Mining Conference, Program vice-chair of 2005 PKDD Conference, Program vice-chair of 2005 IEEE International Data Mining Conference, Program Vice Chair for 2005 Euro-PAR Conference, Associate General Chair of the 2003 ACM SIGKDD Conference, and chair of the 2002 NSF Next Generation Data Mining Workshop among others. He regularly serves in the organizing and program committee of many data mining conferences. More information about him can be found at http://www.cs.umbc.edu/~hillol.

Anwitaman Datta

This decade has witnessed vigorous research on peer-to-peer research - encompassing numerous areas including structured overlays, file sharing and content distribution networks and storage systems to name a few. Numerous books, tutorials and surveys on peer-to-peer systems exist, but none exclusively focus on storage systems, nor do they exhaustively explore the design space. This tutorial will summarize the fundamental design issues related to peer-to-peer storage systems, pertaining to the reliability aspect of system vis-a-vis availability and durability. Efficient data indexing and searching as well as security issues are also important aspects of storage systems, but will be out of the scope of this tutorial, but brief references will be provided.

Peer-to-peer (P2P) storage is a paradigm to leverage the combined storage capacity of a network of storage devices (peers) contributed typically by autonomous end-users as a common pool of storage space to store and share content, and is designed to provide persistence and availability of the stored content despite unreliability of the individual autonomous peers in a decentralized environment.

Crucial to peer-to-peer storage systems research are some of the following questions: What kind of redundancy is most efficient from various perspectives including storage overhead as well as access and maintenance costs and latency, and implementation complexity? What minimal redundancy is necessary to meet a desired level of resilience? Which maintenance strategy to apply to maintain the necessary redundancy? Which peers to store the redundant blocks in, based possibly on issues like reliability of individual peers, locality and load? The tutorial will provide a survey of related literature exploring these aspects of a peer-to-peer storage system design (the design-space is summarized in the figure below). In doing so, we will review a whole spectrum of literature, including analytical models and simulation based studies, as well as algorithmic and systems implementation issues and various applications such as archival and back-up, file systems, etc - and the specific requirements and flexibilities of such systems, which need to be understood and exploited for reliable, efficient and scalable systems designs.

For more details, follow this link.

Speaker Bio
Anwitaman Datta did his PhD at EPFL Lausanne before moving to NTU Singapore in 2006, where he is currently an Assistant Professor. He is interested in large-scale networked distributed information systems and social collaboration networks, self-organization and algorithmic issues of these systems and networks and their scalability, resilience, security and performance. He won the best paper award at ICDCS 2007 and is one of the recipients of HP Labs Innovation Research Program award 2008. He teaches a course on Advanced Topics in Distributed Systems in NTU, which covers most of the topics mentioned in the tutorial, and has published more than 30 papers including several on relevant topics for the tutorial, as well as other topics related to peer-to-peer as well as self-organizing systems, as well as some survey style book chapters relevant to subtopics of the tutorial, as listed below. He also serves as a program co-chair of P2P 2009.