Channel allocation algorithms for three-tier wireless local loops

Xiao Yang, Du Xiaojiang, Zhang Xihui, Zhang Jingyuan

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

Abstract

A three-tier wireless local loop (WLL) extends the single-tier or two-tier WLL, and it is capable of accommodating more subscribers. This paper presents and analyzes channel allocation algorithms for a three-tier WLL. These algorithms include no repacking (NR), always repacking (AR), Repacking on Demand - Random (RoDR), Repacking on Demand - Least Load (RoDL), and Repacking on Demand - Subscriber Terminal (RoDST), depending on how repacking candidates are handled. Blocking probability and handoff probability are compared among all these channel assignment algorithms by simulations. It is shown that given the same set of simulation parameters, NR has the highest blocking probability, AR has the lowest blocking probability, and RoD has a blocking probability that falls in between. Compared with NR, both AR and RoD reduce the block probability at cost of a high handoff probability. Among RoDR, RoDL, and RoDST, RoDST has the lowest blocking probability but the highest handoff probability.

Original languageEnglish
Title of host publicationIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
DOIs
StatePublished - 2006
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: 27 Nov 20061 Dec 2006

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Conference

ConferenceIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Country/TerritoryUnited States
CitySan Francisco, CA
Period27/11/061/12/06

Keywords

  • Channel allocation
  • Channel repacking
  • Component
  • Wireless local loop

Fingerprint

Dive into the research topics of 'Channel allocation algorithms for three-tier wireless local loops'. Together they form a unique fingerprint.

Cite this