Due to recent advances in wireless technologies such as 3G, Bluetooth, IrDA,WiFi, to name a few, a pragmatic evolution of the generic Mobile Ad Hoc Network (MANET) paradigm, referred to as opportunistic networking, has emerged. Opportunistic networks (OppNets) are a kind of challenged mobile ad hoc networks, where prolonged disconnections, unpredictable and unstable topologies, and partitions can frequently occurred. This results in a paradigm shift for the design of network services. OppNets are quite different from legacy ad hoc networks in that the network is disconnected as a rule rather than as an exception to deal with. In OppNets, nodes are typically controlled by rational entities such as people or organizations. In such an environment, routing is considered as an inherently cooperative activity, and is viewed as one of the main challenges of OppNets. In this setting, cooperation has been extensively investigated under the framework of peer-to-peer and ad-hoc networks, following three broad perspectives: (a) the effect that cooperation can have on the overall network performance, (b) methods for detecting non-cooperative behaviors, and (c) design of mechanisms to enforce cooperation. Of course, these challenges impair the need for identifying incentive protocols, and incentive-aware routing schemes that can be applicable to OppNets.

In this tutorial, we will present a general introduction to oppNets, followed by the current state-of-the-art research, projects, and challenges related to routing in OppNets. Topics to be discussed will include: (1) Introduction to OppNets and their Classes, (2) Classification of routing algorithms for OppNets, and (3) Cooperation enforcement schemes tailored to OppNets.

It should be emphasized that encryption, cooperation enforcement, and robustness against Denial Of Service (DoS) attacks to routing operations, are among challenged topics related to security in OppNets, for which only few results are available in the literature. We believe that graduate students and researchers working in the above-mentioned areas will benefit from the outcome of this tutorial.

Dr. Isaac Woungang is currently an Associate Professor in the Department of Computer Science at Ryerson University, in Toronto, Canada, and is also an Adjunct professor at CUSB, University of Manitoba, in Winnipeg, Canada. He received his Masters and Ph.D. degrees, all in Mathematics, from the Universit" de la M"diterran"e-Aix Marseille II, France, and the Universit" du Sud, Toulon et Var, France, in 1990 and 1994 respectively. In 1999, he received a Masters degree from the INRS-Materials and Telecommunications, University of Quebec, Montreal, Canada. From 1999 to 2002, he worked as a Software engineer in the Photonic Line System Division at Nortel Networks, Ottawa, Canada. From February 2009 to June 2009, he was a Visiting professor at College of Electrical Engineering and Computer Science, National Ilan University, Taiwan, China.

Dr. Woungang has several years of experience working in the academia and the private sectors in research, teaching, consulting, project management, architecture, software design and product engineering roles. He is the founding Director of the Distributed Applications and Broadband NEtworks Laboratory (DABNEL) R&D group. His current research interests include network security, coding theory, algorithm design and engineering for telecommunication networks, Computer communication networks, Mobile communication systems, and Coding theory. Dr. Woungang is the author/editor of over 50 scholarly research papers and books. He has also edited several books in the areas of wireless ad hoc networks, wireless sensor networks, wireless mesh networks, communication networks & distributed systems, and information and coding theory, published by reputed publishers such as Springer, Elsevier, and World Scientific.

Sponsored by IEEE Canada and the Sections of Central Canada
by the