Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic

讲座名称：Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic

讲座人：Ning Lu 助理教授

讲座时间：5月17日10:00

讲座地点：腾讯会议直播（ID:963 442 552）

讲座人介绍：

Professor Ning Lu是加拿大未来通信网络研究会（Tier 2）主席，英国女王大学电气与计算机工程系助理教授。Professor Lu获得了工程学学士学位(2007）和M.Eng(2010）中国上海同济大学学位和博士学位。加拿大安大略省滑铁卢市滑铁卢大学电气工程专业学位（2015年）。在加入皇后大学之前，他是加拿大不列颠哥伦比亚省坎洛普斯市汤普森河大学计算科学系的助理教授。2015年至2016年，他是伊利诺伊大学香槟分校协调科学实验室的博士后研究员。2009年夏天，他还在日本东京国立信息学院实习。他目前的研究兴趣包括无线通信网络的实时调度、分布式算法和强化学习。他在IEEE顶级期刊和会议上发表了50多篇论文，包括IEEE/ACM Transactions on Networking、IEEE Journal on Selected Areas in Communications、ACM MobiHoc和IEEE INFOCOM等。Professor Lu获得了多项奖项和研究金。他和他的团队赢得了2014年法雷奥创新挑战赛的第二名，这是因为他们在车辆网络协议设计方面表现出色。他在2014年IEEE全球通信大会上获得了最佳论文奖。2015年，他获得了NSERC博士后奖学金。Professor Lu目前是《无线网络百科全书》（Encyclopedia of Wireless Networks）的编委会成员。

讲座内容：

In this seminar, we consider the problem of scheduling real-time traffic with hard deadlines in a wireless ad hoc network. In contrast to existing real-time scheduling policies that merely ensure a minimal timely throughput, our design goal is to provide guarantees on both the timely throughput and data freshness in terms of age-of-information (AoI), which is a newly proposed metric that captures the “age” of the most recently received information at the destination of a link. The main idea is to introduce the AoI as one of the driving factors in making scheduling decisions. We first prove that the proposed scheduling policy is feasibility-optimal, i.e., satisfying the per-traffic timely throughput requirement. Then, we derive an upper bound on a considered data freshness metric in terms of AoI, demonstrating that the network-wide data freshness is guaranteed and can be tuned under the proposed scheduling policy. Interestingly, we reveal that the improvement of network data freshness is at the cost of slowing down the convergence of the timely throughput. Extensive simulations are performed to validate our analytical results. Both analytical and simulation results confirm the capability of the proposed scheduling policy to improve the data freshness without sacrificing the feasibility optimality.

主办单位：通信工程学院