A perfectly stable contention access scheme for wireless access networks

Maria C. Yuang*, B. C. Lo, J. Y. Chen

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

Existing TDM-based contention access schemes exhibit the unstable or load-susceptible problem in which throughput exponentially deteriorates as the traffic offered load increases or fluctuates. In this paper, we propose a persistently stable, efficient Hexanary-Feedback-based Contention Access (HFCA) scheme, aiming to provide QoS guarantee while retaining stable and maximal network throughput. Unlike existing schemes that consider all contending mobile terminals as a whole, HFCA incrementally resolves a small group of terminals each time via a two-phase selection/resolution process. The incremental resolution repeats until the minimum non-blocking probability (QoS for signaling traffic) is satisfied. To accelerate resolution within the process, the number of simultaneously transmitting terminals is estimated based on an Envelope-pdf-based Estimator (EPER), by matching the corresponding normalized envelope histogram of the receiving signal with the priori envelope-pdf library. Facilitated with incremental resolution and the EPER, HFCA achieves the highest maximum throughput (0.574) and saturated throughput (0.52) reported to date irrespective of traffic increase and variation.

Original languageEnglish
Pages (from-to)2163-2167
Number of pages5
JournalIEEE Vehicular Technology Conference
Volume4
Issue number54ND
DOIs
StatePublished - 1 Jan 2001
EventIEEE 54th Vehicular Technology Conference (VTC FALL 2001) - Atlantic City, NJ, United States
Duration: 7 Oct 200111 Oct 2001

Fingerprint Dive into the research topics of 'A perfectly stable contention access scheme for wireless access networks'. Together they form a unique fingerprint.

Cite this