Skip to main content
SpringerLink
Log in

Radar placement along banks of river

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we consider the Radar Placement and Power Assignment problem (RPPA) along a river. In this problem, a set of crucial points in the river are required to be monitored by a set of radars which are placed along the two banks. The goal is to choose the locations for the radars and assign powers to them such that all the crucial points are monitored and the total power is minimized. If each crucial point is required to be monitored by at least k radars, the problem is a k-Coverage RPPA problem (k-CRPPA). Under the assumption that the river is sufficiently smooth, one may focus on the RPPA problem along a strip (RPPAS). In this paper, we present an O(n 9) dynamic programming algorithm for the RPPAS, where n is the number of crucial points to be monitored. In the special case where radars are placed only along the upper bank, we present an O(kn 5) dynamic programming algorithm for the k-CRPPAS. For the special case that the power is linearly dependent on the radius, we present an O(n log n)-time \({2\sqrt 2}\)-approximation algorithm for the RPPAS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agnetis A., Grande E., Mirchandani P.B., Pacifici A.: Covering a line segment with variable radius discs. Comput. Oper. Res. 36, 1423–1436 (2009)

    Article  Google Scholar 

  2. Alt, H., Arkin, E.M., Brönnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry, pp. 449–458 (2006)

  3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (1983), pp. 254–273. J. ACM 41, 153–180 (1994)

  4. Bilò, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Proceedings of the 13th Annual European Symposium on Algorithms, LNCS, vol. 3669, pp. 60–71 (2005)

  5. Cardei I., Cardei M., Wang L.S., Xu B.G., Du D.-Z.: Optimal relay location for resource-limited energy-efficient wireless communication. J. Glob. Optim. 36, 391–399 (2006)

    Article  Google Scholar 

  6. Cheng, M.X., Gong, X.: Maximum lifetime coverage preserving scheduling algorithms in sensor networks. J. Glob. Optim. doi:10.1007/s10898-010-9636-3

  7. Chvátal V.: A combinatorial theorem in plane geometry. J. Comb. Theory 18, 39–41 (1975)

    Article  Google Scholar 

  8. Glaßer C., Reith S., Vollmer H.: The complexity of base station positioning in cellular networks. Discrete Appl. Math. 148, 1–12 (2005)

    Article  Google Scholar 

  9. Gupta H., Zhou Z., Das R., Gu Q.: Connected sensor cover: self-organizaiton of sensor networks for efficient query execution. IEEE/ACM Trans. Netw. 16, 55–67 (2006)

    Article  Google Scholar 

  10. Hochbaum D.S., Mass W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130–136 (1985)

    Article  Google Scholar 

  11. Hoffmann, F., Kaufmann, M., Kriegel, K.: The art gallery theorem for polygons with holes. In: IEEE 32nd Annual Symposium of Foundations of Computer Science, pp. 39–48 (1991)

  12. Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: ACM International Workshop on Wireless Sensor Networks and Applications, pp. 115–121 (2003)

  13. Lev-Tov N., Peleg D.: Polynomial time approximation shcemes for base station coverage with minimum total radii. Comput. Netw. 47, 489–501 (2005)

    Article  Google Scholar 

  14. Pardalos, P.M., Resende, M. (eds): Handbook of Applied Optimization. Oxford University Press, Oxford (2002)

    Google Scholar 

  15. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: ACM International Conference on Embedded Networked Sensor Systems, pp. 28–39 (2003)

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and System Sciences, Xinjiang University, 830046, Urumqi, Xinjiang, People’s Republic of China

    Zhao Zhang

  2. Department of Computer Science, University of Texas at Dallas, Richardson, Dallas, TX, 75080, USA

    Ding-Zhu Du

Authors
  1. Zhao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ding-Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhao Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Z., Du, DZ. Radar placement along banks of river. J Glob Optim 52, 729–741 (2012). https://doi.org/10.1007/s10898-011-9704-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9704-3

Keywords

Search

Navigation