Chi‐Yuan ChenYu‐Shan LiangChia-Mu YuChih‐Hsiang HoSy‐Yen Kuo
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.
P. MangayarkarasiK. AmsalakshmiS. Jayashri
Sojeong AnnKyung‐Geun LeeHyung Seok Kim