Submit Manuscript

Information Technology Journal

Year: 2011 | Volume: 10 | Issue: 2 | Page No.: 231-238
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 1086

Search

Authors

Xihui Zhang

Yingping Huang

John Crabtree

Xiang Li

Keywords

Review Article

A Survey of Channel Allocation Algorithms for Wireless Local Loops

Xihui Zhang, Yingping Huang, John Crabtree and Xiang Li
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.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *