Increasing Reliability for IEEE 802.16j Mobile Multi-hop Relay Networks Planning

Chi-Yuan Chen, Yu-Shan Liang, Chia-Mu Yu, Chih-Hsiang Ho, S. Kuo
{"title":"Increasing Reliability for IEEE 802.16j Mobile Multi-hop Relay Networks Planning","authors":"Chi-Yuan Chen, Yu-Shan Liang, Chia-Mu Yu, Chih-Hsiang Ho, S. Kuo","doi":"10.1109/PRDC.2009.51","DOIUrl":null,"url":null,"abstract":"IEEE 802.16 network is a new generation of broadband networks. Recently, relay stations in IEEE 802.16j are proposed to perform as lightweight base station solutions to extend coverage and/or increase throughput. However, the 802.16j networks are tree-based structure which suffers from the single point of failure problem. In this paper, we define the coverage problem to place the base stations (BSs) and relay stations (RSs) at the lowest cost to support desired utilities and constrained by reliability limit. We develop two heuristic algorithms to solve coverage problems. We decide the proposed algorithms whose performance is quite near to the optimal selection by implementing a number of randomly selected graphs.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pacific Rim International Symposium on Dependable Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2009.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

IEEE 802.16 network is a new generation of broadband networks. Recently, relay stations in IEEE 802.16j are proposed to perform as lightweight base station solutions to extend coverage and/or increase throughput. However, the 802.16j networks are tree-based structure which suffers from the single point of failure problem. In this paper, we define the coverage problem to place the base stations (BSs) and relay stations (RSs) at the lowest cost to support desired utilities and constrained by reliability limit. We develop two heuristic algorithms to solve coverage problems. We decide the proposed algorithms whose performance is quite near to the optimal selection by implementing a number of randomly selected graphs.
提高IEEE 802.16j移动多跳中继网络规划的可靠性
IEEE 802.16网络是新一代宽带网络。最近,IEEE 802.16j中的中继站被提议作为轻量级基站解决方案来扩展覆盖范围和/或增加吞吐量。然而,802.16j网络是基于树的结构,存在单点故障问题。在本文中,我们定义了覆盖问题,以最低的成本放置基站(BSs)和中继站(RSs),以支持期望的公用事业,并受可靠性限制。我们开发了两种启发式算法来解决覆盖问题。我们通过实现一些随机选择的图来确定性能非常接近最优选择的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信