Interleaving collision resolution engines in n-ary tree protocols

Wei Ming Yin*, Ying-Dar Lin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

N-ary tree protocols are used for access control on shared channels to resolve collisions among channel users. For exercising a single collision resolution engine (CRE), throughput and latency of such protocols have been comprehensively studied. This study investigates the same protocols with multiple interleaved CREs in slotted networks. Power, defined as the ratio of throughput over latency, is measured as the criteria to launch or terminate CREs. Analysis results indicate that the appropriate number of CREs to trigger depends on the traffic load and the collision resolution protocol. As the load grows to 0.25, 0.35, 0.5, and 0.8, the optimal number of interleaved CREs becomes 2, 3, 5, and 8, respectively. Moreover, the power of n-ary tree protocol with n determined dynamically outperforms the 3-ary tree protocol by 13%.

Original languageEnglish
Pages (from-to)494-496
Number of pages3
JournalIEEE Communications Letters
Volume5
Issue number12
DOIs
StatePublished - 1 Dec 2001

Keywords

  • Collision resolution engine
  • Interleaving
  • n-ary tree

Fingerprint Dive into the research topics of 'Interleaving collision resolution engines in n-ary tree protocols'. Together they form a unique fingerprint.

Cite this