• Title/Summary/Keyword: relay protocol

Search Result 276, Processing Time 0.022 seconds

A Dynamic Optimum Time Allocation Method in Partial Relay Systems (부분 중계기 협력 다중화 기술에서 동적 최적 시간 할당 기술)

  • Cho, Jung-Il;Kwon, Yang-Soo;Kim, Nam-Ri;Chung, Jae-Hak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.746-751
    • /
    • 2009
  • We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.

Secrecy Performances of Multicast Underlay Cognitive Protocols with Partial Relay Selection and without Eavesdropper's Information

  • Duy, Tran Trung;Son, Pham Ngoc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4623-4643
    • /
    • 2015
  • This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

Performance Comparison of Orthogonal and Non-orthogonal AF Protocols in Cooperative Relay Systems

  • Bae, Young-Taek;Jung, Sung-Kyu;Lee, Jung-Woo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1026-1040
    • /
    • 2012
  • For a single relay channel, we compare the capacity of two different amplify-and-forward (AF) protocols, which are orthogonal AF (OAF) and non-orthogonal AF (NAF). The NAF protocol has been proposed to overcome a significant loss of performance of OAF in the high spectral efficiency region, and it was also theoretically proved that NAF performs better than OAF in terms of the diversity-multiplexing tradeoff. However, existing results have been evaluated at the asymptotically high signal to noise ratio (SNR), thus the power allocation problem between the source and the relay was neglected. We examine which protocol has better performance in a practical system operating at a finite SNR. We also study where a relay should be located if we consider the power allocation problem. A notable conclusion is that the capacity performance depends on both SNR and power allocation ratio, which indicates OAF may perform better than NAF in a certain environment.

Performance of Cooperative Networks with Mixed Relaying Protocols in Railway Environments (철도환경에서 혼합 중계 프로토콜을 이용한 협력 네트워크의 성능)

  • Cho, Woong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.3
    • /
    • pp.271-276
    • /
    • 2016
  • Cooperative networks enhance the overall communication performance by combining signals from relay nodes and direct signal. In this paper, we analyze the performance of cooperative communication systems which use mixed relaying protocols. By assuming several relay nodes exist between the source node and destination node, we consider the systems use not a single relaying protocol but both decode-and-forward and amplify-and-forward protocols randomly. We analyze the effect of each relying protocol for the overall system performance, and also consider the performance depending on the relay location. Differential modulation scheme which demodulates signal without channel state information is adopted where it can be applicable fast varying channel such as railway environments.

Performance Analysis of Hybrid Decode-Amplify-Forward Incremental Relaying Cooperative Diversity Protocol Using SNR-Based Relay Selection

  • Tran, Trung Duy;Kong, Hyung-Yun
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.703-709
    • /
    • 2012
  • In this paper, we propose a hybrid decode-amplify-forward incremental cooperative diversity protocol using SNR-based relay selection. In the proposed protocol, whenever destination unsuccessfully receives the source's signal, one of relays that exploit hybrid decode-amplify-forward technique is chosen to retransmit the signal. We derive approximate closed-form expressions of outage probability and average channel capacity. Monte-Carlo simulations are presented to verify the theoretical results and compare the performance of the proposed protocol with the direct transmission protocol and conventional incremental relaying protocols.

