Distinguished Guest Lecturer
Some Routing Challenges in Dynamic Networks
Dept. of Computer & Information Science
260 Dreese Labs
All interested parties are invited.
Refreshments will be served prior to the seminar.
As the Internet utilizes more wireless technology, we witness more and more mobile and opportunistic network applications. Protocol design for such a network has become more challenging. This discussion starts with a quick overview of the challenges and solutions for routing in dynamic networks, including protocol design, having knowledge of certain information, and mobility models. We then focus on two algorithmic graph models, based on two contact models, that capture both time and space: discrete contact and probabilistic contact models. We show how the traditional Dijkstra’s shortest path and Bellman-Ford algorithms can be extended to solve two specific routing problems under these two contact graph models. This talk ends with a discussion about some future challenges of network design with a focus on the integration of other related fields.
Dr. Jie Wu is the Chair of the Department of Computer and Information Sciences at Temple University, where he is also a professor. Prior to joining Temple University, he was a program director at the National Science Foundation. His research interests include wireless networks and mobile computing, routing protocols, fault-tolerant computing, and interconnection networks. He serves on the editorial board of IEEE Transactions on Computers and the Journal of Parallel and Distributed Computing. Dr. Wu is the program co-chair for IEEE INFOCOM 2011. He was also the general co-chair for IEEE MASS 2006, IEEE IPDPS 2008, and IEEE/ACM DCOSS 2009. Dr. Wu was an IEEE distinguished visitor. Currently, he is the chair of the IEEE Technical Committee on Distributed Processing (TCDP) and an ACM distinguished speaker. Dr. Wu is a Fellow of the IEEE.
Host: Ness Shroff