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.