首页> 外文会议>Ubiquitous and Future Networks, 2009. ICUFN 2009 >An efficient call delivery algorithm in hierarchical cellular networks
【24h】

An efficient call delivery algorithm in hierarchical cellular networks

机译:分层蜂窝网络中的高效呼叫传递算法

获取原文

摘要

The multiple registration scheme can reduce the location update cost in hierarchical cellular networks; however, it leads to the increased call setup latency to find out the current location of a mobile terminal. In this paper, we propose an efficient call delivery algorithm that employs a timer estimating the low-tier cell residence time. Analytical and simulation results demonstrate that the proposed algorithm outperforms high-tier cell first and low-tier cell first algorithms in terms of call setup latency.
机译:多重注册方案可以减少分层蜂窝网络中的位置更新成本。然而,这导致增加了呼叫建立等待时间以找出移动终端的当前位置。在本文中,我们提出了一种有效的呼叫传递算法,该算法采用计时器来估计低层单元的驻留时间。分析和模拟结果表明,在呼叫建立等待时间方面,该算法优于高层小区优先算法和底层小区优先算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号