CLASS OF EFFICIENT CONTENTION RESOLUTION ALGORITHMS FOR MULTIPLE ACCESS CHANNELS.

被引：0
|
作者：
Minkoff, John [1 ]
机构：
[1] MIT, Lab for Information &, Decision Systems, Cambridge, MA, USA, MIT, Lab for Information & Decision Systems, Cambridge, MA, USA
来源：
IEEE Transactions on Communications | 1985年 / COM-33卷 / 02期
关键词：
COMPUTER PROGRAMMING - Algorithms - DATA TRANSMISSION;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A discrete time multiaccess channel is considered where the outcome of a transmission is either 'idle,' 'success,' or 'collision,' depending on the number of users transmitting simultaneously. Messages involved in a 'collision' must be retransmitted. An efficient access allocation policy is developed for the case where infinitely many sources generate traffic in a Poisson manner and can all observe the outcomes of the previous transmissions. Its rate of success is 0. 48776. Modifications are presented for the cases where the transmission times depend on the transmission outcomes and where observations are noisy.
引用
收藏
页码：145 / 151
相关论文
共 50 条
  • [1] A CLASS OF EFFICIENT CONTENTION RESOLUTION ALGORITHMS FOR MULTIPLE ACCESS CHANNELS
    MOSELY, J
    HUMBLET, PA
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (02) : 145 - 151
  • [2] Unbounded Contention Resolution in Multiple-Access Channels
    Fernandez Anta, Antonio
    Mosteiro, Miguel A.
    Ramon Munoz, Jorge
    DISTRIBUTED COMPUTING, 2011, 6950 : 225 - +
  • [3] Unbounded Contention Resolution in Multiple-Access Channels
    Fernandez Anta, Antonio
    Mosteiro, Miguel A.
    Ramon Munoz, Jorge
    ALGORITHMICA, 2013, 67 (03) : 295 - 314
  • [4] Unbounded Contention Resolution in Multiple-Access Channels
    Antonio Fernández Anta
    Miguel A. Mosteiro
    Jorge Ramón Muñoz
    Algorithmica, 2013, 67 : 295 - 314
  • [5] ESTIMATING THE MULTIPLICITIES OF CONFLICTS TO SPEED THEIR RESOLUTION IN MULTIPLE ACCESS CHANNELS.
    Greenberg, Albert G.
    Flajolet, Philippe
    Ladner, Richard E.
    1600, (34):
  • [6] Brief Announcement: Unbounded Contention Resolution in Multiple-Access Channels
    Fernandez Anta, Antonio
    Mosteiro, Miguel A.
    Munoz, Jorge R.
    PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 211 - 212
  • [7] Strategic Contention Resolution in Multiple Channels
    Christodoulou, George
    Melissourgos, Themistoklis
    Spirakis, Paul G.
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018), 2018, 11312 : 165 - 180
  • [8] Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
    Fernandez Anta, Antonio
    Mosteiro, Miguel A.
    COMPUTING AND COMBINATORICS, 2010, 6196 : 378 - 388
  • [9] Contention Resolution on Multiple Channels with Collision Detection
    Fineman, Jeremy T.
    Newport, Calvin
    Wang, Tonghe
    PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'16), 2016, : 175 - 184
  • [10] CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
    Fernandez Anta, Antonio
    Mosteiro, Miguel A.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2010, 2 (04) : 445 - 456
12345