A survey of channel allocation algorithms for wireless local loops

  • Xihui Zhang*
  • , Yingping Huang
  • , John Crabtree
  • , Xiang Li
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A Wireless Local Loop (WLL) uses radio signals to connect customer premise equipment to a local exchange on the public switched telephone network. Compared to wireline local loops, WLLs are easier to deploy and less costly to maintain. As such, WLLs have the potential to help telephony providers overcome the "last mile" problem in delivering telephony services. One of the most important considerations in deploying WLLs is to determine the best channel allocation algorithm. Numerous channel allocation algorithms exist, including no repacking, always repacking and repacking on demand. This study provides an overview of channel allocation algorithms for WLLs, using a decision-tree approach. It also reviews related studies and recommends several future research directions. The algorithm overview and research review can help Information Systems (IS) and Computer Science (CS) researchers as well as practitioners gain a solid understanding of these channel allocation algorithms. The recommended research directions can serve to guide interested IS and CS researchers in future research.

Original languageEnglish
Pages (from-to)231-238
Number of pages8
JournalInformation Technology Journal
Volume10
Issue number2
DOIs
StatePublished - 2011

Keywords

  • Call overflow and repacking
  • Channel allocation algorithm
  • Decision-tree
  • Wireless local loop

Fingerprint

Dive into the research topics of 'A survey of channel allocation algorithms for wireless local loops'. Together they form a unique fingerprint.

Cite this