• Title/Summary/Keyword: Relay Station(RS)

Search Result 52, Processing Time 0.023 seconds

Channel Selective Relay-based Multiple-Input SC-FDMA/OFDMA Transmission System (채널 선택형 릴레이 기반 다중 입력 SC-FDMA/OFDMA 전송 시스템)

  • Won, Hui-Chul;Kim, Soon-Cheol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.5
    • /
    • pp.1-9
    • /
    • 2009
  • Relay-assisted multiple input technique has become a promising candidate for next generation broadband wireless communications. In this paper, we propose channel selective relay-based multiple input transmission system. In the proposed system, single carrier frequency division multiple access (SC-FDMA) and orthogonal frequency division multiple access (OFDMA) are adopted for uplink and downlink transmissions, respectively. The performance of relay-based system can be improved by using the subcarriers selectively based on the channel condition between relay station (RS) and mobile station, or between RS and base station. Simulation results show that the proposed relay-based system considerably outperforms the conventional relay-based system.

An Auction based Hierarchical Link Allocation Algorithm for Throughput Improvement of Relay Station Systems (Relay Station 시스템의 Throughput 향상을 위한 Auction 기반 계층적 링크 할당 알고리듬)

  • Kang, Hae-Lynn;Yu, Hye-In;Kim, Nak-Myeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.6
    • /
    • pp.11-18
    • /
    • 2009
  • In this paper, a hierarchical link allocation algorithm between mobile stations (MSs) and the corresponding base station (BS) by an optimal utilization of relay stations (RSs) is proposed to improve throughput of RS systems. In the proposed hierarchical algorithm, each RS operates cognitive radio functions to sense the degree of satisfaction in the quality of services (QoSs) and then selects the candidate set of MSs to have links with the RS. Such information is reported to the BS, where an auction process is performed to get an optimal allocation of communication links between the MSs and the BS. To maximize system throughput, the proposed auction algorithm is conducted upon bidding prices of communication links, considering both the co-channel interference (CCI) information shared among adjacent cells and the QoS enhancement information for each MS collected from RSs. The BS then switches the communication links of the auction winner MSs through the corresponding RS. The computer simulation shows that the proposed algorithm enhances the user QoS more than the conventional algorithm, especially for RS systems with more users requiring higher QoS. The proposed algorithm has also been proved to have more robust performance than the conventional one when the traffic load is higher and the CCI becomes stronger.

An Analytic Model for the Optimal Number of Relay Stations in IEEE 802.16j Cooperative Networks (IEEE 802.16j 협력 전송 네트워크에서 최적의 중계국 수를 위한 분석 모델)

  • Jin, Zilong;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9A
    • /
    • pp.758-766
    • /
    • 2011
  • Cooperative communications are adopted as a promising solution to achieve high data rate over large areas in the future 40 wireless system and the relay station (RS) is the key concept in cooperative communications. However, most existing works in this area focus only on optimal RS selections. In addition, there are only few works consider another crucial issue: how many relay stations we need to place. Only when the number of relay stations is defined, the relay station selection can be performed well. In this paper we derive a formula which describes the impact of varying number of RS on end-to-end link throughput assuming a clustering scheme which is based on Voronoi tessellation. In addition to mathematical analysis on the feasibility of the formula, we also examine its performance through a set of simulations under the Erceg path loss model. Simulation results verify that the link throughput gain of our proposed scheme is promising.

WiBro용 Mobile 기술 동향

  • Kim, Yeong-Il;An, Dong-Hyeon;Kim, Hyeon-Jae;Lee, Yong-Su;Chae, Su-Chang;Kim, Seok-Chan;Park, Dong-Chan
    • Information and Communications Magazine
    • /
    • v.24 no.5
    • /
    • pp.15-26
    • /
    • 2007
  • 최근 WiBro/WiMAX에서 기지국의 용량증대와 셀의 크기를 확정하는 것을 목적으로 하는 RS(Relay Station)에 대한 표준화가 IEEE 802.16j에서 이루어지고 있다. RS는 기존의 아날로그 중계와 달리 수신신호를 복조 및 복호화한 후 특정 처리과정을 거친 후 다시 부호 및 부호화하여 전송하는 기능을 갖는다. 초고속 휴대인터넷서비스를 제공하고 있는 초고속 무선인터넷서비스 시장에 대한 수요의 증대로 WiBro/WiMax시장의 활성화와 IEEE 802.16j에 대한 표준화의 진척에 따라 WiBro용 RS(Relay Station)상용제품이 조만간 출시 될 것으로 보인다. 본고에서는 WiBrro용 MMR(Mobile Multi-hop relay)기술의 표준화 동향과 요소기술, MMR망의 성능분석에 대해서 기술한다.

