Minimum latency data collection in interference-aware Wireless Sensor Networks

In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency a schedule, that is, to compute a schedule with the minimum number of timeslots, such that all data from all nodes can be collected to a sink node without any collision or interference. We introduce an approximation algorithm with O(1)-approximation ratio that works in both the interference models by yielding a schedule whose latency is bounded by O(n), where n is the number of nodes in the network.