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

(2004) Minimum traffic inter-BS SHO boundary selection algorithm for CDMA-based wireless networks. Radio and Wireless Conference, 2004 IEEE, 1.

[img]
Preview
PDF
14702_1.pdf

Download (18kB) | Preview
[img] Microsoft Word
14702_2.doc

Download (26kB)

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(n/sup 4/) running time, where n is the number of BTSs in the wireless network.

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: Mr. Admin Admin
Date Deposited: 24 Jun 2008 13:46
Last Modified: 01 Nov 2019 14:07
URI: https://eprints.kfupm.edu.sa/id/eprint/14702