Skip to main content
SpringerLink
Log in

Maximizing Throughput in Energy-Harvesting Sensor Nodes

  • Conference paper
  • First Online:
Book cover Algorithms for Sensor Systems (ALGOSENSORS 2015)

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

Abstract

We consider an online throughput maximization problem in sensor nodes that can harvest energy. The sensor nodes generate and forward packets, which cost energy; they can also harvest energy from the environment, but the amount of energy that can be harvested is not known in advance. We give a number of algorithms and lower bounds for the case of a single node. We consider both the general case and some types of ‘non-idling’ adversaries where we can get better bounds. We also consider the case of networks with multiple nodes and demonstrate that some very simple scenarios already admit no competitive algorithms.

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

Notes

  1. 1.

    In [12] it was stated that the greedy algorithm is 2-competitive against non-idling adversaries, apparently as a corollary from [7] which is about UJS. However our problem is not a special case of UJS, even for strongly non-idling adversaries. We give a separate 2-competitive proof, both because of this and because of the difference in the (strongly) non-idling definitions.

References

  1. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)

    MATH  Google Scholar 

  2. Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2), 255–276 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values: does timesharing or randomization help? Algorithmica 37(3), 149–164 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in quality of service switches. SIAM J. Comput. 41(5), 1166–1192 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goldwasser, M.H.: A survey of buffer management policies for packet switches. SIGACT News 45(1), 100–128 (2010)

    Article  Google Scholar 

  6. Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of 35th Annual Conference on Information Sciences and Systems, pp. 434–438 (2001)

    Google Scholar 

  7. Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM J. Comput. 33(3), 563–583 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lei, J., Yates, R., Greenstein, L.: A generic model for optimizing single-hop transmission policy of replenishable sensors. IEEE Trans. Wirel. Commun. 8(2), 547–551 (2009)

    Article  Google Scholar 

  9. Li, F.: Personal communication (2014)

    Google Scholar 

  10. Mao, Z., Koksal, C.E., Shroff, N.S.: Optimal online scheduling with arbitrary hard deadlines in multihop communication networks. In: Proceedings of IEEE INFOCOM, pp. 2463–2471 (2013)

    Google Scholar 

  11. Moser, C., Brunelli, D., Thiele, L., Benini, L.: Real-time scheduling for energy harvesting sensor nodes. Real-Time Syst. 37, 233–260 (2007)

    Article  MATH  Google Scholar 

  12. Wang, H., Zhang, J.X., Li, F.: Worst-case performance guarantees of scheduling algorithms maximizing weighted throughput in energy-harvesting networks. Sustainable Comput.: Inform. Syst. 4, 172–182 (2014)

    Google Scholar 

  13. Wang, H., Zhang, J.X., Li, F.: Corrigendum to worst-case performance guarantees of scheduling algorithms maximizing weighted throughput in energy-harvesting networks. Sustain. Comput.: Inf. Syst. 5, 64 (2015)

    Google Scholar 

  14. Zhu, A.: Analysis of queueing policies in QoS switches. J. Algorithms 53, 137–168 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Leicester, Leicester, UK

    Stanley P. Y. Fung

Authors
  1. Stanley P. Y. Fung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stanley P. Y. Fung .

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Ontario, Canada

    Prosenjit Bose

  2. University of Liverpool, Liverpool, United Kingdom

    Leszek Antoni Gąsieniec

  3. Graz University of Technology, Graz, Austria

    Kay Römer

  4. ETH Zurich, Zürich, Switzerland

    Roger Wattenhofer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Fung, S.P.Y. (2015). Maximizing Throughput in Energy-Harvesting Sensor Nodes. In: Bose, P., Gąsieniec, L., Römer, K., Wattenhofer, R. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2015. Lecture Notes in Computer Science(), vol 9536. Springer, Cham. https://doi.org/10.1007/978-3-319-28472-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28472-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28471-2

  • Online ISBN: 978-3-319-28472-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation