Authorization probability for adaptive traffic load in Saloha under the infinite population model

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper a throughput analysis for an infinite population model for a slotted ALOHA random access protocol to be used in the registration phase in a cellular system is presented. System performance of the system is evaluated for different retransmission policies for high traffic loads using an authorization probability for the Adaptive Traffic Load (ATL) protocol. In this paper we present results using a Poisson arrival process, more suitable for the traffic model in a cellular system for the users in the cell, where these users generate a finite number of packets as it would happen in a real network, and also maintain a constant average traffic load instead of considering all nodes in a retransmission mode. Under these conditions it can be found the retransmission probability for every node in order to maintain the system throughput stable. We study three of the most common backoff algorithms, UB, BEB and GB.

Original languageEnglish
Title of host publicationProceedings of the 5th IASTED International Conference on Communication Systems and Networks, CSN 2006
Pages254-259
Number of pages6
StatePublished - 2006
Event5th IASTED International Conference on Communication Systems and Networks, CSN 2006 - Palma de Mallorca, Spain
Duration: 28 Aug 200630 Aug 2006

Publication series

NameProceedings of the 5th IASTED International Conference on Communication Systems and Networks, CSN 2006

Conference

Conference5th IASTED International Conference on Communication Systems and Networks, CSN 2006
Country/TerritorySpain
CityPalma de Mallorca
Period28/08/0630/08/06

Keywords

  • ATL
  • Backoff
  • S-ALOHA
  • Throughout analysis

Fingerprint

Dive into the research topics of 'Authorization probability for adaptive traffic load in Saloha under the infinite population model'. Together they form a unique fingerprint.

Cite this