Skip to main content

Set It and Forget It: Approximating the Set Once Strip Cover Problem

Abstract

We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proportion to a radius that can be set just once, but activated at any time. The problem is to find an assignment of radii and activation times that maximizes the length of time during which the entire region is covered. We show that this problem is NP-hard. In addition, we show that RoundRobin, the algorithm in which the sensors take turns covering the entire region, has a tight approximation guarantee of \(\frac{3}{2}\). This result also applies to the more general Strip Cover problem, in which each radius may be set finitely-many times. Moreover, we show that the more general class of duty cycle algorithms, in which groups of sensors take turns covering the entire region, can do no better. Finally, we give an \(O(n^2 \log {n})\)-time optimization algorithm for the related Set Radius Strip Cover problem, in which sensors must be activated immediately.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Notes

  1. 1.

    If \(S \in \mathbb {R}_+^n \times \mathbb {R}_+^n\), our upper bound on the approximation ratio of RoundRobin would be \(\frac{3}{2}+\epsilon \), for any \(\epsilon >0\).

References

  1. 1.

    Abrams, Z., Goel, A., Plotkin, S.A.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: 3rd International Symposium on Information Processing in Sensor Networks, pp. 424–432 (2004)

  2. 2.

    Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. Discrete Comput. Geom. 44(3), 706–723 (2010)

    MathSciNet  Article  MATH  Google Scholar 

  3. 3.

    Bar-Noy, A., Baumer, B.: Average case network lifetime on an interval with adjustable sensing ranges. Algorithmica 72(1), 148–166 (2015)

    MathSciNet  Article  MATH  Google Scholar 

  4. 4.

    Bar-Noy, A., Baumer, B., Rawitz, D.: Changing of the guards: strip cover with duty cycling. In: 19th International Colloquium onStructural Information and Communication Complexity, Volume 7355 of Lecture Notes in Computer Science, pp. 36–47 (2012)

  5. 5.

    Bar-Noy, A., Brown, T., Johnson, M.P., Liu, O.: Cheap or flexible sensor coverage. In: 5th IEEE International Conference on Distributed Computing in Sensor Systems, Volume 5516 of Lecture Notes in Computer Science, pp. 245–258 (2009)

  6. 6.

    Bar-Noy, A., Rawitz, D., Terlecky, P.: Maximizing barrier coverage lifetime with mobile sensors. In: 21st Annual European Symposium on Algorithms, Volume 8125 of Lecture Notes in Computer Science, pp. 97–108 (2013)

  7. 7.

    Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1056–1063 (2007)

  8. 8.

    Cardei, M., Du, D.: Improving wireless sensor network lifetime through power aware organization. Wirel. Netw. 11(3), 333–340 (2005)

    Article  Google Scholar 

  9. 9.

    Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Ilyas, M., Mahgoub, I. (eds.) Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, chapter 19, pp. 19.1–19.10. CRC Press (2004)

  10. 10.

    Cardei, M., Wu, J., Lu, M.: Improving network lifetime using sensors with adjustable sensing ranges. Int. J. Sens. Netw. 1(1/2), 41–49 (2006)

    Article  Google Scholar 

  11. 11.

    Cardei, M., Wu, J., Lu, M., Pervaiz, M.O.: Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, vol. 3, pp. 438–445 (2005)

  12. 12.

    Chambers, E.W., Fekete, S.P., Hoffmann, H., Marinakis, D., Mitchell, J.S.B., Srinivasan, V., Stege, U., Whitesides, S.: Connecting a set of circles with minimum sum of radii. In: 12th International Symposium on Algorithms and Data Structures, Volume 6844 of Lecture Notes in Computer Science, pp. 183–194 (2011)

  13. 13.

    Gibson, M., Varadarajan, K.R.: Optimally decomposing coverings with translates of a convex polygon. Discrete Comput. Geom. 46(2), 313–333 (2011)

    MathSciNet  Article  MATH  Google Scholar 

  14. 14.

    Kumar, S., Lai, T.-H., Arora, A.: Barrier coverage with wireless sensors. Wirel. Netw. 13(6), 817–834 (2007)

    Article  Google Scholar 

  15. 15.

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

    Article  MATH  Google Scholar 

  16. 16.

    Pach, J.: Covering the plane with convex polygons. Discrete Comput. Geom. 1(1), 73–81 (1986)

    MathSciNet  Article  MATH  Google Scholar 

  17. 17.

    Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. Comput. Geom. Theory Appl. 42(2), 127–133 (2009)

    MathSciNet  Article  MATH  Google Scholar 

  18. 18.

    Perillo, M.A., Heinzelman, W.B.: Optimal sensor management under energy and reliability constraints. In: IEEE Wireless Communications and Networking, pp. 1621–1626 (2003)

  19. 19.

    Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier coverage with line-based deployed mobile sensors. Ad Hoc Netw. 11(4), 1381–1391 (2013)

    Article  Google Scholar 

  20. 20.

    Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE International Conference on Communications, pp. 472–476 (2001)

  21. 21.

    Taniguchi, Y., Kitani, T., Leibnitz, K.: A uniform airdrop deployment method for large-scale wireless sensor networks. Int. J. Sens. Netw. 9(3/4), 182–191 (2011)

    Article  Google Scholar 

  22. 22.

    Wang, L., Xiao, Y.: A survey of energy-efficient scheduling mechanisms in sensor networks. Mob. Netw. Appl. 11(5), 723–740 (2006)

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Dror Rawitz.

Additional information

Amotz Bar-Noy: Supported in part by the CUNY Institute for Computer Simulation, Stochastic Modeling and Optimization (CoSSMO).

Dror Rawitz: Supported in part by the Israel Science Foundation (Grant No. 497/14).

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Bar-Noy, A., Baumer, B. & Rawitz, D. Set It and Forget It: Approximating the Set Once Strip Cover Problem. Algorithmica 79, 368–386 (2017). https://doi.org/10.1007/s00453-016-0198-8

Download citation

Keywords

  • Wireless sensor networks
  • Strip cover
  • Barrier coverage
  • Network lifetime