Journal of Global Optimization

, Volume 56, Issue 2, pp 559–568 | Cite as

Maximum lifetime connected coverage with two active-phase sensors

  • Hongwei Du
  • Panos M. Pardalos
  • Weili Wu
  • Lidong Wu
Article

Abstract

A sensor with two active phrases means that active mode has two phases, the full-active phase and the semi-active phase, which require different energy consumptions. A full-active sensor can sense data packets, transmit, receive, and relay the data packets. A semi-active sensor cannot sense data packets, but it can transmit, receive, and relay data packets. Given a set of targets and a set of sensors with two active phrases, find a sleep/active schedule of sensors to maximize the time period during which active sensors form a connected coverage set. In this paper, this problem is showed to have polynomial-time \({(7.875+\varepsilon)}\)-approximations for any \({\varepsilon >0 }\) when all targets and sensors lie in the Euclidean plane and all sensors have the same sensing radius Rs and the same communication radius Rc with Rc ≥ 2Rs.

Keywords

Maximum lifetime Coverage Wireless sensor network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006), LNCS 4110, Springer, pp. 3–14 (2006)Google Scholar
  2. 2.
    Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: Proceedings of the FOCS, pp. 265–273 (1983)Google Scholar
  3. 3.
    Boginski, V.L., Commander, C.W., Pardalos, P.M., Ye, Y. (eds): Sensors: Theory, Algorithms, and Applications. Springer, Berlin (2012)Google Scholar
  4. 4.
    Du D.-Z., Ko K.-I., Hu X.: Design and Analysis of Approximation Algorithms, pp. 142–157. Springer, Berlin (2012)CrossRefGoogle Scholar
  5. 5.
    Du H., Wu W., Shan S., Kim D., Lee W.: Constructing weakly connected dominating set for secure clustering in distributed sensor network. J. Comb. Optim. 23, 301–307 (2012)CrossRefGoogle Scholar
  6. 6.
    Erlebach, T., Mihalk, M.: A \({(4 + \epsilon)}\)-approximation for the minimum-weight dominating set problem in unit disk graphs. WAOA, pp. 135–146 (2009)Google Scholar
  7. 7.
    Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flows and other fractional packing problems. In: Proceedings of the 39th Annual Symposium on the Foundations of Computer Science, pp. 300–309 (1998)Google Scholar
  8. 8.
    Hochbaum D.S., Maass W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130–136 (1985)CrossRefGoogle Scholar
  9. 9.
    Huang Y., Gao X., Zhang Z., Wu W.: A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim. 18, 174–194 (2009)CrossRefGoogle Scholar
  10. 10.
    Sorokin A., Boyko N., Boginski V., Uryasev S., Pardalos P.: Mathematical programming techniques for sensor networks. Algorithms 2, 565–581 (2009)CrossRefGoogle Scholar
  11. 11.
    Wang C., Willson J., Park M.A., Farago A., Wu W.: On dual power assignment optimization for biconnectivity. J. Comb. Optim. 19, 174–183 (2010)CrossRefGoogle Scholar
  12. 12.
    Wu W., Gao X., Pardalos P.M., Du D.-Z.: Wireless networking, dominating and packing. Optim. Lett. 4, 347–358 (2010)CrossRefGoogle Scholar
  13. 13.
    Yang Y., Cardei M.: Adaptive energy efficient sensor scheduling for wireless sensor networks. Optim. lett. 4(3), 359–369 (2010)CrossRefGoogle Scholar
  14. 14.
    Zhang H., Hou J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens. Wirel. Netw. 1, 89–124 (2005)Google Scholar
  15. 15.
    Zhang, Y., Li, W.: Modeling and energy consumption evaluation of a stochastic wireless sensor networks. (2011, preprint)Google Scholar
  16. 16.
    Zou F., Li X., Gao S., Wu W.: Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18, 342–349 (2009)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC. 2012

Authors and Affiliations

  • Hongwei Du
    • 1
  • Panos M. Pardalos
    • 2
    • 3
  • Weili Wu
    • 4
  • Lidong Wu
    • 4
  1. 1.Department of Computer Science and TechnologyHarbin Institute of Technology, Shenzhen Graduate SchoolShenzhenChina
  2. 2.Center for Applied Optimization, Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA
  3. 3.Laboratory of Algorithms and Technologies for Networks Analysis (LATNA)National Research University, Higher School of EconomicsMoscowRussia
  4. 4.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA

Personalised recommendations