受我院魏曉輝教授邀請，美國Temple University吳傑教授将于7月15日到伟德国际BETVlCTOR訪問并為全院師生做學術報告。
吳傑教授是美國Temple University計算機與信息科學系主任，教授，IEEE 院士。吳傑教授是計算機科學與技術領域的國際知名學者，2011年獲得中國計算機學會海外傑出貢獻獎。在加入Temple University之前，吳教授曾擔任過Florida Atlantic University教授，美國NSF的項目主任，IEEE分布式處理技術工作委員會主席。主要研究領域包括無線網絡和移動計算、路由協議、雲計算、容錯計算以及互聯網絡。吳教授在各種期刊和雜志上發表了500餘篇文章，擔任過DCOSS 2009，IEEE IPDPS 2008，IEEE MASS 2006等多個國際會議聯合主席，INFOCOM 2011，ICDCS 2008程序委員會主席，以及IEEE Transactions on Computers，IEEE Transactions on Mobile Computing，Journal of Parallel and Distributed Computing等頂級國際期刊編委。
吳傑教授來訪正值我校暑假期間，希望各位老師和同學能夠合理安排時間，積極參加本次活動。
吳傑教授學術報告具體信息如下：
講座時間：2014年7月16日上午9:30-11:30
講座題目：Collaborative Mobile Charging and Coverage in Wireless Sensor Networks
主講人：Prof. Jie Wu, Department of Computer and Information Sciences, Temple University
講座摘要：
The limited battery capacity of sensor nodes has become the biggest impediment to wireless sensor network (WSN) applications over the years. Recent breakthroughs in wireless energy transfer, based on rechargeable lithium batteries, provide a promising application of mobile vehicles. These mobile vehicles act as mobile chargers to transfer energy wirelessly to static sensors in an efficient way. In this talk, we discuss some of our recent results on several charging and coverage problems involving multiple mobile chargers. In collaborative mobile charging, a fixed charging location, called a base station (BS), provides a source of energy to mobile chargers, which in turn are allowed to recharge each other while collaboratively charging static sensors. The objective is to ensure sensor coverage while maximizing the ratio of the amount of payload energy (used to charge sensors) to overhead energy (used to move mobile chargers from one location to another). This is done such that none of the sensors will run out of batteries. Here, sensor coverage spans both dimensions of time and space. We first consider the uniform case, where all sensors consume energy at the same rate, and propose an optimal scheduling scheme that can cover a one-dimensional (1-D) WSN with infinite length. Then, we present several greedy scheduling solutions to 1-D WSNs with non-uniform sensors and 2-D WSNs, both of which are NP-hard. Finally, we study another variation, in which all mobile chargers have batteries of unlimited capacity without resorting to a BS for recharging. The objective is then to deploy and schedule a minimum number of mobile chargers that can cover all sensors. Again, we provide an optimal solution to this problem in a 1-D WSN with uniform sensors and several greedy solutions with competitive approximation ratios to the problem setting of 1-D WSNs with non-uniform sensors and 2-D WSNs, respectively.
主講人簡介：
Jie Wu is chair and Laura H. Carnell professor in the Department of Computer and Information Sciences at Temple University. He is also an Intellectual Ventures endowed visiting chair professor at the National Laboratory for Information Science and Technology, Tsinghua University. Prior to joining Temple University, he was a program director at the National Science Foundation and was a distinguished professor at Florida Atlantic University. His current research interests include mobile computing and wireless networks, routing protocols, cloud and green computing, network trust and security, and social network applications. Dr. Wu regularly publishes in scholarly journals, conference proceedings, and books. He serves on several editorial boards, including IEEE Transactions on Service Computing and the Journal of Parallel and Distributed Computing. Dr. Wu was general co-chair/chair for IEEE MASS 2006, IEEE IPDPS 2008, and IEEE ICDCS 2013, as well as program co-chair for IEEE INFOCOM 2011 and CCF CNCC 2013. Currently, he is serving as general chair for ACM MobiHoc 2014. He was an IEEE Computer Society Distinguished Visitor, ACM Distinguished Speaker, and chair for the IEEE Technical Committee on Distributed Processing (TCDP). Dr. Wu is a CCF Distinguished Speaker and a Fellow of the IEEE. He is the recipient of the 2011 China Computer Federation (CCF) Overseas Outstanding Achievement Award.