A Study on the Optimal Wireless Resource Allocation for the Access and Relay Zones of Downlink in a 2-hop Cellular Relay System based on IEEE802.16j (IEEE802.16j 기반의 2-홉 셀룰러 중계시스템에서 하향링크 접근영역과 중계영역에 대한 최적 무선자원 할당방법 연구)

  • Lee, In-Hwan;Kim, Se-Jin;Cho, Sung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.11 no.3
    • /
    • pp.43-51
    • /
    • 2010
  • In this paper, we evaluate the system throughput and the method of optimal wireless resource allocation for the access zone (AZ) and relay zone (RZ) in downlink when the cell coverage is extended using the non-transparent Relay Station (RS) in a 2-hop cellular relay system based on IEEE802.16j, which uses the OFDMA-TDD structure. For the analyses, we first introduce the MAC (Media Access Control) frame structure in the non-transparent mode, then we investigate the interfering elements in both AZ and RZ for the network devices such as the Mobile Station (MS) and RS. Through computer simulation, we analyze the cell coverage extension and system throughput in terms of the distance between Base Station (BS) and RS, then we present the amount of the optimal allocation of wireless resource for the AZ and RZ in downlink using our results.

Sum-Rate Performance of A NOMA-based Two-Way Relay Approach for A Two-User Cellular Network

  • Li, Guosheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1944-1956
    • /
    • 2021
  • This paper considers a cellular two-way relay network with one base station (BS), one relay station (RS), and two users. The two users are far from the BS and no direct links exist, and the two users exchange messages with the BS via the RS. A non-orthogonal multiple access (NOMA) and network coding (NC)-based decode-and-forward (DF) two-way relaying (TWR) scheme TWR-NOMA-NC is proposed, which is able to reduce the number of channel-uses to three from four in conventional time-division multiple access (TDMA) based TWR approaches. The achievable sum-rate performance of the proposed approach is analyzed, and a closed-form expression for the sum-rate upper bound is derived. Numerical results show that the analytical sum-rate upper bound is tight, and the proposed TWR-NOMA-NC scheme significantly outperforms the TDMA-based TWR and NOMA-based one-way relaying counterparts.

A Cluster-Based Relay Station Deployment Scheme for Multi-Hop Relay Networks

  • Chang, Jau-Yang;Chen, Yun-Wei
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.84-92
    • /
    • 2015
  • Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

Performance Evaluation of a Subcarrier Allocation Scheme with Inter-Cell Interference and Network Coding in OFDMA Relay Systems (OFDMA 중계 시스템에서 인접셀 간섭과 네트워크 코딩을 고려한 주파수 할당 기법의 성능 평가)

  • Jang, Woo Jin;Son, Se Ho;Hwang, Ho Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.54-56
    • /
    • 2013
  • A subcarrier allocation scheme for base station (BS), relay station (RS) and mobile station (MS) can affect the performance of orthogonal frequency division multiple access (OFDMA) relay systems. In this paper, we propose a subcarrier allocation scheme with inter-cell interference and network coding in OFDMA relay systems. In the network coding zone, we consider an environment where RS can transmit a frame to BS and MS simultaneously. We divide an OFDMA frame into downlink zone, uplink zone, and network coding zone. The proposed scheme allocates subcarriers to BS, RS, and MS for each zone with consideration of inter-cell interference in OFDMA relay systems. We evaluate the performance of the proposed subcarrier allocation scheme through simulation.

  • PDF

A Spectrally Efficient Macrodiversity Handover Technique for Interference-Limited IEEE 802.16j Multihop Wireless Relay Networks

  • Sultan, Jamil;Misran, Norbahiah;Ismail, Mahamod;Islam, Mohammad Tariqul
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.558-568
    • /
    • 2011
  • In this paper, we propose an efficient macrodiversity handover (MDHO) technique for time-division-based interference-limited IEEE 802.16j multihop wireless relay networks. In the proposed MDHO, when the diversity set members of the mobile station (MS) are a base station (BS) and relay station (RS), the MS receives the signal transmitted by the BS in the first phase. During the second phase, it also receives the simultaneous transmissions of the BS and RS. Furthermore, when the diversity set members are two RSs or two BSs, the MS receives only the simultaneous transmissions of the diversity set members. The superiority of the proposed MDHO is validated using analytical and simulation results. The performance analysis metrics are the average downlink (DL) carrier to interference and noise ratio (CINR), the average DL spectral efficiency, and the average service outage probability. Evaluation results show that the proposed MDHO significantly outperforms the conventional MDHO. The CINR gain achieved using the proposed MDHO is 4.71 dB compared to the conventional MDHO.

A Bandwidth Adaptive Path Selection Scheme in IEEE 802.16 Relay Networks

  • Lee, Sung-Hee;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.3
    • /
    • pp.477-493
    • /
    • 2011
  • The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.