@inproceedings{3ba29c76acd04fdb970d191a00fb316b,
title = "Lower bounds on data collection time in sensor networks",
abstract = "We study the time complexity of data collection in sensor networks. A simple mathematical model for sensor networks regarded as lines, multi-lines and trees is defined and corresponding optimal schedules are provided. A lower bound of data collection time on general graph networks is also derived. Furthermore, we discuss the data collection problem where each node can transmit arbitrary hops per time slot. An optimal schedule is derived where each node can transmit 2 hops. We also prove the schedule is nearly optimal if each node can transmit k (k > 2) hops (with constant error).",
author = "Xianwei Sun and Huang, \{Scott C.H.\} and Minming Li",
year = "2012",
doi = "10.1007/978-3-642-31869-6\_10",
language = "英语",
isbn = "9783642318689",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "120--131",
booktitle = "Wireless Algorithms, Systems, and Applications - 7th International Conference, WASA 2012, Proceedings",
note = "7th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2012 ; Conference date: 08-08-2012 Through 10-08-2012",
}