首页> 外文会议>Grid and pervasive computing >An Optimal Radio Access Network Selection Method for Heterogeneous Wireless Networks
【24h】

An Optimal Radio Access Network Selection Method for Heterogeneous Wireless Networks

机译:异构无线网络的最优无线接入网选择方法

获取原文
获取原文并翻译 | 示例

摘要

In Heterogeneous Wireless Networks (HetNets), different overlapped Radio Access Networks (RANs) can coexist with each other in the same geographical area with the goal to provide high rates pervasive access for mobile users via multi-mode terminals. This paper addresses the problem of initial RAN selection in HetNets with two co-located wireless networks which supports two different service classes. The framework of Semi-Markov Decision Process (SMDP) is used to formulate the problem as a Joint Call Admission Control (JCAC) optimization problem that involves the design of a total cost function that weights two criteria: the blocking cost and the energy consumption cost. Simulation results are provided, showing that our JCAC optimal policy often selects the less energy consuming RAN when more weight (50% or more) is given to the energy consumption cost in the total cost function.
机译:在异构无线网络(HetNet)中,不同的重叠无线电接入网络(RAN)可以在同一地理区域内共存,目的是通过多模式终端为移动用户提供高速率的普遍接入。本文解决了在HetNets中具有两个位于同一位置的无线网络的RAN选择的问题,该无线网络支持两种不同的服务类别。半马尔可夫决策过程(SMDP)框架用于将问题表述为联合呼叫许可控制(JCAC)优化问题,该问题涉及权重两个标准的总成本函数的设计:阻塞成本和能耗成本。提供的仿真结果表明,当在总成本函数中对能耗成本赋予更大权重(50%或更多)时,我们的JCAC最优策略通常会选择能耗较低的RAN。

著录项

  • 来源
    《Grid and pervasive computing》|2013年|244-252|共9页
  • 会议地点 Seoul(KR)
  • 作者单位

    Faculty of Computing, Federal University of Para, Belem, Para, Brazil;

    Dept. of Computer Science, Ryerson University, Toronto, ON, M5B 2K3, Canada;

    Dept. of Computer Science, Ryerson University, Toronto, ON, M5B 2K3, Canada;

    Dept. of Electrical Engineering, Ryerson University, Toronto, ON, M5B 2K3, Canada;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号