Improved Approximation Algorithms for Relay Placement

  • Alon Efrat
  • Sándor P. Fekete
  • Poornananda R. Gaddehosur
  • Joseph S. B. Mitchell
  • Valentin Polishchuk
  • Jukka Suomela
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)

Abstract

In the relay placement problem the input is a set of sensors and a number r ≥ 1, the communication range of a relay. The objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. We present a 3.11-approximation algorithm, and show that the problem admits no PTAS, assuming P\({}\ne{}\)NP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, D., Du, D.Z., Hu, X.D., Lin, G.H., Wang, L., Xue, G.: Approximations for Steiner trees with minimum number of Steiner points. Journal of Global Optimization 18(1), 17–33 (2000)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chen, D., Du, D.Z., Hu, X.D., Lin, G.H., Wang, L., Xue, G.: Approximations for Steiner trees with minimum number of Steiner points. Theoretical Computer Science 262(1–2), 83–99 (2001)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Cheng, X., Du, D.Z., Wang, L., Xu, B.: Relay sensor placement in wireless sensor networks. Wireless Networks (to appear, 2007)Google Scholar
  4. 4.
    Liu, H., Wan, P.J., Jia, X.: Fault-tolerant relay node placement in wireless sensor networks. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 230–239. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Lloyd, E.L., Xue, G.: Relay node placement in wireless sensor networks. IEEE Transactions on Computers 56(1), 134–138 (2007)CrossRefGoogle Scholar
  6. 6.
    Srinivas, A., Zussman, G., Modiano, E.: Mobile backbone networks – construction and maintenance. In: Proc. 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, Florence, Italy, May 2006, pp. 166–177. ACM Press, New York (2006)Google Scholar
  7. 7.
    Zhang, W., Xue, G., Misra, S.: Fault-tolerant relay node placement in wireless sensor networks: Problems and algorithms. In: Proc. 26th IEEE International Conference on Computer Communications, INFOCOM, Anchorage, Alaska, USA, May 2007, pp. 1649–1657. IEEE, Piscataway (2007)CrossRefGoogle Scholar
  8. 8.
    Bredin, J.L., Demaine, E.D., Hajiaghayi, M., Rus, D.: Deploying sensor networks with guaranteed capacity and fault tolerance. In: Proc. 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc, Urbana-Champaign, IL, USA, May 2005, pp. 309–319. ACM Press, New York (2005)CrossRefGoogle Scholar
  9. 9.
    Cerdeira, J.O., Pinto, L.S.: Requiring connectivity in the set covering problem. Journal of Combinatorial Optimization 9(1), 35–47 (2005)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Shuai, T.P., Hu, X.D.: Connected set cover problem and its applications. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 243–254. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Yang, Y., Lin, M., Xu, J., Xie, Y.: Minimum spanning tree with neighborhoods. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 306–316. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Du, D.Z., Hwang, F.: An approach for proving lower bounds: Solution of Gilbert–Pollak’s conjecture on Steiner ratio. In: Proc. 31st Annual Symposium on Foundations of Computer Science, FOCS, St. Louis, MO, USA, October 1990, pp. 76–85. IEEE, Piscataway (1990)CrossRefGoogle Scholar
  13. 13.
    Berman, P., Karpinski, M.: On some tighter inapproximability results. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200–209. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Alon Efrat
    • 1
  • Sándor P. Fekete
    • 2
  • Poornananda R. Gaddehosur
    • 1
  • Joseph S. B. Mitchell
    • 3
  • Valentin Polishchuk
    • 4
  • Jukka Suomela
    • 4
  1. 1.Department of Computer ScienceUniversity of Arizona 
  2. 2.Department of Computer ScienceBraunschweig University of Technology 
  3. 3.Department of Applied Mathematics and StatisticsStony Brook University 
  4. 4.Helsinki Institute for Information Technology HIITUniversity of Helsinki and Helsinki University of Technology 

Personalised recommendations