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

Authors:
R. Block;G. T. Peeters;B. Van Houdt
Affiliations:
-;-;-
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2014

Citing 10
Cited 0

Data networks

Data networks
A multiaccess tree algorithm with free access, interference cancellation and single signal memory requirements

Performance Evaluation
Energy efficiency of collision resolution protocols

Computer Communications
On the maximum stable throughput of tree algorithms with free access

IEEE Transactions on Information Theory
Information theory and communication networks: an unconsummated union

IEEE Transactions on Information Theory
Analysis of a stack algorithm for CSMA-CD random length packet communication

IEEE Transactions on Information Theory
Tree algorithms for packet broadcast channels

IEEE Transactions on Information Theory
-ary collision resolution algorithms in random-access systems with free or blocked channel access

IEEE Transactions on Information Theory
Analysis of a stack algorithm for random multiple-access communication

IEEE Transactions on Information Theory
High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a branching process approach to determine the main performance measures of a variety of conflict resolution algorithms known as tree algorithms with free access. In particular we present an efficient approach to calculate the mean delay, number of transmission attempts, collision resolution interval length and energy usage with arbitrary precision.