• Title/Summary/Keyword: Relay Selection

Search Result 268, Processing Time 0.028 seconds

A Method of Avoid flooding in the Cluster (클러스터 내의 플러딩 회피 방안)

  • Kim, Tae-Wook;Sang, Nguyen Quang;Tuan, Van Phu;Kong, Hyung-Yun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.677-680
    • /
    • 2015
  • In this paper, we propsed scheme to mitigate conflict and loss of message in vehicle communication. And vehicles that exist in the moving direction, were grouping to the cluster form. Through, to select best relay vehicle, transmit a message to the destination. In addition, we applied the double rayleigh fading environment so that can applied in real-environments. Therefore, vehicle communication network applied proposed scheme, can be problem of mitigate conflict and loss of message. Thus, Increase the reliability of the received signal.

  • PDF

An energy-efficiency approach for bidirectional amplified-and-forward relaying with asymmetric traffic in OFDM systems

  • Jia, Nianlong;Feng, Wenjiang;Zhong, Yuanchang;Kang, Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4087-4102
    • /
    • 2014
  • Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

Energy-Aware Video Coding Selection for Solar-Powered Wireless Video Sensor Networks

  • Yi, Jun Min;Noh, Dong Kun;Yoon, Ikjune
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.7
    • /
    • pp.101-108
    • /
    • 2017
  • A wireless image sensor node collecting image data for environmental monitoring or surveillance requires a large amount of energy to transmit the huge amount of video data. Even though solar energy can be used to overcome the energy constraint, since the collected energy is also limited, an efficient energy management scheme for transmitting a large amount of video data is needed. In this paper, we propose a method to reduce the number of blackout nodes and increase the amount of gathered data by selecting an appropriate video coding method according to the energy condition of the node in a solar-powered wireless video sensor network. This scheme allocates the amount of energy that can be used over time in order to seamlessly collect data regardless of night or day, and selects a high compression coding method when the allocated energy is large and a low compression coding when the quota is low. Thereby, it reduces the blackout of the relay node and increases the amount of data obtained at the sink node by allowing the data to be transmitted continuously. Also, if the energy is lower than operating normaly, the frame rate is adjusted to prevent the energy exhaustion of nodes. Simulation results show that the proposed scheme suppresses the energy exhaustion of the relay node and collects more data than other schemes.

Relay node selection scheme based on message distribution for DTN (DTN에서 메시지 분포에 따른 중계 노드 선택 기법)

  • Dho, Yoon-hyung;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.431-433
    • /
    • 2016
  • In this paper, we propose an algorithm that analyzes characteristic nodes to select efficient relay nodes using message distribution. Existing delay-tolerant network (DTN) routing algorithms have problems with large latency and overhead on account of the deficiency of network information in an unsteady network. We must solve this problem, predict future networks using node state information, and apply a weight factor that changes according to the message distribution. Simulation results show that the proposed algorithm provides enhanced performance compared to existing DTN routing algorithms.

  • PDF

Comparison of Outage Probability Between Best-relay 2-hop Relaying and 3-hop Relaying (두 릴레이가 존재할 때 삼중 홉 중계와 베스트 릴레이 선택 후 이중 홉 중계 방식의 아웃티지 확률 비교)

  • Youn, You-Sun;Kim, Dong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1B
    • /
    • pp.136-143
    • /
    • 2010
  • In this paper, we investigate decode-and-forward (DF) relaying systems with a direct link between the source and the destination node. The objective of this paper is to determine the better relaying strategy between 3-hop DF relaying and dual-hop DF relaying with the best relay selection. Assuming Rayleigh fading channels, we present closed-form outage probability of the 3-hop relaying and the dual-hop relaying, respectively, and compare the performances by numerical investigation. Numerical results show that if the channel is poor, the outage performance of the 3-hop relaying is better than the dual-hop relaying.

Context-aware Connectivity Analysis Method using Context Data Prediction Model in Delay Tolerant Networks (Delay Tolerant Networks에서 속성정보 예측 모델을 이용한 상황인식 연결성 분석 기법)

  • Jeong, Rae-Jin;Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.1009-1016
    • /
    • 2015
  • In this paper, we propose EPCM(Efficient Prediction-based Context-awareness Matrix) algorithm analyzing connectivity by predicting cluster's context data such as velocity and direction. In the existing DTN, unrestricted relay node selection causes an increase of delay and packet loss. The overhead is occurred by limited storage and capability. Therefore, we propose the EPCM algorithm analyzing predicted context data using context matrix and adaptive revision weight, and selecting relay node by considering connectivity between cluster and base station. The proposed algorithm saves context data to the context matrix and analyzes context according to variation and predicts context data after revision from adaptive revision weight. From the simulation results, the EPCM algorithm provides the high packet delivery ratio by selecting relay node according to predicted context data matrix.

