Analysis of a stack algorithm for random multiple-access communication

Authors:
G. Fayolle;P. Flajolet;M. Hofri;P. Jacquet
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Energy efficiency of collision resolution protocols

Computer Communications
Scale-free, self-organizing very large sensor networks

Journal of Parallel and Distributed Computing
Renewal theory in the analysis of tries and strings

Theoretical Computer Science
A branching process approach to compute the delay and energy efficiency of tree algorithms with free access

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	754.84

Visualization

Abstract

An exact analysis is given of the main parameters that characterize the properties of the Capetanakis-Tsybakov-Mikhailov collision resolution algorithm with the free-access (continuous input) protocol. In particular, the distributions of the collision resolution interval, the delay experienced by a packet, and the state of the top level of the stack that is maintained by the algorithm are determined.