Semi-Structured Scheduling for Minimum-Latency Data Collection in Wireless Sensor Networks
Data collection is a fundamental yet time-consuming operation in wireless sensor networks. In this paper, focuses on the data collection scheduling problem to minimize the schedule length (i.e., the total latency). Prior work on this problem usually adopted a structured approach, in which a tree-based structure is used as an input for the scheduling algorithm. Since the scheduling performance mainly depends on the supplied tree, such an approach cannot guarantee optimal performance. To address this issue, the authors propose an improved scheduling approach based on semi-structured topology.