Skip to main content
SpringerLink
Log in

Approximating Sweep Coverage Delay

  • Conference paper
  • First Online:
Ubiquitous Networking (UNet 2018)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11277))

Included in the following conference series:

  • 771 Accesses

Abstract

We consider the following fundamental sweep coverage problem that arises in mobile wireless sensor networks: Given a set of k mobile sensors and a set of m points of interests (POIs) in the Euclidean plane, how to schedule the mobile sensors such that the maximum delay between two subsequent visits to a POI by any sensor is minimized. We study two scenarios of this problem: (i) start positions of the sensors are fixed such that they must return to their start positions between subsequent traversals to POIs that fall in their trajectories, and (ii) sensor positions are not fixed and they are not required to return to their start positions between subsequent traversals. Scenario (i) models battery-constrained sensors which need to be recharged frequently, whereas scenario (ii) models sensors that have no constraint on battery and hence frequent recharging is not necessary. We present two constant factor approximation algorithms for each scenario. The problem we consider is NP-hard and, to the best of our knowledge, these are the first algorithms with guaranteed approximation bounds for this problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bai, X., Xuan, D., Yun, Z., Lai, T.H., Jia, W.: Complete optimal deployment patterns for full-coverage and k-connectivity in wireless sensor networks. In: MobiHoc, pp. 401–410 (2008)

    Google Scholar 

  2. Batalin, M.A., Sukhatme, G.S.: Multi-robot dynamic coverage of a planar bounded environment. Technical report (2002)

    Google Scholar 

  3. Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: INFOCOM, pp. 1976–1984 (2005)

    Google Scholar 

  4. Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: MobiCom, pp. 63–74 (2007)

    Google Scholar 

  5. Chen, W., Chen, S., Li, D.: Minimum-delay pois coverage in mobile wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 2013, 262 (2013)

    Article  Google Scholar 

  6. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report (1976)

    Google Scholar 

  7. Ding, L., Wu, W., Willson, J., Wu, L., Lu, Z., Lee, W.: Constant-approximation for target coverage problem in wireless sensor networks. In: INFOCOM, pp. 1584–1592, March 2012

    Google Scholar 

  8. Even, G., Garg, N., KöNemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32(4), 309–315 (2004)

    Article  MathSciNet  Google Scholar 

  9. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. In: FOCS, pp. 216–227 (1976)

    Google Scholar 

  10. Gorain, B., Mandal, P.S.: Approximation algorithms for sweep coverage in wireless sensor networks. J. Parallel Distrib. Comput. 74(8), 2699–2707 (2014)

    Article  Google Scholar 

  11. Gorain, B., Mandal, P.S.: Line sweep coverage in wireless sensor networks. In: COMSNETS, pp. 1–6 (2014)

    Google Scholar 

  12. Hefeeda, M., Bagheri, M.: Randomized k-coverage algorithms for dense sensor networks. In: INFOCOM, pp. 2376–2380 (2007)

    Google Scholar 

  13. Howard, A., Mataric, M.J., Sukhatme, G.S.: Mobile sensor network deployment using potential fields: a distributed, scalable solution to the area coverage problem. In: Asama, H., Arai, T., Fukuda, T., Hasegawa, T. (eds.) Distributed Autonomic Robotic Systems 5, pp. 299–308. Springer, Tokyo (2002). https://doi.org/10.1007/978-4-431-65941-9_30

    Chapter  Google Scholar 

  14. Khani, M.R., Salavatipour, M.R.: Improved approximation algorithms for the min-max tree cover and bounded tree cover problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX/RANDOM -2011. LNCS, vol. 6845, pp. 302–314. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22935-0_26

    Chapter  MATH  Google Scholar 

  15. Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: MobiCom, pp. 284–298 (2005)

    Google Scholar 

  16. Kumar, S., Lai, T.H., Balogh, J.: On k-coverage in a mostly sleeping sensor network. In: MobiCom, pp. 144–158 (2004)

    Google Scholar 

  17. Li, D., Cao, J., Liu, M., Zheng, Y.: K-connected target coverage problem in wireless sensor networks. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 20–31. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73556-4_5

    Chapter  Google Scholar 

  18. Li, M., Cheng, W., Liu, K., He, Y., Li, X.Y., Liao, X.: Sweep coverage with mobile sensors. IEEE Trans. Mob. Comput. 10(11), 1534–1545 (2011)

    Article  Google Scholar 

  19. Liang, W., Lin, X.: Approximation algorithms for min-max cycle cover problems. IEEE Trans. Comput. 64(3), 600–613 (2014)

    MathSciNet  MATH  Google Scholar 

  20. Liu, B., Brass, P., Dousse, O., Nain, P., Towsley, D.: Mobility improves coverage of sensor networks. In: MobiHoc, pp. 300–308 (2005)

    Google Scholar 

  21. Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong barrier coverage of wireless sensor networks. In: MobiHoc, pp. 411–420 (2008)

    Google Scholar 

  22. Lu, X., Chen, S., Chen, W., Li, D.: Sweep coverage with mobile sensors on two-way road. In: Wang, R., Xiao, F. (eds.) CWSN 2012. CCIS, vol. 334, pp. 335–345. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36252-1_31

    Chapter  Google Scholar 

  23. 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 

  24. Wan, P.J., Yi, C.W.: Coverage by randomly deployed wireless sensor networks. IEEE/ACM Trans. Netw. 14(SI), 2658–2669 (2006)

    MathSciNet  MATH  Google Scholar 

  25. Wang, B.: Coverage problems in sensor networks: a survey. ACM Comput. Surv. 43(4), 32:1–32:53 (2011)

    Article  Google Scholar 

  26. Wang, D., Liu, J., Zhang, Q.: Probabilistic field coverage using a hybrid network of static and mobile sensors. In: IWQoS, pp. 56–64 (2007)

    Google Scholar 

  27. Wang, J.: Efficient point coverage in wireless sensor networks. J. Comb. Optim. 11, 291–304 (2006)

    Article  MathSciNet  Google Scholar 

  28. Wang, W., Srinivasan, V., Chua, K.-C.: Trade-offs between mobility and density for coverage in wireless sensor networks. In: MobiCom, pp. 39–50 (2007)

    Google Scholar 

  29. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: SenSys, pp. 28–39 (2003)

    Google Scholar 

  30. Xi, M., Wu, K., Qi, Y., Zhao, J., Liu, Y., Li, M.: Run to potential: sweep coverage in wireless sensor networks. In: ICPP, pp. 50–57 (2009)

    Google Scholar 

  31. Zhou, Z., Das, S., Gupta, H.: Connected k-coverage problem in sensor networks. In: ICCCN, pp. 373–378 (2004)

    Google Scholar 

  32. Zou, Y., Chakrabarty, K.: Sensor deployment and target localization based on virtual forces. In: INFOCOM (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kent State University, Kent, OH, 44242, USA

    Gokarna Sharma & Jong-Hoon Kim

Authors
  1. Gokarna Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jong-Hoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gokarna Sharma .

Editor information

Editors and Affiliations

  1. University of Carthage, Carthage, Tunisia

    Noureddine Boudriga

  2. King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

    Mohamed-Slim Alouini

  3. University of Carthage, Carthage, Tunisia

    Slim Rekhis

  4. Hassan II University, Casablanca, Morocco

    Essaid Sabir

  5. KU Leuven, Leuven, Belgium

    Sofie Pollin

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sharma, G., Kim, JH. (2018). Approximating Sweep Coverage Delay. In: Boudriga, N., Alouini, MS., Rekhis, S., Sabir, E., Pollin, S. (eds) Ubiquitous Networking. UNet 2018. Lecture Notes in Computer Science(), vol 11277. Springer, Cham. https://doi.org/10.1007/978-3-030-02849-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02849-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02848-0

  • Online ISBN: 978-3-030-02849-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation