学术报告：Algorithm Design and Analysis in Wireless Networks

学术报告：Algorithm Design and Analysis in Wireless Networks

报告时间：8月25日（周五）10:00-11:30

地点：十大网赌网址信誉排行榜101报告厅

特邀学者：巴黎南大学Lin Chen (陈林)博士，副教授

 Assistant Professor, Department of Computer Science in the University of Paris-Sud
E-mail: lin.chen@lri.fr

Abstract:

Algorithms are one of the most fundamental elements in computer science. Networks and networked systems are no exception. This talk covers our recent research on some algorithmic problems of both fundamental and practical importance in modern networks and networked systems, more specifically, wireless networks. These problems include (1) channel rendezvous and neighbor discovery, (2) opportunistic channel access, (3) distributed learning, (4) path optimization and scheduling, (5) algorithm design and analysis in radio-frequency identification systems.

Methodologically, most of our analysis is systematically articulated as follows: (1) Establishment of theoretical performance bound, (2) Optimum or approximation algorithm design, (3) Further extension and generalization. By our work we aim at making a tiny while systematic step forwards in the design and analysis of algorithms that can scale elegantly, act efficiently in terms of computation and communication, while keeping operations as local and distributed as possible.

Biography: 陈林2002年毕业于东南大学强化班（现吴健雄学院），专业无线电工程，获工学学士，2005年和2008年在巴黎高等电信学院取得工程师，博士学位，现任巴黎南大学计算机系副教授。2012年起连续获法国教育部科研优秀津贴，主要研究领域为无线网络算法设计分析，信息安全。2015年起任IEEE Communications Society Technical Subcommittee on Green Communications and Computing (TSCGCC)主席，发表论文100余篇，曾获2008年国家自费留学生奖学金和ICCCN最佳论文奖。

主持人：陈翔 (chenxiang@mail.sysu.edu.cn)