This article is cited in 3 papers

Communication Network Theory

On ergodic algorithms in random multiple access systems with “success-failure” feedback

A. M. Turlikov^a, S. G. Foss<sup>bc

a</sup> Saint-Petersburg State University of Aerospace Instrumentation
^b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
^c Heriot Watt University, Edinburgh, United Kingdom

Abstract: We consider a decentralized multiple access system with a binary “success-failure” feedback. We introduce a family of algorithms (protocols) called “algorithms with delayed intervals” and study stability conditions of one of them. Then we discuss some numerical results and a number of related and interesting problems and hypotheses.

UDC: 621.394.74+519.7

Received: 27.08.2009
Revised: 15.02.2010

 English version: Problems of Information Transmission, 2010, 46:2, 184–200

Bibliographic databases:

• 
• 
•