Skip to main content

Backoff Algorithms Performance in Burst-Like Traffic

  • Conference paper
Energy-Aware Communications (EUNICE 2011)

Abstract

In the present paper several backoff algorithms are considered to analysis their behavior in burst-like traffic of smart metering network: YITRAN, Binary Exponential and Polynomial backoff algorithms. The comparison was performed by means of transmission successfulness probability estimation using Markov chain models for each algorithm. The results of the calculation showed that YITRAN algorithm outperforms the other ones for almost all kinds of burst-like traffic. The developed software can be used to implement other backoff algorithms and perform their comparison. A novel backoff algorithm was developed, which is basing on the results the comparison.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tannenbaum, A.S.: Computer Networks, 4th edn., p. 891. Pearson Education International, Inc., Upper Saddle River (2003)

    Google Scholar 

  2. Raphaeli, D., Grauer, A.: A New Power-Line-Communicatiovts Modem based on a Novel Modulation Technique. Tel Aviv University, Israel, Itran Communications

    Google Scholar 

  3. Lee, J.-h., Park, J.-h., Lee, H.-S., Leett, G.-W., Kim, S.-c.: Measurement, modeling and simulation of power line channel for indoor high-speed data communications. School of Electrical and Computer Engineering, Seoul National University

    Google Scholar 

  4. Gazit, R., Avidan, A.: An Innovative Adaptive Channel Access Mechanism. In: ISPLC (2004)

    Google Scholar 

  5. Carron, G., Ness, R., Deneire, L., Van der Perre, L., Engels, M.: Comparison of two modulation techniques using frequency domain processing for in-house nerworks. In: Interuniversity Micro Electronics Center (IMEC) - Kapeldreef 75, 3001, Heverlee, Belgium,

    Google Scholar 

  6. Lee1, K.-R., Lee1, J.-M., Kwon1, W.-H., Ko2, B.-S., Kim, Y.-M.: Performance Evaluation of CSMA/CA MAC Protocol in low-speed PLC Environments. School of Electrical Engr. and Computer Science, Seoul National University

    Google Scholar 

  7. Xu, D., Sakurai, T.: An Analysis of Different backoff Functions for an IEEE 802.11 WLAN. Department of Electrical & Electronic Eng, The University of Melbourne

    Google Scholar 

  8. Grinstead and Shell’s Introduction to Probability. The CHANCE Project. American Mathematical Society, Providence (July 4, 2006)

    Google Scholar 

  9. Vu, H.L., Sakurai, T.: Collision Probability in Saturated IEEE 802.11 Networks. Centre for Advanced Internet Architectures (CAIA). ARC Special Research Centre for Ultra-Broadband Information Networks (CUBIN)

    Google Scholar 

  10. Microgrid, http://en.wikipedia.org/wiki/Distributed_generation#Microgrid

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsokalo, I., Yulia, Y., Mudriievskyi, S. (2011). Backoff Algorithms Performance in Burst-Like Traffic. In: Lehnert, R. (eds) Energy-Aware Communications. EUNICE 2011. Lecture Notes in Computer Science, vol 6955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23541-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23541-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23540-5

  • Online ISBN: 978-3-642-23541-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics