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

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 s...

Full description

Saved in:
Bibliographic Details
Main Author: Abu-Amara, M.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Base stations
Computer networks
Control systems
Equipments and installations
Exact sciences and technology
Iterative algorithms
Minerals
Mobile radiocommunication systems
Multiaccess communication
Petroleum
Radiocommunications
Systems, networks and services of telecommunications
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Teletraffic
Transceivers
Transmission and modulation (techniques and equipments)
Transmitters. Receivers
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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(n/sup 4/) running time, where n is the number of BTSs in the wireless network.
DOI:10.1109/RAWCON.2004.1389068