Skip to main content

2017 | OriginalPaper | Buchkapitel

Maximizing Barrier Coverage Lifetime with Static Sensors

verfasst von : Menachem Poss, Dror Rawitz

Erschienen in: Algorithms for Sensor Systems

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We study variants of the Strip Cover problem (SC) in which sensors with limited battery power are deployed on a line barrier, and the goal is to cover the barrier as long as possible. The energy consumption of a sensor depends on its sensing radius: energy is drained in inverse proportion to the sensor radius raised to a constant exponent \(\alpha \ge 1\). In the Set Once Strip Cover (OnceSC) the radius of each sensor can be set once, and the sensor can be activated at any time. \(\textsc {SC} _k\) and \(\textsc {OnceSC} _k\) are variants of SC and OnceSC, resp., in which each sensor is associated with a set of at most k predetermined radii.
It was previously known that OnceSC is NP-hard when \(\alpha = 1\), and the complexity of the case where \(\alpha >1\) remained open. We extend the above mentioned NP-hardness result in two ways: we show that OnceSC is NP-hard for every \(\alpha > 1\) and that OnceSC is strongly NP-hard for \(\alpha = 1\). In addition, we show that \(\textsc {OnceSC} _k\), for \(k \ge 2\), is NP-hard, for any \(\alpha \ge 1\), even for uniform radii sets. On the positive side, we present (i) a \(5\gamma ^\alpha \)-approximation algorithm for \(\textsc {OnceSC} _k\), for \(k \ge 1\), where \(\gamma \) is the maximum ratio between two radii associated with the same sensor; (ii) a 5-approximation algorithm for \(\textsc {SC} _k\), for every \(k \ge 1\); and (iii) a \(5 \cdot 2^\alpha \)-approximation algorithm for Strip Cover. Finally, we present an \(O(n \log n)\)-time algorithm for a variant of \(\textsc {OnceSC} _k\) in which all sensors must be activated at the same time.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Bar-Noy, A., Baumer, B.: Average case network lifetime on an interval with adjustable sensing ranges. Algorithmica 72(1), 148–166 (2015)MathSciNetCrossRefMATH Bar-Noy, A., Baumer, B.: Average case network lifetime on an interval with adjustable sensing ranges. Algorithmica 72(1), 148–166 (2015)MathSciNetCrossRefMATH
2.
Zurück zum Zitat Bar-Noy, A., Baumer, B., Rawitz, D.: Brief announcement: set it and forget it - approximating the set once strip cover problem. In: 25th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 105–107 (2013). To appear in Algorithmica Bar-Noy, A., Baumer, B., Rawitz, D.: Brief announcement: set it and forget it - approximating the set once strip cover problem. In: 25th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 105–107 (2013). To appear in Algorithmica
3.
Zurück zum Zitat 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) 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)
4.
Zurück zum Zitat Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. Technical report arXiv:cs/0605102v1, CoRR (2008) Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. Technical report arXiv:​cs/​0605102v1, CoRR (2008)
5.
Zurück zum Zitat Fan, H., Li, M., Sun, X., Wan, P., Zhao, Y.: Barrier coverage by sensors with adjustable ranges. ACM Trans. Sens. Netw. 11(1), 14:1–14:20 (2014)CrossRef Fan, H., Li, M., Sun, X., Wan, P., Zhao, Y.: Barrier coverage by sensors with adjustable ranges. ACM Trans. Sens. Netw. 11(1), 14:1–14:20 (2014)CrossRef
6.
Zurück zum Zitat Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)MATH Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)MATH
7.
Zurück zum Zitat Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 159–168 (2009) Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 159–168 (2009)
8.
Zurück zum Zitat Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489–501 (2005)CrossRefMATH Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489–501 (2005)CrossRefMATH
9.
Zurück zum Zitat Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: the scheduling complexity of arbitrary topologies. In: 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 310–321 (2006) Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: the scheduling complexity of arbitrary topologies. In: 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 310–321 (2006)
10.
Zurück zum Zitat Wan, P.-J., Chen, D., Dai, G., Wang, Z., Yao, F.F.: Maximizing capacity with power control under physical interference model in duplex mode. In: 31st Annual IEEE International Conference on Computer Communications, pp. 415–423 (2012) Wan, P.-J., Chen, D., Dai, G., Wang, Z., Yao, F.F.: Maximizing capacity with power control under physical interference model in duplex mode. In: 31st Annual IEEE International Conference on Computer Communications, pp. 415–423 (2012)
Metadaten
Titel
Maximizing Barrier Coverage Lifetime with Static Sensors
verfasst von
Menachem Poss
Dror Rawitz
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-72751-6_15