• 제목/요약/키워드: Selection relaying

검색결과 101건 처리시간 0.019초

Performance Analysis of Dual-Hop Cooperative Transmission with Best Relay Selection in a Rayleigh Fading Channel

  • Nessa, Ahasanun;Lee, Woo-Yong;Kim, Yong-Sun;Kwak, Kyung-Sup
    • 한국통신학회논문지
    • /
    • 제34권7A호
    • /
    • pp.530-539
    • /
    • 2009
  • Wireless Relaying is a promising solutions to overcome the channel impairments and provides high data rate coverage that appear for beyond 3G mobile communications. In this paper we present end to end BER performance of dual hop wireless communication systems equipped with multiple Decode and Forward relays over Rayleigh fading channel with the best relay selection. We compare the BER performance of the best relay with the BER performance of single relay. We select the best relay based on the end to end channel conditions. We further calculate the outage probability of the best relay. It is shown that the outage probability of the best relay is equivalent to the outage probability when all relays take part in the transmission. We apply Orthogonal Space Time Block coding(OSTBC) at the source terminal. Numerical and simulation results are presented to verify our analysis.

Spectrum Leasing and Cooperative Resource Allocation in Cognitive OFDMA Networks

  • Tao, Meixia;Liu, Yuan
    • Journal of Communications and Networks
    • /
    • 제15권1호
    • /
    • pp.102-110
    • /
    • 2013
  • This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

Stability-based On-demand Multi-path Distance Vector Protocol for Edge Internet of Things

  • Dongzhi Cao;Peng Liang;Tongjuan Wu;Shiqiang Zhang;Zhenhu Ning
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권10호
    • /
    • pp.2658-2681
    • /
    • 2023
  • In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

Learning based relay selection for reliable content distribution in smart class application

  • Kim, Taehong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2894-2909
    • /
    • 2015
  • As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

저비용 선박간 통신을 위한 전송률 인지 양방향 릴레이 기법 (Rate-Aware Two-Way Relaying for Low-Cost Ship-to-Ship Communications)

  • 왕진수;김선용;정민아;이성로;김윤희
    • 한국통신학회논문지
    • /
    • 제39C권8호
    • /
    • pp.651-659
    • /
    • 2014
  • 본 논문은 선단 내 해상 통신에서 두 통신 선박이 다중 안테나 릴레이 선박의 도움으로 데이터를 교환하는 양방향 릴레이 네트워크를 고려한다. 상기 네트워크에서 두 통신 선박의 정보 전송률이 다를 때 정보 전송 신뢰도를 높이는 전송률 인지 세 단계 아날로그 네트워크 부호화 기법을 제안한다. 제안 기법은 릴레이에서 직교하게 수신된 각 통신 선박의 신호로부터 향상된 품질의 아날로그 네트워크 부호화 신호를 안테나 수신 전력만을 이용하여 생성함으로써 릴레이를 채널 추정 기능 없이 낮은 복잡도로 구현할 수 있도록 한다. 또한, 제안 기법은 두 통신 선박의 서로 다른 전송률을 고려한 전송률-인지 릴레이 전력 할당 방법을 적용하여 비대칭 전송률을 갖는 데이터 교환의 아웃티지 확률을 크게 줄일 수 있음을 모의실험으로 보였다.

클러스터 트리 라우팅 프로토콜 연구 (Study of Cluster Tree Routing Protocols)

  • 조무호
    • 조명전기설비학회논문지
    • /
    • 제19권8호
    • /
    • pp.138-143
    • /
    • 2005
  • 클러스터 기반의 계층적 트리 구조는 대형화가 용이하면서 라우팅 프로토콜이 단순하다는 점에서 장점을 가진다. 본 논문에서는 무선 센스 네트워크에서 클러스터 트리 네트워크 관리를 효과적으로 지원할 수 있는 방안과 라우팅 프로토콜의 데이터 모음과 지연에 대해 분석한다. 수치 해석의 결과에서 보면 중간 노드에서의 데이터 모음을 통한 통신 메시지 수를 줄임으로 센스 노드의 전력 소모를 크게 절약할 수 있지만, 이에 따른 메시지 전달 지연이 커짐을 알 수 있었다. 또한 클러스터 헤드를 무작위로 선정하게 되면 메시지 지연이 매우 많이 증가될 수 있는 것이 확인되었다.

Throughput maximization for underlay CR multicarrier NOMA network with cooperative communication

  • Manimekalai, Thirunavukkarasu;Joan, Sparjan Romera;Laxmikandan, Thangavelu
    • ETRI Journal
    • /
    • 제42권6호
    • /
    • pp.846-858
    • /
    • 2020
  • The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

