Mobility

Data Collection With Multiple Sinks in Wireless Sensor Networks

Download Now Free registration required

Executive Summary

In this paper, the authors consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes needs to be transmitted to one of multiple sinks. This paper designs an approximation algorithm to minimize the latency of data collection schedule and show that it gives a constant-factor performance guarantee. The authors also present a heuristic algorithm based on breadth first search for this problem. Using simulation, the authors evaluate the performance of these two algorithms, and show that the approximation algorithm outperforms the heuristic up to 60%.

  • Format: PDF
  • Size: 226 KB