...
首页> 外文期刊>Computer Communications >S~2U: An efficient algorithm for optimal integrated points placement in hybrid optical-wireless access networks
【24h】

S~2U: An efficient algorithm for optimal integrated points placement in hybrid optical-wireless access networks

机译:S〜2U:一种在混合光无线接入网中优化集成点放置的有效算法

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

摘要

Integration of optical and wireless networks is considered as one of the promising technologies for next generation Internet access. In this paper, we consider the integrated points placement problem in the hybrid optical-wireless system for optimal resource utilization under the given constraints including hop count, cluster size, and relay load. While the optimization formulation is an NP-hard problem in general, we propose a polynomial-time heuristic algorithm - S~2U algorithm to obtain the near-optimal solution that minimizes the number of integrated points required to support all wireless BSs residing in the wireless part of the integrated system. In contrast to the existing work, our S~2U algorithm forms the clusters starting from the network edge towards its center and the construction of clusters is not only based on the greedy idea but also considers load balancing. We present a theoretical analysis of the complexity of the proposed S~2U algorithm and its approximation ratio to the optimal solution. Furthermore, we present extensive numerical results to compare the proposed S~2U algorithm with the main existing methods. It is shown that S~2U can not only cover a network with a smaller number of integrated points, but also achieve better network performance in terms of the average transmission delay (average hop count) and load balance. In addition, we compare our results with the optimal solution obtained via CPLEX in terms of the minimum number of integrated points. The results show that the gap between the results obtained from our S~2U algorithm and the optimal results is within 5% in average.
机译:光和无线网络的集成被认为是下一代Internet访问的有前途的技术之一。在本文中,我们考虑在给定的约束(包括跳数,簇大小和中继负载)下,混合无线系统中的积分放置问题,以实现最佳资源利用。尽管优化公式通常是一个难解决的NP问题,但我们提出了多项式时间启发式算法-S〜2U算法来获得接近最优的解决方案,该解决方案可最大程度地减少支持无线网络中所有无线BS所需的集成点数集成系统的一部分。与现有工作相反,我们的S〜2U算法形成了从网络边缘到中心的群集,群集的构建不仅基于贪婪的思想,而且考虑了负载平衡。我们对所提出的S〜2U算法的复杂度及其与最优解的近似比率进行理论分析。此外,我们提供了广泛的数值结果,以将提出的S〜2U算法与现有的主要方法进行比较。结果表明,S〜2U不仅可以覆盖集成点数量较少的网络,而且在平均传输延迟(平均跳数)和负载平衡方面也可以获得更好的网络性能。另外,我们将我们的结果与通过CPLEX获得的最佳解决方案(就最小积分点而言)进行比较。结果表明,从我们的S〜2U算法获得的结果与最佳结果之间的差距平均在5%以内。

著录项

  • 来源
    《Computer Communications》 |2011年第11期|p.1375-1388|共14页
  • 作者

    Yu Liu; Chi Zhou; Yu Cheng;

  • 作者单位

    Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, Illinois 60616, USA;

    Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, Illinois 60616, USA;

    Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, Illinois 60616, USA;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    optical network; wireless network; integrated system; clustering algorithm; approximation ratio;

    机译:光网络;无线网络;集成系统;聚类算法;近似比;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号