Minimum traffic inter-BS SHO boundary selection algorithm for CDMA-based wireless networks

  • Marwan Abu-Amara*
  • *Corresponding author for this work

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

Abstract

An algorithm is presented to select an inter-Base Station Soft Handoff (inter-BS SHO) boundary for Code Division Multiple Access (CDMA)-based wireless networks. The selected inter-BS SHO boundary splits Base Transceiver Systems (BTSs) equally over two BSs, and reduces the amount of links needed to support inter-BS SHO by minimizing the amount of traffic flow crossing the boundary. The algorithm has an O(n4) running time, where n is the number of BTSs in the wireless network.

Original languageEnglish
Title of host publicationProceedings - 2004 IEEE Radio and Wireless Conference, RAWCON
EditorsG. Heiter
Pages51-54
Number of pages4
StatePublished - 2004

Publication series

NameProceedings - 2004 IEEE Radio and Wireless Conference, RAWCON

Keywords

  • Boundary selection
  • CDMA
  • Inter-base station
  • Soft handoff
  • Wireless networks

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Minimum traffic inter-BS SHO boundary selection algorithm for CDMA-based wireless networks'. Together they form a unique fingerprint.

Cite this