- This event has passed.
Reliable Stream Scheduling with Minimum Latency for Wireless Sensor Networks
August 14 @ 7:30 pm UTC+0
As sensor networks are increasingly deployed for critical applications, reliability and latency guarantee become more important than ever to meet industrial requirements. In this paper, we investigated the impact of link burstiness on stream scheduling using a data trace of 3,600,000 packets collected from an indoor testbed. By using R, we demonstrate that a good tradeoff between reliability and latency can be achieved by allocating certain time slots on each link for stream transmissions based on its burst length and frequency distributions. With this observation, we design transmission scheduling and routing algorithms for data streams to meet a specified reliability requirement while minimizing end-to-end latency. For the multi-stream scheduling problem, we prove its NP-hardness and design an algorithm that achieves the reliability guarantee and an $O(log n)$ approximation of minimizing the maximum end-to-end latency for any stream. Trace-driven simulations show that our solution meets specified end-to-end reliability requirements with latency up to 9.18 times less than existing solutions.
Title: Optimal scheduling combining with real-data analysis in complex network- take security patrol and sensor network as examples
Abstract:Finding optimal schedule is a long and challenging problem in a complex network such as scheduling in the traffic network, transmission in IoT/SDN/ wireless network, or advertising on the social network. On the other hand, with more and more data and analysis tools emerged, simple modeling methods are not satisfied in the new and complex environment. Therefore, in this talk, Hao-Tsung Yang would demonstrate how to use both analysis (R tools) and algorithmic techniques (mathematic tools) to help to model and solving real-world problems in the complex network. There are two examples used for this talk; Reliable scheduling in wireless sensor network, which is presented at SECON 2017 and Safty patrol in security game, which was just submitted in this july for INFOCOM 2018. Additionally, in the end of this talk, Hao-Tsung Yang will introduce his school and life in U.S. and also share his experience of studying abroad.
在複合式網路上，最佳化排程/路徑問題一直是個被關注且挑戰性很高的問題，比如傳統的交通網路，或是近年的IoT、SDN、無線網路，以及廣告推銷。另一方面，隨著資料科學的進展，有越來越多的數據、分析工具被應用在各種模型。用傳統簡易的模型來解決最佳化問題已經不適合應用在目前的複雜網路上。講者將利用兩個現實上的問題去示範如何結合資料科學的技術以及演算法的工具來設計並解決最佳化排程/路徑問題。第一個例子是解決在探測器網路上的傳輸路徑問題，另一個則是利用賽局理論解決巡邏問題。此兩個例子已分別發表在2017 SECON 國際會議以及剛投稿在2018的INFOCOM 國際會議。最後，講者也會藉由這個機會分享他在國外的研究生活以及出國留學的經驗。
• 19:30 ~ 20:00 Section 1 （會介紹一些在R上面應用)
• 20:00~ 21:00 Section 2 (會帶大家入門一些賽局理論)
講者： Hao-Tsung Yang
I am currently a Ph.D. candidate in the Computer Science of Stony Brook University. My main interest is data analysis and algorithm design in complex networks such as sensor networks, social networks, and security network.