报告题目：An Enhanced Minimum Spanning Tree Algorithm for Achieving Collision-Free Transmissions in Massive IoT Networks
报告人：陈秋媛教授，台湾阳明交通大学
报告时间：2023年6月12日，11:00-12:00
报告地点：21幢427
摘要：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.)
邀请人：朱绪鼎