article · 2001

Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel

Cited by 1Abstract and details only

Abstract

This paper studies the tree based contention resolution algorithm over a random multi access channel, and proposes a new algorithm model which is named Improved Ternary tree Algorithm( ITA ). The channel throughput over blocked access reaches 0 422. The analytical expression and computer simulation results indicate that the performance of ITA is better than the basic binary and ternary tree algorithm.

Cite this paper

APA 7

Gao, F. (2001). Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel.

MLA 9

Gao, Fei. “Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel.” 2001.

Chicago

Gao, Fei. 2001. “Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel.”

Harvard

Gao, F. (2001) ‘Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel’.

BibTeX

@article{gao2001improved,
  title = {{Improved Ternary-tree Algorithm for Contention Resolution over Random Multi-access Channel}},
  author = {Gao, Fei},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.