Random Multiple Access Method for Wire and Wireless Local Networks

Proceedings of 17th International Conference on Computer Theory and Applications (ICCTA2007) 2007
Valerijs Zagurskis, Dzintars Zibiņ

Combinatorial and probability-theory methods are employed to analyze the random multiple access method using Bernoulli scheme for resolving conflicts (collisions in transmission). The technique for determining the length of each particular process is described; the average lengths of the processes are established for specified number of parties in conflict, as is the time loss involved in Implementing the given access method. Upper and lower bounds for the length of the processes are obtained.

Keywords
Index Term –Computer networks, Random multiple access method, Bernoulli scheme,

Zagurskis, V., Zibiņ, D. Random Multiple Access Method for Wire and Wireless Local Networks. In: Proceedings of 17th International Conference on Computer Theory and Applications (ICCTA2007), Egypt, Alexandria, 1-3 September, 2007. Alexandria: Egipte Academy of Sciences, University of Alexandria, 2007, pp.173-178.

Publication language
English (en)