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

講座人：Ning Lu 助理教授

講座時(shí)間：5月17日10:00

講座地點(diǎn)：騰訊會(huì)議直播（ID:963 442 552）

講座人介紹：

Professor Ning Lu是加拿大未來(lái)通信網(wǎng)絡(luò)研究會(huì)（Tier 2）主席，英國(guó)女王大學(xué)電氣與計(jì)算機(jī)工程系助理教授。Professor Lu獲得了工程學(xué)學(xué)士學(xué)位(2007）和M.Eng(2010）中國(guó)上海同濟(jì)大學(xué)學(xué)位和博士學(xué)位。加拿大安大略省滑鐵盧市滑鐵盧大學(xué)電氣工程專業(yè)學(xué)位（2015年）。在加入皇后大學(xué)之前，他是加拿大不列顛哥倫比亞省坎洛普斯市湯普森河大學(xué)計(jì)算科學(xué)系的助理教授。2015年至2016年，他是伊利諾伊大學(xué)香檳分校協(xié)調(diào)科學(xué)實(shí)驗(yàn)室的博士后研究員。2009年夏天，他還在日本東京國(guó)立信息學(xué)院實(shí)習(xí)。他目前的研究興趣包括無(wú)線通信網(wǎng)絡(luò)的實(shí)時(shí)調(diào)度、分布式算法和強(qiáng)化學(xué)習(xí)。他在IEEE頂級(jí)期刊和會(huì)議上發(fā)表了50多篇論文，包括IEEE/ACM Transactions on Networking、IEEE Journal on Selected Areas in Communications、ACM MobiHoc和IEEE INFOCOM等。Professor Lu獲得了多項(xiàng)獎(jiǎng)項(xiàng)和研究金。他和他的團(tuán)隊(duì)贏得了2014年法雷奧創(chuàng)新挑戰(zhàn)賽的第二名，這是因?yàn)樗麄冊(cè)谲囕v網(wǎng)絡(luò)協(xié)議設(shè)計(jì)方面表現(xiàn)出色。他在2014年IEEE全球通信大會(huì)上獲得了最佳論文獎(jiǎng)。2015年，他獲得了NSERC博士后獎(jiǎng)學(xué)金。Professor Lu目前是《無(wú)線網(wǎng)絡(luò)百科全書》（Encyclopedia of Wireless Networks）的編委會(huì)成員。

講座內(nèi)容：

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.

主辦單位：通信工程學(xué)院