Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2015, Article ID 506909, 17 pages
http://dx.doi.org/10.1155/2015/506909
Research Article

Minimum Cost Data Aggregation for Wireless Sensor Networks Computing Functions of Sensed Data

1Department of Computer and Communications, Korea University, Seoul 136-701, Republic of Korea
2Department of Digital Contents Convergence, Seoul National University, Seoul 151-742, Republic of Korea
3Department of Computer Engineering, Hongik University, Seoul 121-791, Republic of Korea

Received 11 December 2014; Accepted 12 January 2015

Academic Editor: Yun Liu

Copyright © 2015 Chao Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Giridhar and P. R. Kumar, “Computing and communicating functions over sensor networks,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 4, pp. 755–764, 2005. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Estrin, and D. Ganesan, “Building efficient wireless sensor networks with low-level naming,” ACM SIGOPS Operating Systems Review, vol. 35, no. 5, pp. 146–159, 2001. View at Publisher · View at Google Scholar
  3. C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed diffusion: a scalable and robust communication paradigm for sensor networks,” in Proceedings of the 6th annual international conference on Mobilecomputing and networking, pp. 56–67, ACM, August 2000. View at Scopus
  4. L. Krishnamachari, D. Estrin, and S. Wicker, “The impact of data aggregation in wireless sensor networks,” in Proceedings of the 22nd International Conference on Distributed Computing Systems Workshops, pp. 575–578, IEEE, 2002. View at Publisher · View at Google Scholar
  5. M. Bagaa, Y. Challal, A. Ksentini, A. Derhab, and N. Badache, “Data aggregationscheduling algorithms in wireless sensor networks: solutionsand challenges,” IEEE Communications Surveys and Tutorials, vol. 16, no. 3, pp. 1339–1368, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. L. A. Villas, A. Boukerche, H. S. Ramos, H. A. B. F. de Oliveira, R. B. de Araujo, and A. A. F. Loureiro, “DRINA: a lightweight and reliable routing approach for in-network aggregation in wireless sensor networks,” IEEE Transactions on Computers, vol. 62, no. 4, pp. 676–689, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Ma, W. Lou, and X.-Y. Li, “Contiguous link scheduling for data aggregation in wireless sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 7, pp. 1691–1701, 2014. View at Publisher · View at Google Scholar
  8. Z.-J. Zhang, C.-F. Lai, and H.-C. Chao, “A green data transmission mechanism for wireless multimedia sensor networks using information fusion,” IEEE Wireless Communications, vol. 21, no. 4, pp. 14–19, 2014. View at Publisher · View at Google Scholar
  9. I. F. Akyildiz, T. Melodia, and K. R. Chowdury, “Wireless multimedia sensor networks: a survey,” IEEE Wireless Communications, vol. 14, no. 6, pp. 32–39, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. P. Von Rickenbach and R. Wattenhofer, “Gathering correlated data in sensor networks,” in Proceedings of the Joint Workshop on Foundations of Mobile Computing, pp. 60–66, ACM, 2004.
  11. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, “Networked slepianwolf: theory, algorithms, and scaling laws,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4057–4073, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. S. Pattem, B. Krishnamachari, and R. Govindan, “The impact of spatial correlation on routing with compression in wireless sensor networks,” in Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN '04), pp. 28–35, Berkeley, Calif, USA, April 2004. View at Publisher · View at Google Scholar
  13. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, “On network correlated data gathering,” in Proceedings of the 23rd AnnualJoint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), vol. 4, pp. 2571–2582, March 2004. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Liu, M. Adler, D. Towsley, and C. Zhang, “On optimal communication cost for gathering correlated data through wireless sensor networks,” in Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MOBICOM '06), pp. 310–321, ACM, September 2006. View at Scopus
  15. S. Hariharan and N. Shroff, “Maximizing aggregated revenue in sensor networks under deadline constraints,” in Proceedings of the 48th IEEE Conference on Decision and Control, pp. 4846–4851, 2010.
  16. A. Goel and D. Estrin, “Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03), pp. 499–505, SIAM, 2003.
  17. M. Andrews and L. Zhang, “The access network design problem,” in Proceedings of the of IEEE Symposium on Foundations of Computer Science (FOCS '98), p. 40, IEEE Computer Society, 1998.
  18. Y. Bartal, “On approximating arbitrary metrics by tree metrics,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 161–168, ACM, May 1998. View at Scopus
  19. A. Meyerson, K. Munagala, and S. Plotkin, “Cost-distance: two metric network design,” in Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS '00), p. 624, IEEE Computer Society, 2000. View at Scopus
  20. S. Guha, A. Meyerson, and K. Munagala, “A constant factor approximation for the single sink edge installation problems,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 383–388, ACM, 2001.
  21. M. Andrews, A. Anta, L. Zhang, and W. Zhao, “Routing for energy minimizationin the speed scaling model,” in Proceedings of the IEEE INFOCOM, pp. 1–9, IEEE, San Diego, Calif, USA, March 2010. View at Publisher · View at Google Scholar
  22. M. Andrews, S. Antonakopoulos, and L. Zhang, “Minimum-cost network design with (Dis)economies of scale,” in Proceedings of the IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS '10), pp. 585–592, Las Vegas, Nev, USA, October 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian, “Buy-at-bulk network design: approximating the single-sink edge installation problem,” in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 619–628, Society for Industrial and Applied Mathematics, January 1997. View at Scopus
  24. B. Awerbuch and Y. Azar, “Buy-at-bulk network design,” in Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science (FOCS '97), IEEE Computer Society, pp. 542–547, October 1997. View at Publisher · View at Google Scholar · View at Scopus
  25. D. R. Karger and M. Minkoff, “Building Steiner trees with incomplete global knowledge,” in Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS '00), pp. 613–623, IEEE Computer Society, November 2000. View at Scopus
  26. M. Charikar and A. Karagiozova, “On non-uniform multicommodity buy-at-bulk network design,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 176–182, ACM, 2005. View at Scopus
  27. C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour, “Approximation algorithms for non-uniform buy-at-bulk network design,” in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS '06), pp. 677–686, Berkeley, Calif, USA, October 2006. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Scaglione and S. D. Servetto, “On the interdependence of routing and data compression in multi-hop sensor networks,” in Proceedings of the 8th ACM Annual International Conference on Mobile Computing and Networking (MobiCom '02), pp. 140–147, Atlanta, Ga, USA, September 2002. View at Publisher · View at Google Scholar
  29. L. Galluccio, S. Palazzo, and A. T. Campbell, “Efficient data aggregation in wireless sensor networks: an entropy-driven analysis,” in Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '08), pp. 1–6, September 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. D. Kandris, P. Tsioumas, A. Tzes, G. Nikolakopoulos, and D. D. Vergados, “Power conservation through energy efficient routing in wireless sensor networks,” Sensors, vol. 9, no. 9, pp. 7320–7342, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. D. Kandris, M. Tsagkaropoulos, I. Politis, A. Tzes, and S. Kotsopoulos, “Energy efficient and perceived QoS aware video routing over wireless multimedia sensor networks,” Ad Hoc Networks, vol. 9, no. 4, pp. 591–607, 2011. View at Publisher · View at Google Scholar · View at Scopus
  32. L. Galluccio, A. T. Campbell, and S. Palazzo, “Concert: aggregation-based congestion control for sensor networks,” in Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems, pp. 274–275, San Diego, California, USA, November 2005. View at Publisher · View at Google Scholar
  33. T. Cover and J. Thomas, Elements of Information Theory, John Wiley & Sons, New York, NY, USA, 1991.
  34. M. Madiman, “On the entropy of sums,” in Proceedings of the Information Theory Workshop (ITW '08), pp. 303–307, IEEE, Porto, Portugal, May 2008. View at Publisher · View at Google Scholar
  35. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004. View at Publisher · View at Google Scholar
  36. J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, “An improved LP-based approximation for steiner tree,” in Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC '10), pp. 583–592, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  37. A. Schrijver, Combinatorial Optimization, Springer, New York, NY, USA, 2003.