*时间：2023年6月7日  9：00-10：00

*地点：数学楼102

*主讲人：陈秋媛 教授

*主持人：吕长虹 教授

*讲座内容简介：

The original Prim’s algorithm forms a minimum spanning tree for a connected weighted graph by adding a closest vertex to the current subtree at each step. In this work, we enhance the original Prim’s algorithm so that it can be used to partition massive IoT networks to achieve collision-free receiver-initiated data collection.  In particular, two device mobility patterns are considered and two spanning forest based algorithms with four different flavors of cluster partitioning are proposed.  (This is a joint work with Chia-An Hsu, Chung-Hsiang Tsai, Frank Y. Li, and Yu-Chee Tseng.)

*主讲人简介：

陈秋媛教授为新竹交通大学资讯工程系博士，现任教于阳明交通大学应用数学系。长年之研究兴趣环绕在「图论、算法、计算机网络」，近年则以「图论在无线传感网络之应用」为主轴。