• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Proceedings of the International Conference on Data Communication Networking and International Conference on Optical Communication System >WiMAX? A case study on minimizing construction cost for IEEE 802.16j multi-hop relay networks
【24h】

WiMAX? A case study on minimizing construction cost for IEEE 802.16j multi-hop relay networks

机译：WiMAX？以最小化IEEE 802.16j多跳中继网络的建设成本为例

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The telecommunication service providers regard the fixed WiMAX (Worldwide Interoperability for Microwave Access) as a solution of last mile problem, but its coverage range is not ideal. The current placement of fixed infrastructure and mobile 802.16 networks still exists many problems, such as non-light-of-sight (NLOS) connections, low signal to noise ratio (SNR) and coverage holes which bring shadowing effects. In order to solve the above-mentioned embarrassed problems, the IEEE 802.16j is proposed and aimed to extend the transmitting area by using relay technologies. Relay Station (RS) can be thought as a lightweight base station (BS) in 802.16j networks. The coverage problem in IEEE 802.16j networks is defined based on integer linear programming. We also propose the Supergraph Tree algorithm to deploy the base stations and relay stations at the lowest cost position to support desired utilities and constrained by deployment limitations. The proposed algorithm is formulated based on graph theoretic technique, and analyzed with the simulation results. The results show the proposed algorithm provides the lowest construction cost with different network topologies.
机译：电信服务提供商将固定的WiMAX（微波访问全球互操作性）视为最后一英里问题的解决方案，但其覆盖范围并不理想。固定基础设施和移动802.16网络的当前布置仍然存在许多问题，例如非视距（NLOS）连接，低信噪比（SNR）和带来阴影效应的覆盖孔。为了解决上述尴尬的问题，提出了IEEE 802.16j，其目的是通过使用中继技术来扩展发送区域。中继站（RS）可以被视为802.16j网络中的轻量级基站（BS）。 IEEE 802.16j网络中的覆盖问题是基于整数线性规划定义的。我们还提出了Supergraph Tree算法，以便在最低成本位置部署基站和中继站，以支持所需的公用事业，并受部署限制的约束。该算法是基于图论技术制定的，并结合仿真结果进行了分析。结果表明，所提出的算法在不同的网络拓扑结构下提供了最低的构建成本。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号