A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Data Collection with Multiple Sinks in Wireless Sensor Networks
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multiple sinks. We design an approximation algorithm to minimize the latency of data collection schedule and show that it gives a constant-factor performance guarantee. We also present a heuristic algorithm based on breadth first search for this problem. Using simulation, we evaluate the performance of these two algorithms,
doi:10.1007/978-3-642-03417-6_28
fatcat:7py4ukx5zvg47fozy7vdxwync4