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

Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation

1Department of Information Engineering, I-Shou University, Kaohsiung 84001, Taiwan
2Department of Electronic Engineering, National Chin-Yi University of Technology, Taichung 41170, Taiwan

Received 26 June 2014; Revised 9 September 2014; Accepted 20 March 2015

Academic Editor: Chenzhong Li

Copyright © 2015 Chi-Chang 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. W. W. R. Ball, Mathematical Recreations and Essays, Dover Publications, New York, NY, USA, 13th edition, 2010.
  2. D. S. Hochbaum and W. Maass, “Approximation schemes for covering and packing problems in image processing and VLSI,” Journal of the Association for Computing Machinery, vol. 32, no. 1, pp. 130–136, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. D. S. Johnson, “The NP-completeness column: an ongoing guide,” Journal of Algorithms, vol. 3, no. 2, pp. 182–195, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, “Optimal packing and covering in the plane are NP-complete,” Information Processing Letters, vol. 12, no. 3, pp. 133–137, 1981. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. M. Franceschetti, M. Cook, and J. Bruck, “A geometric theorem for approximate disc covering algorithms,” Electronic Technical Report ETR035, 2001, http://resolver.caltech.edu/CaltechPARADISE:2001.ETR035. View at Google Scholar
  6. H. Brönnimann and M. T. Goodrich, “Almost optimal set covers in finite VC-dimension,” Discrete & Computational Geometry, vol. 14, no. 4, pp. 463–479, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. T. F. Gonzalez, “Covering a set of points in multidimensional space,” Information Processing Letters, vol. 40, no. 4, pp. 181–188, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. M. Franceschetti, M. Cook, and J. Bruck, “A geometric theorem for network design,” IEEE Transactions on Computers, vol. 53, no. 4, pp. 483–489, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. B. Fu, Z. Chen, and M. Abdelguerfi, “An almost linear time 2.8334-approximation algorithm for the disc covering problem,” in Algorithmic Aspects in Information and Management, vol. 4508 of Lecture Notes in Computer Science, pp. 317–326, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  10. G. K. Das, R. Fraser, A. Lòpez-Ortiz, and B. G. Nickerson, “On the discrete unit disk cover problem,” in WALCOM: Algorithms and Computation: 5th International Workshop, WALCOM 2011, New Delhi, India, February 18–20, 2011. Proceedings, N. Katoh and A. Kumar, Eds., vol. 6552 of Lecture Notes in Computer Science, pp. 146–157, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  11. E. L. Lloyd and G. Xue, “Relay node placement in wireless sensor networks,” IEEE Transactions on Computers, vol. 56, no. 1, pp. 134–138, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  12. J. Tang, B. Hao, and A. Sen, “Relay node placement in large scale wireless sensor networks,” Computer Communications, vol. 29, no. 4, pp. 490–501, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. G. Chen and S. Cui, “Relay node placement in two-tiered wireless sensor networks with base stations,” Journal of Combinatorial Optimization, vol. 26, no. 3, pp. 499–508, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. S. Misra, N. E. Majd, and H. Huang, “Approximation algorithms for constrained relay node placement in energy harvesting wireless sensor networks,” IEEE Transactions on Computers, vol. 63, no. 12, pp. 2933–2947, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  15. Z. Gao, K. Chen, and X. Qiu, “Relay node placement with base stations in wireless sensor networks fault-tolerant,” Chinese Journal of Electronics, vol. 23, no. 4, pp. 794–800, 2014. View at Google Scholar
  16. N. Kumar and P. K. Jana, “Relay node placement algorithm in wireless sensor network,” in Proceedings of the 4th IEEE International Advance Computing Conference (IACC '14), pp. 220–225, February 2014. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Barati, M. Sedighi, A. Movaghar, and I. Attarzadeh, “Proposing a novel algorithm for fault-tolerant relay node placement in wireless sensor networks,” Journal of Advances in Computer Research, vol. 5, no. 1, pp. 53–60, 2014. View at Google Scholar
  18. J. L. Wong, R. Jafari, and M. Potkonjak, “Gateway placement for latency and energy efficient data aggregation,” in Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks, pp. 490–497, November 2004. View at Publisher · View at Google Scholar · View at Scopus
  19. C.-Y. Chang, C.-C. Chen, and C.-C. Liu, “A novel approximation algorithm for minimum geometric disk cover problem with hexagon tessellation,” in Advances in Intelligent Systems and Applications—Volume 1: Proceedings of the International Computer Symposium ICS 2012 Held at Hualien, Taiwan, December 12–14, 2012, R.-S. Chang, L. C. Jain, and S.-L. Peng, Eds., pp. 157–166, Springer, Heidelberg, Germany, 2013. View at Publisher · View at Google Scholar