Skip to main content
SpringerLink
Log in

Conflict-resolving tree algorithm stable to incomplete interference damping

  • Queueing Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration was given to an approach uniting the tree algorithm to resolve conflicts at the channel level of a multisite communication system with the procedure for successive cancelation of interference at the physical level. Proposed was a unit-memory algorithm which is stable to incomplete interference cancelation within the framework of the classical model of multiple access with the infinite number of subscribers. A simple procedure of speed calculation which is applicable to the class of the tree algorithms featuring successive interference cancelation was demonstrated by the example of its analysis. The proposed algorithm may be used as an alternative to the scheme of resolution of conflicts for the channel resource defined in the IEEE 802.16 standard.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bertsekas, D. and Gallager, R., Data Networks, Englewood Cliffs: Prentice Hall, 1987. Translated under the title Seti peredachi dannykh, Moscow: Mir, 1989.

    Google Scholar 

  2. Rom, R. and Sidi, M., Multiple Access Protocols: Performance and Analysis, New York: Springer, 1990.

    MATH  Google Scholar 

  3. Abramson, N., The Aloha System—Another Alternative for Computer Communications, Proc. AFIPS Conf., 1970, vol. 36, pp. 295–298.

    Google Scholar 

  4. Tsybakov, B.S. and Mikhailov, V.A., Free Synchronous Access of Packets to a Broadcast Feedabck Channel, Probl. Peredachi Inf., 1978, vol. 14, no. 4, pp. 32–59.

    MathSciNet  MATH  Google Scholar 

  5. Capetanakis, J.I., Tree Algorithms for Packet Broadcast Channels, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 4, pp. 505–515.

    Article  MathSciNet  MATH  Google Scholar 

  6. Pedersen, K.I., Kolding, T.E., Seskar, I., and Holtzman, J.M., Practical Implementation of Successive Interference Cancellation in DS/CDMA Systems, Proc. Int. Conf. Universal Personal Commun., 1996, pp. 321–325.

  7. Andrews, J., Analysis of Cancellation Error for Successive Interference Cancellation with Imperfect Channel Estimation, in Multiuser Wireless Commun., 2002, pp. 1–17.

  8. Agrawal, A., Andrews, J.G., Cioffi, J.M., and Meng, T., Iterative Power Control for Imperfect Successive Interference Cancellation, IEEE Trans. Wireless Commun., 2005, vol. 4, pp. 878–884.

    Article  Google Scholar 

  9. Weber, S., Andrews, J.G., Yang, X., and Veciana, G.D., Transmission Capacity of Wireless ad hoc Networks with Successive Interference Cancellation, IEEE Trans. Inform. Theory, 2007, vol. 53, pp. 2799–2814.

    Article  MathSciNet  Google Scholar 

  10. IEEE Std 802.16e-2005, Piscataway, New Jersey, USA, December 2005.

  11. Yu, Y., SICTA: A 0.693 Contention Tree Algorithm Using Successive Interference Cancellation, Proc. IEEE Conf. Comput. Commun., 2005, vol. 3, pp. 1908–1916.

    Google Scholar 

  12. Yu, Y. and Giannakis, G.B., High-throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm, IEEE Trans. Inform. Theory, 2007, vol. 53, no. 12, pp. 4628–4639.

    Article  MathSciNet  Google Scholar 

  13. Wang, X., Yu, Y., and Giannakis, G.B., Combining Random Backoff with a Cross-layer Tree Algorithm for Random Access in IEEE 802.16, Proc. IEEE Wireless Commun. Networking Conf., 2006, vol. 2, pp. 972–977.

    Google Scholar 

  14. Wang, X., Yu, Y., and Giannakis, G.B., A Deadlock-free High-throughput Tree Algorithm for Random Access over Fading Channels, Proc. Conf. Inform. Sci. Syst., 2006, vol. 22, pp. 420–425.

    Google Scholar 

  15. Peeters, G.T., Houdt, B.V., and Blondia, C., A Multiaccess Tree Algorithm with Free Access, Interference Cancellation and Single Signal Memory Requirements, Performance Evaluat., 2007, vol. 64, no. 9–12, pp. 1041–1052.

    Article  Google Scholar 

  16. Houdt, B.V. and Peeters, G.T., FCFS Tree Algorithms with Interference Cancellation and Single Signal Memory Requirements, Proc. Int. Workshop on Multiple Access Commun., 2008, vol. 1, pp. 1–6.

    Google Scholar 

  17. Evseev, G.S. and Tyurlikov, A.M., Interrelation of the Characteristics of the Blocked Stack Algorithms of Random Multiple Access, Probl. Peredachi Inf., 2007, vol. 43, no. 4, pp. 83–92.

    MathSciNet  Google Scholar 

  18. Massey, J.L., Collision Resolution Algorithm and Random Access Communications, in Multiuser Commun. Syst. G., Longo: CISM Course and Lecture Notes, 1981, pp. 73–131.

  19. Tsybakov, B.S. and Mikhailov, V.A., Random Multiple Packet Access. Fracturing Algorithm, Probl. Peredachi Inf., 1980, vol. 16, no. 4, pp. 65–79.

    MathSciNet  MATH  Google Scholar 

  20. Gyorfi, L., Gyori, S., and Massey, J.L., Principles of Stability Analysis for Random Accessing with Feedback, Proc. NATO Security Through Sci., Ser. Inform. Commun. Security, 2007, vol. 10, pp. 214–250.

    Google Scholar 

  21. Szpankowski, W., Average Case Analysis of Algorithms on Sequences, New York: Wiley, 2001.

    MATH  Google Scholar 

  22. Mikhailov, V.A., On a Recurrent Equation in the Theory of Random Multiple Access, IX Symp. Inf. Redundancy in Inform. Systems, 1986, vol. 2, pp. 148–150.

    Google Scholar 

  23. Gyorfi, L. and Gyori, S., Analysis of Tree Algorithm for Collision Resolution, Proc. Int. Conf. Anal. Algorithms, 2005, pp. 357–364.

  24. Andreev, S., Pustovalov, E., and Turlikov, A., SICTA Modifications with Single Memory Location and Resistant to Cancellation Errors, Proc. Int. Conf. Next Generation Teletraffic and Wired/Wireless Advanced Networking, 2008, pp. 13–24.

  25. Andreev, S., Pustovalov, E., and Turlikov, A., Tree Algorithms with Free Access and Interference Cancellation in Presence of Cancellation Errors, Proc. Int. Symp. Wireless Personal Multimedia Commun., 2008, vol. 1, pp. 1–5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State University of Aerospace Instrumentation, St. Petersburg, Russia

    S. D. Andreev, E. M. Pustovalov & A. M. Tyurlikov

Authors
  1. S. D. Andreev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. M. Pustovalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. M. Tyurlikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © S.D. Andreev, E.M. Pustovalov, A.M. Tyurlikov, 2009, published in Avtomatika i Telemekhanika, 2009, No. 3, pp. 78–96.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andreev, S.D., Pustovalov, E.M. & Tyurlikov, A.M. Conflict-resolving tree algorithm stable to incomplete interference damping. Autom Remote Control 70, 417–433 (2009). https://doi.org/10.1134/S0005117909030084

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117909030084

PACS numbers

Search

Navigation