A Simulation of Bridge using the Spanning Tree Protocol (스패닝 트리 프로토콜을 이용한 브릿지 시뮬레이션)

  • Lee, Sook-Young;Lee, Eun-Wha;Lee, Mee-Jeong;Chae, Ki-Joon;Choi, Kil-Young;Kang, Hun
    • Journal of the Korea Society for Simulation
    • /
    • v.6 no.2
    • /
    • pp.45-57
    • /
    • 1997
  • MAC (media access control) bridge is used to interconnect separate LANs and to relay frames between the BLANs (bridged LANs). Bridge architecture consists of MAC entity, MAC relay entity and bridge protocol entity protocol entity and performs learning, filtering and forwarding functions using filtering database. In this paper, we simulate these functions of bridge and the STP (spanning tree protocol). The STP derives an active topology from an arbitrarily connected BLAN. Our simulation model assumes a BLAN consisted of three bridge forming a closed loop. In order to remove the loop, each bridge process exchanges configruation BPDU (bridge protocol data unit0 with other bridge processes connected to the bridge itself. To simulate the communication between bridges, we implement the IPC (inter-process communication) server using message queues. Our simulation results show that the assumed BLAN contains no closed loop and then there is no alternative route and no unnecessary traffic.

  • PDF

A Light-Weight RFID Distance Bounding Protocol (경량 RFID 경계 결정 프로토콜)

  • Ahn, Hae-Soon;Bu, Ki-Dong;Yoon, Eun-Jun;Nam, In-Gil
    • The KIPS Transactions:PartC
    • /
    • v.17C no.4
    • /
    • pp.307-314
    • /
    • 2010
  • Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.

A TDMA-based Relay Protocol for Voice Communication on a Small Group (소규모 그룹에서의 음성 통신을 위한 TDMA 기반의 릴레이 프로토콜)

  • Hwang, Sangho;Park, Chang-Hyeon;Ahn, Byoungchul
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.259-266
    • /
    • 2013
  • Since the wireless communications have a limited transmission, the devices just around a master node can exchange data. Though Bluetooth and Zigbee support ad hoc, they are not appropriate for real-time voice communications. In this paper, we present a TDMA-based relay protocol for several users to communicate simultaneously. The proposed protocol can relay data or voice to other nodes in real-time by the multi-hop transmission method using TDMA. And the proposed protocol improves the network performance by allocating different frequencies to the slaves depending on the routing path scheduled by the routing table. NS-2 simulation shows that the performance of the proposed protocol is good in terms of the transmission delay and pecket loss probability in the real-time voice transmission.

Performance Analysis of Multicast Relay Transmissions in WiMedia D-MAC for OSMU N-Screen Services (OSMU N-스크린 서비스를 위한 WiMedia D-MAC에서 멀티캐스트 릴레이 전송 기술의 성능 분석)

  • Hur, Kyeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2267-2273
    • /
    • 2016
  • In this paper, WiMedia Distributed-MAC protocol is adopted for development of an OSMU (One Source Multi Use) N-screen wireless multicast service. But, when considering wireless communication environment where channel error rate is time-variant, N-screen high-speed data is vulnerable to be lost. For this problem, a multicast relay scheme is proposed by analyzing Distributed-MAC protocol. In proposed multicast relay scheme, Multicast-free DRP Availability IE is combined and the relay node suitable for N-screen multicast transmissions is selected. Through this operation, it can avoid wireless channel with high errors and can transmit N-screen high-speed data. In simulation results, the proposed multicast relay scheme is compared with conventional Distributed-MAC multicast scheme in view points of throughput and energy consumption according to various numbers of multicast nodes and BER (Bit Error Rate) values in wireless channel. Through simulation results, it is explained that proposed multicast relay scheme should be adopted in WiMedia Distributed-MAC protocol to realize OSMU N-screen wireless multicast services.

Cooperative Relaying with Interference Cancellation for Secondary Spectrum Access

  • Dai, Zeyang;Liu, Jian;Long, Keping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2455-2472
    • /
    • 2012
  • Although underlay spectrum sharing has been shown as a promising technique to promote the spectrum utilization in cognitive radio networks (CRNs), it may suffer bad secondary performance due to the strict power constraints imposed at secondary systems and the interference from primary systems. In this paper, we propose a two-phase based cooperative transmission protocol with the interference cancellation (IC) and best-relay selection to improve the secondary performance in underlay models under stringent power constraints while ensuring the primary quality-of-service (QoS). In the proposed protocol, IC is employed at both the secondary relays and the secondary destination, where the IC-based best-relay selection and cooperative relaying schemes are well developed to reduce the interference from primary systems. The closed-form expression of secondary outage probability is derived for the proposed protocol over Rayleigh fading channels. Simulation results show that, with a guaranteed primary outage probability, the proposed protocol can achieve not only lower secondary outage probability but also higher secondary diversity order than the traditional underlay case.