Contribution-Level-Based Opportunistic Flooding for Wireless Multihop Networks (무선 다중 홉 환경을 위한 기여도 기반의 기회적 플러딩 기법)

  • Byeon, Seung-gyu;Seo, Hyeong-yun;Kim, Jong-deok
    • Journal of KIISE
    • /
    • v.42 no.6
    • /
    • pp.791-800
    • /
    • 2015
  • In this paper, we propose the contribution-level-based opportunistic flooding in a wireless multihop network which achieves outstanding transmission efficiency and reliability. While the potential of the the predetermined relay node to fail in its receipt of broadcast packets is due to the inherent instability in wireless networks, our proposed flooding actually increases network reliability by applying the concept of opportunistic routing, whereby relay-node selection is dependent on the transmission result. Additionally, depending on the contribution level for the entire network, the proposed technique enhances transmission efficiency through priority adjustment and the removal of needless relay nodes. We use the NS-3 simulator to compare the proposed scheme with dominant pruning. The analysis results show the improved performance in both cases: by 35% compared with blind flooding from the perspective of the transmission efficiency, and by 20~70% compared to dominant pruning from the perspective of the reliability.

A Joint Resource Allocation and Routing Scheme for the IEEE 802.16j Multi-hop Relay Networks (IEEE 802.16j 멀티홉 릴레이 네트워크를 위한 통합 자원 할당-라우팅 기법)

  • Lee, Kyung-Joo;Lee, Hyuk-Joon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.1
    • /
    • pp.82-91
    • /
    • 2009
  • Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

  • PDF

Performance of Opportunistic Incremental NOMA Relay System in Fading Channels (페이딩 채널에서 기회전송 증가 NOMA 릴레이 시스템의 성능분석)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.69-76
    • /
    • 2016
  • In this paper, we investigate the system performance of a cooperative relaying system of Non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC), which is considered promising application in fifth generation (5G) cellular networks. Previous studies have focused on the selected relays, however we include the maxmin relay selection and derive analytical outage probability of opportunistic incremental relaying systems. For the realistic mobile environment, the distributions of relays are modeled as a homogeneous Poisson point process (PPP). And maximal ratio combining (MRC) is adapted to improve the system performance at the destination node. Analytical results demonstrate the outage probability improves with the near/far user power ratio, and the cooperative relaying scheme can achieve low outage probability in comparison to the no relaying scheme. It is also conformed that the increase of the intensity of PPP cause higher gains of the spacial diversity and hence the performance improves.

Exact Outage Probability of Two-Way Decode-and-Forward NOMA Scheme with Opportunistic Relay Selection

  • Huynh, Tan-Phuoc;Son, Pham Ngoc;Voznak, Miroslav
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5862-5887
    • /
    • 2019
  • In this paper, we propose a two-way relaying scheme using non-orthogonal multiple access (NOMA) technology. In this scheme, two sources transmit packets with each other under the assistance of the decode-and-forward (DF) relays, called as a TWDFNOMA protocol. The cooperative relays exploit successive interference cancellation (SIC) technique to decode sequentially the data packets from received summation signals, and then use the digital network coding (DNC) technique to encrypt received data from two sources. A max-min criterion of end-to-end signal-to-interference-plus-noise ratios (SINRs) is used to select a best relay in the proposed TWDFNOMA protocol. Outage probabilities are analyzed to achieve exact closed-form expressions and then, the system performance of the proposed TWDFNOMA protocol is evaluated by these probabilities. Simulation and analysis results discover that the system performance of the proposed TWDFNOMA protocol is improved when compared with a conventional three-timeslot two-way relaying scheme using DNC (denoted as a TWDNC protocol), a four-timeslot two-way relaying scheme without using DNC (denoted as a TWNDNC protocol) and a two-timeslot two-way relaying scheme with amplify-and-forward operations (denoted as a TWANC protocol). Particularly, the proposed TWDFNOMA protocol achieves best performances at two optimal locations of the best relay whereas the midpoint one is the optimal location of the TWDNC and TWNDNC protocols. Finally, the probability analyses are justified by executing Monte Carlo simulations.