• DocumentCode
    1935878
  • Title

    Random multiple access in q-ary disjunctive channel

  • Author

    Pustovalov, Eugeny ; Turlikov, Andrey

  • Author_Institution
    St.-Petersburg State Univ. of Aerosp. Instrum., St. Petersburg, Russia
  • fYear
    2012
  • fDate
    5-10 Sept. 2012
  • Firstpage
    65
  • Lastpage
    69
  • Abstract
    Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.
  • Keywords
    multi-access systems; RMA; channel property; q-ary disjunctive channel; random multiple access; retransmission reduction; splitting algorithm; Vectors; Random multiple access; channel without intensity information; maximal stable throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Problems of Redundancy in Information and Control Systems (RED), 2012 XIII International Symposium on
  • Conference_Location
    St. Petersburg
  • Print_ISBN
    978-1-4673-0168-8
  • Type

    conf

  • DOI
    10.1109/RED.2012.6338410
  • Filename
    6338410
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1935878