최선 릴레이 선택을 적용한 OFDM 기반 이중-홉 다중 릴레이 시스템의 아웃티지 성능 분석 (Outage Analysis of OFDM-Based Dual-hop Multi-Relay Systems with Best Relay Selection)

  • 박재철;왕진수;이지혜;김윤희
    • 한국통신학회논문지
    • /
    • 제35권5C호
    • /
    • pp.487-494
    • /
    • 2010
  • 본 논문은 OFDM (orthogonal frequency division multiplexing) 기반 이중-홉 다중 릴레이 시스템에서 상호정보를 최대로 하는 릴레이 선택 기법을 고려한다. 상기 시스템에서 DF (decode-and-forward) 릴레이를 적용할 때와 AF (amplify-and-forward) 릴레이를 적용할 때에 대해 각각 시스템 아웃티지 확률에 대한 하한과 제공 가능한 최대 다양성 차수를 유도하고 모의실험으로 아웃티지 용량을 제공한다. 성능 평가 결과 DF와 AF 방식 모두 아웃티지 확률 하한과 동일한 다양성 차수를 제공하지만, DF가 AF보다 아웃티지 확률 하한에 더 가깝고 더 큰 아웃티지 용량을 제공함을 볼 수 있다. 또한, 플랫 페이딩과 달리 주파수 선택성 채널에서는 다중 경로 수가 증가하거나 릴레이 선택의 후보 릴레이 수가 증가할수록 AF에 대한 DF 방식의 성능 이득이 더욱 커짐을 볼 수 있다. 따라서, OFDM 기반 다중 릴레이 시스템에서는 성능 면에서 AF 릴레이보다는 DF 릴레이가 유리함을 알 수 있다.

Partial Relay Selection in Decode and Forward Cooperative Cognitive Radio Networks over Rayleigh Fading Channels

  • Zhong, Bin;Zhang, Zhongshan;Zhang, Dandan;Long, Keping;Cao, Haiyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권11호
    • /
    • pp.3967-3983
    • /
    • 2014
  • The performance of an partial relay selection on the decode-and-forward (DF) mode cognitive radio (CR) relay networks is studied, with some important factors, including the outage probability, the bit error ratio (BER), and the average channel capacity being analyzed. Different from the conventional relay selection schemes, the impact of spectrum sensing process as well as the spectrum utilization efficiency of primary users on the performance of DF-based CR relaying networks has been taken into consideration. In particular, the exact closed-form expressions for the figures of merit such as outage probability, BER, and average channel capacity over independent and identically distributed (i.i.d.) Rayleigh fading channels, have been derived in this paper. The validity of the proposed analysis is proven by simulation, which showed that the numerical results are consistent with the theoretical analysis in terms of the outage probability, the BER and the average channel capacity. It is also shown that the full spatial diversity order can always be obtained at the signal-to-noise ratio (SNR) range of [0dB, 15dB] in the presence of multiple potential relays.

다중 홉 무선 인지 시스템에서 효과적인 무선 자원 할당 (Efficient Radio Resource Allocation for Cognitive Radio Based Multi-hop Systems)

  • 신정채;민승화;조호신;장윤선
    • 한국통신학회논문지
    • /
    • 제37권5A호
    • /
    • pp.325-338
    • /
    • 2012
  • 본 논문에서는 무선 인지(Cognitive Radio, CR) 기반의 다중 홉 릴레이 전송 환경에서 링크별 가용 주파수 자원을 할당하는 문제를 다룬다. 경로 탐색, 채널 센싱 및 판단, 자원 할당의 3단계 시나리오를 제시하고 컬러 다중 그래프 모델과 시분할 된 프레임 구조를 토대로 서비스 받는 사용자의 수를 최대화하는 최적화 문제로 수학적 모델링을 한다. 이에 대한 해법으로 단말 선택, 릴레이 및 경로 선택 그리고 각 홉별 주파수 자원 선택의 3단계로 구성되는 부 최적화된 종합적 자원관리 방안을 제시한다. 모의실험에서는 홉-별 시분할 된 프레임 구조를 가지는 셀룰러 기반 2차 시스템을 고려하였으며, 다중 홉 통신과 단일 홉 통신 간의 성능을 비교를 통해 무선인지 시스템에서 다중 홉 통신의 필요성을 보였다. 또한 다중 홉 통신 가운데 가장 우수한 홉 수와 그 환경에 대해 살펴보았다.