Minimum-time aggregation scheduling in multi-sink sensor networks

2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011

Volumn , Issue , 2011, Pages 422-430

  Yu, Bo ^a   Li, Jianzhong ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA AGGREGATION; INDUCED SUBGRAPHS; LOWER BOUNDS; MAXIMAL INDEPENDENT SET; MINIMUM TIME; NETWORK GRAPH; NP-HARD; SCHEDULING PROBLEM; SENSOR NETWORK APPLICATIONS; UPPER BOUND; VERTEX DEGREE; VERTEX SET;

MESH NETWORKING; TREES (MATHEMATICS); WIRELESS AD HOC NETWORKS; WIRELESS SENSOR NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 80052819814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAHCN.2011.5984926     Document Type: Conference Paper

References (18)

1. http://db.cs.hit.edu.cn/reports/2010/multisink-full.pdf.
2. http://www.greenorbs.org/.
3. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345-405, 1991.
4. S. Chen, Y. Wang, X.-Y. Li, and X. Shi. Order-optimal data collection in wireless sensor networks: delay and capacity. In SECON, 2009.
5. X. Chen, X. Hu, and J. Zhu. Minimum data aggregation time problem in wireless sensor networks. In 1st Int'l Conference on Mobile Ad-hoc and Sensor Network-MSN, pages 133-142, 2005.
6. P. Ciciriello, L. Mottola, and G. P. Picco. Efficient routing from multiple sources to multiple sinks in wireless sensor networks. In EWSN, 2007.
7. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. In Discrete Mathematics, volume 86, pages 165-177, 1990.
8. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In ICDE, pages 449-460, 2004.
9. A. Das and D. Dutta. Data acquisition in multiple-sink sensor networks. Mobile Computing and Communications Review, 9(3):82-85, 2005.
10. S. C.-H. Huang, P.-J. Wan, C. T. Vu, Y. Li, and F. Yao. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In INFOCOM, pages 366-372, 2007.
11. C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann. Impact of network density on data aggregation in wireless sensor networks. In ICDCS, pages 457-458, 2002.
12. R. Kawano and T. Miyazaki. Distributed data aggregation in multi-sink sensor networks using a graph coloring algorithm. In AINA Workshops, pages 934-940, 2008.
13. Y. Li, L. Guo, and S. K. Prasad. An energy-efficient distributed algorithm for minimum-latency aggregation scheduling in wireless sensor networks. In ICDCS, pages 827-836, 2010.
14. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. Tag: a tiny aggregation service for ad-hoc sensor networks. In OSDI, 2002.
15. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: New aggregation techniques for sensor networks. In Sensys, 2004.
16. A. Silberstein, R. Braynard, and J. Yang. Constraint-chaining: On energy-efficient continuous monitoring in sensor networks. In SIGMOD, 2006.
17. P.-J. Wan, S. C.-H. Huang, L. Wang, Z. Wan, and X. Jia. Minimum-latency aggregation scheduling in multihop wireless networks. In MobiHoc, pages 185-193, 2009.
18. B. Yu, J. Li, and Y. Li. Distributed data aggregation scheduling in wireless sensor networks. In INFOCOM, 2009.