<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:dt="uuid:C2F41010-65B3-11d1-A29F-00AA00C14882" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta name=Generator content="Microsoft Word 12 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:12.0pt;
font-family:"Times New Roman","serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal-reply;
font-family:"Calibri","sans-serif";
color:#1F497D;}
.MsoChpDefault
{mso-style-type:export-only;}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.0in 1.0in 1.0in;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=EN-US link=blue vlink=purple><div class=WordSection1><div><p class=MsoNormal>Dear all,<o:p></o:p></p><p class=MsoNormal> <o:p></o:p></p><p class=MsoNormal>We will have Marathon style seminar this Friday by Professor Angela Zhang (Chinese University of Hong Kong), Professor Jianwei Huang (Chinese University of Hong Kong), Professor Guoqiang Mao (University of Sydney) and Professor Xingbin Wang (Shanghai Jiaotong University). Two of them are IEEE Marconi prize winner and one of them is the winner of IEEE best Asia Pacific young researcher under 35. If you or your students have interests, please find the following for more information.<o:p></o:p></p><p class=MsoNormal> <o:p></o:p></p><p class=MsoNormal>Many thanks for you support!<o:p></o:p></p><p class=MsoNormal> <o:p></o:p></p><p class=MsoNormal>Zhu Han<o:p></o:p></p><p class=MsoNormal> <o:p></o:p></p><p class=MsoNormal>------------------------------------------------------<br>10am<br>Title: Slow adaptive OFDMA systems<o:p></o:p></p><p class=MsoNormal>Adaptive OFDMA has recently been recognized as a promising technique<br>for providing high spectral efficiency in future broadband wireless<br>systems. The research over the last decade on adaptive OFDMA systems<br>has focused on adapting the allocation of radio resources, such as<br>subcarriers and power, to the instantaneous channel conditions of all<br>users. However, such “fast” adaptation requires high computational<br>complexity and excessive signaling overhead. This hinders the<br>deployment of adaptive OFDMA systems worldwide. In this talk, I will<br>introduce a slow adaptive OFDMA scheme, in which the subcarrier<br>allocation is updated on a much slower timescale than that of the<br>fluctuation of instantaneous channel conditions. Meanwhile, the data<br>rate requirements of individual users are accommodated on the fast<br>timescale with high probability, thereby meeting the requirements<br>except occasional outage. Such an objective has a natural chance<br>constrained programming formulation, which is known to be intractable.<br>To circumvent this difficulty, we formulate safe tractable constraints<br>for the problem based on recent advances in chance constrained<br>programming. We then develop a polynomial-time algorithm for computing<br>an optimal solution to the reformulated problem. Our results show that<br>the proposed slow adaptation scheme drastically reduces both<br>computational cost and control signaling overhead when compared with<br>the conventional fast adaptive OFDMA. Our work can be viewed as an<br>initial attempt to apply the chance constrained programming<br>methodology to wireless system designs. Given that most wireless<br>systems can tolerate an occasional dip in the quality of service, we<br>hope that the proposed methodology will find further applications in<br>wireless communications.<o:p></o:p></p><p class=MsoNormal>Bio:<o:p></o:p></p><p class=MsoNormal>Angela Yingjun Zhang received her PhD degree in Electrical and<br>Electronic Engineering from the Hong Kong University of Science and<br>Technology, Hong Kong in 2004. Since Jan. 2005, she has been with the<br>Department of Information Engineering in The Chinese University of<br>Hong Kong, where she is currently an Associate Professor.<br>Angela is on the Editorial Boards of IEEE Transactions on Wireless<br>Communications and Wiley Security and Communications Networks Journal.<br>She is a Guest Editor of a Feature Topic in IEEE Communications<br>Magazine. She has served as a Publication Chair of IEEE Technology<br>Time Machine Symposium on Technologies Beyond 2020, TPC Co-Chair of<br>Communication Theory Symposium of IEEE ICC 2009, Track Chair of ICCCN<br>2007, and Publicity Chair of IEEE MASS 2007. She has been serving as a<br>Technical Program Committee Member for leading conferences including<br>IEEE ICC, IEEE GLOBECOM, IEEE WCNC, IEEE ICCCAS, IWCMC, IEEE CCNC,<br>IEEE ITW, IEEE MASS, MSN, ChinaCom, etc. Angela is an IEEE Technical<br>Activity Board GOLD Representative, 2008 IEEE GOLD Technical<br>Conference Program Leader, IEEE Communication Society GOLD<br>Coordinator, and a Member of IEEE Communication Society Member<br>Relations Council (MRC).<br>Dr. Zhang is a co-recipient of 2011 IEEE Marconi Prize Paper Award on<br>Wireless Communications, the Annual Best Paper Award of IEEE<br>Transactions on Wireless Communications. As the only winner from<br>Engineering Science, Dr. Zhang has won the Hong Kong Young Scientist<br>Award 2006, conferred by the Hong Kong Institution of Science.<o:p></o:p></p><p class=MsoNormal>--------------------------------------<br>11am<br>Title: Economics of Cooperative Spectrum Sharing: Bargaining,<br>Contract, and Auction<o:p></o:p></p><p class=MsoNormal>Abstract: With the explosive development of wireless services and<br>networks, spectrum is becoming more congested and scarce. Cooperative<br>spectrum sharing allows primary (licensed) and secondary (unlicensed)<br>users to exchange communication resources in order to improve the<br>performance of both sides. The successful implementation of<br>cooperative spectrum sharing, however, requires many innovations in<br>technology, economics, and policy. This talk focuses on the economic<br>considerations of efficient sharing mechanism design, which encourages<br>primary users to open licensed spectrum for sharing and secondary<br>users to utilize the spectrum opportunities despite of the potential<br>costs. We will start by talking about the dynamic bargaining between<br>one primary user and one secondary user, then the contract-based<br>sharing between one primary user and a group of secondary users, and<br>finally the dynamic auction design for sharing among multiple primary<br>users and secondary users. The common design challenge in all models<br>is the performance optimization with incomplete information in a<br>dynamic network environment.<o:p></o:p></p><p class=MsoNormal>Bio:<br>Jianwei Huang (S'01-M'06-SM'11) is an Assistant Professor in the<br>Department of Information Engineering at the Chinese University of<br>Hong Kong. He received B.S. in Electrical Engineering from Southeast<br>University (Nanjing, Jiangsu, China) in 2000, M.S. and Ph.D. in<br>Electrical and Computer Engineering from Northwestern University<br>(Evanston, IL, USA) in 2003 and 2005, respectively. He worked as a<br>Postdoc Research Associate in the Department of Electrical Engineering<br>at Princeton University during 2005-2007. He was a visiting scholar in<br>the School of Computer and Communication Sciences at École<br>Polytechnique Fédérale De Lausanne (EPFL) during the Summer Research<br>Institute in June 2009, and a visiting scholar in the Department of<br>Electrical Engineering and Computer Sciences at University of<br>California-Berkeley in August 2010.<br>Dr. Huang currently leads the Network Communications and Economics Lab<br>(ncel.ie.cuhk.edu.hk), with main research focus on nonlinear<br>optimization and game theoretical analysis of communication networks,<br>especially on network economics, cognitive radio networks, and smart<br>grid. He is the recipient of the IEEE Marconi Prize Paper Award in<br>Wireless Communications in 2011, the International Conference on<br>Wireless Internet Best Paper Award 2011, the IEEE GLOBECOM Best Paper<br>Award in 2010, the IEEE ComSoc Asia-Pacific Outstanding Young<br>Researcher Award in 2009, Asia-Pacific Conference on Communications<br>Best Paper Award in 2009, and Walter P. Murphy Fellowship at<br>Northwestern University in 2001.<br>Dr. Huang has served as Editor of IEEE Journal on Selected Areas in<br>Communications - Cognitive Radio Series, Editor of IEEE Transactions<br>on Wireless Communications, Guest Editor of IEEE Journal on Selected<br>Areas in Communications special issue on "Economics of Communication<br>Networks and Systems", Lead Guest Editor of IEEE Journal of Selected<br>Areas in Communications special issue on "Game Theory in Communication<br>Systems", Lead Guest Editor of IEEE Communications Magazine Feature<br>Topic on "Communications Network Economics", and Guest Editor of<br>several other journals including (Wiley) Wireless Communications and<br>Mobile Computing, Journal of Advances in Multimedia, and Journal of<br>Communications.<br>Dr. Huang has served as Vice Chair of IEEE MMTC (Multimedia<br>Communications Technical Committee) (2010-2012), Director of IEEE MMTC<br>E-letter (2010), the TPC Co-Chair of IEEE WiOpt (International<br>Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless<br>Networks) 2012, the Publicity Co-Chair of IEEE Communications Theory<br>Workshop 2012, the TPC Co-Chair of IEEE ICCC Communication Theory and<br>Security Symposium 2012, the Student Activities Co-Chair of IEEE WiOpt<br>2011, the TPC Co-Chair of IEEE GlOBECOM Wireless Communications<br>Symposium 2010, the TPC Co-Chair of IWCMC (the International Wireless<br>Communications and Mobile Computing) Mobile Computing Symposium 2010,<br>and the TPC Co-Chair of GameNets (the International Conference on Game<br>Theory for Networks) 2009. He is also TPC member of leading<br>conferences such as INFOCOM, MobiHoc, ICC, GLBOECOM, DySPAN, WiOpt,<br>NetEcon, and WCNC. He is a senior member of the IEEE.<o:p></o:p></p><p class=MsoNormal><br>---------------------------------------<br>2pm<o:p></o:p></p><p class=MsoNormal>Title: Large-scale highly dynamic networks: Challenges and Opportunities<o:p></o:p></p><p class=MsoNormal>Abstract:<o:p></o:p></p><p class=MsoNormal>The last two decades have witnessed unprecedented growth in<br>telecommunications, particularly in the area of wireless<br>communications. This development in telecommunications opens doors to<br>many sophisticated complex systems, e.g. social networks, smart grids,<br>intelligent transport systems and sensor networks, that previously<br>were not feasible. Nowadays, we communicate using an increasingly<br>elaborate set of devices from phones, to tablet PCs and PDAs, to<br>computers. Further, an even greater number of devices (or “Internet of<br>things”) become “intelligent” due to the capability of being able to<br>communicate information with the outside world. Among the most<br>exciting, challenging and important communications problems today are<br>those involving large-scale highly dynamic wireless networks,<br>particularly vehicular networks and smart grids. This talk will<br>introduce our recent work in the area of large-scale highly dynamic<br>wireless networks. It includes wireless localization techniques,<br>robust network design and optimal network design for large dynamic<br>systems.<o:p></o:p></p><p class=MsoNormal>Biography:<o:p></o:p></p><p class=MsoNormal>Guoqiang Mao received the Bachelor degree in electrical engineering,<br>the Master degree in engineering and PhD in telecommunications<br>engineering in 1995, 1998 and 2002 from Hubei Polytechnic University,<br>South East University and Edith Cowan University respectively. He<br>joined the School of Electrical and Information Engineering, the<br>University of Sydney in December 2002 where he is a Senior Lecturer<br>now. He has published two books and over eighty papers in refereed<br>journals and conference proceedings, which have been cited more than<br>1000 times. He has served as a program committee member in a number of<br>international conferences and is an associate editor of IEEE<br>Transactions on Vehicular Networks. His research interests include<br>wireless localization techniques, wireless multihop networks, applied<br>graph theory and its application in networking, and network<br>performance analysis.<o:p></o:p></p><p class=MsoNormal>---------------------------------------<br>3pm<br>Title: Spatial and Temporal Relationship for Wireless Networks<o:p></o:p></p><p class=MsoNormal>Bio:<br>Xinbing Wang received the B.S. degree (with hons.) from the Department of<br>Automation, Shanghai Jiaotong University, Shanghai, China, in 1998,<br>and the M.S. degree from the Department of Computer Science and<br>Technology, Tsinghua University, Beijing, China, in 2001. He<br>received the Ph.D. degree, major in the Department of electrical and<br>Computer Engineering, minor in the Department of Mathematics, North<br>Carolina State University, Raleigh, in 2006. Currently, he is a<br>faculty member in the Department of Electronic Engineering, Shanghai<br>Jiaotong University, Shanghai, China. His research interests include<br>resource allocation and management in mobile and wireless networks,<br>TCP asymptotics analysis, wireless capacity, cross layer call<br>admission control, asymptotics analysis of hybrid systems, and<br>congestion control over wireless ad hoc and sensor networks. Dr.<br>Wang has been a member of the Technical Program Committees of<br>several conferences including IEEE INFOCOM 2009-2011, IEEE ICC<br>2007-2011, IEEE Globecom 2007-2011.<o:p></o:p></p><p class=MsoNormal><span style='font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1F497D'><o:p> </o:p></span></p></div></div></body></html>