首页> 外文会议>Radio and Wireless Conference, 2004 >Minimum traffic inter-BS SHO boundary selection algorithm for CDMA-based wireless networks
【24h】

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

机译:用于基于CDMA的无线网络的最小流量BS间SHO边界选择算法

获取原文

摘要

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.
机译:提出了一种算法,用于为基于码分多址(CDMA)的无线网络选择基站间软切换(inter-BS SHO)边界。选定的BS间SHO边界将基站收发信机系统(BTS)均等地划分到两个BS上,并通过使跨边界的流量最小化来减少支持BS间SHO所需的链路量。该算法的运行时间为O(n 4 ),其中n是无线网络中BTS的数量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号