• Title/Summary/Keyword: Random relay

Search Result 29, Processing Time 0.028 seconds

Secure Transmission for Two-Way Vehicle-to-Vehicle Networks with an Untrusted Relay

  • Gao, Zhenzhen
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.6
    • /
    • pp.443-449
    • /
    • 2015
  • This paper considers the physical layer security problem for a two-way vehicle-to-vehicle network, where the two source vehicles can only exchange information through an untrusted relay vehicle. The relay vehicle helps the two-way transmission but also acts as a potential eavesdropper. Each vehicle has a random velocity. By exploiting the random carrier frequency offsets (CFOs) caused by random motions, a secure double-differential two-way relay scheme is proposed. While achieving successful two-way transmission for the source vehicles, the proposed scheme guarantees a high decoding error floor at the untrusted relay vehicle. Average symbol error rate (SER) performance for the source vehicles and the untrusted relay vehicle is analyzed. Simulation results are provided to verify the proposed scheme.

Slotted ALOHA Based Greedy Relay Selection in Large-scale Wireless Networks

  • Ouyang, Fengchen;Ge, Jianhua;Gong, Fengkui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3945-3964
    • /
    • 2015
  • Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

Effect of Energy Harvesting on Stable Throughput in Cooperative Relay Systems

  • Pappas, Nikolaos;Kountouris, Marios;Jeon, Jeongho;Ephremides, Anthony;Traganitis, Apostolos
    • Journal of Communications and Networks
    • /
    • v.18 no.2
    • /
    • pp.261-269
    • /
    • 2016
  • In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

A Study of Analysis on Klippon Relay Malfunction in HVDC System (HVDC 시스템에서 클리폰 릴레이 오동작 분석에 관한 연구)

  • Kim Chan-Ki;Park ong-Kwang;Choo Jin-Boo
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.54 no.9
    • /
    • pp.437-443
    • /
    • 2005
  • This paper deals with an experimental study for Klippon reiay in Cheju-Heanam HVDC system Klippon relay was troubled many times for years, and Klippon relay's fault caused the HVDC system trip. So for several years, these reasons of Klippon relay fault were investigated. The malfunction of Klippon relay in Cheju-Haenam HVDC system has been caused by the incoming of random surge(current source and voltage source). This paper has stu야ed the theoretic리 analysis and experimental study of Klippon relay, and the solutions against the problems were suggested according to their causes. Among the problems, grounding problem was removed by one-point earth connection and by modification of grounding circuit. The effects of inrush current was removed by inserting the blocking diodes by series in Klippon relay circuits. Finally, The over-voltage induced on Klippon relay, by a relay excitation coil, was removed by inserting a free-wheeling diode in Parallel with the excitation coil.

Random Access Channel Allocation Scheme in Multihop Cellular Networks (멀티 홉 셀룰라 망에서의 랜덤 액세스 채널 할당 방안)

  • Cho, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4A
    • /
    • pp.330-335
    • /
    • 2007
  • This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

Performance Comparison of Relay Selection Methods for Incremental Cooperative Relaying Systems with Spatially Random Relay (랜덤한 릴레이를 갖는 추가 기회전송 협동 릴레이 시스템의 릴레이 선택법에 따른 성능비교)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.65-71
    • /
    • 2016
  • Cooperative relaying systems have been studied actively to improve the system performance effectively in wireless fading channels. Most of the cooperative relay studies are assumed fixed relay, recently the performance analysis of the cooperative relaying systems with spatially random relays considering the practical mobile environment are introduced. However the comparative studies for relay selection methods of incremental cooperative relay systems, the performance of which is influenced by the selection methods, have not been studied. Therefore we derive the performance of the system which has MRC(Maximal-ratio combining) with Max SNR(signal-to-noise ratio) selection or Max-min SNR selection, respectively. And the outage performances of the system with Max or Max-min selection method are compared for different transmit power allocation to the source and to the relays. The analytical results serve as useful tools for relay selection and power allocation to transmit nodes for opportunistic incremental relaying systems.

Adaptive Success Rate-based Sensor Relocation for IoT Applications

  • Kim, Moonseong;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3120-3137
    • /
    • 2021
  • Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

Outage Analysis of Cooperative Transmission in Two-Dimensional Random Networks over Rayleigh Fading Channels

  • Tran, Trung Duy;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.4
    • /
    • pp.262-268
    • /
    • 2011
  • In this paper, we evaluate the outage performance of cooperative transmission in two-dimensional random networks. Firstly, we derive the joint distributions of the source-relay and the relay-destination links. Secondly, the outage probability for the decode-and-forward relaying system is derived when selection combining (SC) is employed at the destination. Finally, we calculate the average outage probability of the system and then attempt to express it by a simple approximate expression. The simulation results are presented to verify the accuracy of the derivations. Similar to deterministic networks, the cooperative transmission in random networks outperforms direct transmission at a high signal-to-noise ratio (SNR).

Secrecy Performance of Multi-Antenna Satellite-Terrestrial Relay Networks with Jamming in the Presence of Spatial Eavesdroppers

  • Wang, Xiaoqi;Hou, Zheng;Zhang, Hanwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3152-3171
    • /
    • 2022
  • This work investigates the physical layer secrecy of a multi-antenna hybrid satellite-terrestrial relay networks (HSTRN) with jamming, in which a satellite aims to make communication with a destination user by means of a relay, along with spatially random eavesdroppers. In order to weaken the signals of eavesdroppers, the conventional relay can also generate intentional interference, besides forwarding the received signal. Shadowed-Rician fading is adopted in satellite link, while Rayleigh fading is adopted in terrestrial link, eavesdropper link and jamming link. The analytical and asymptotic formulas for the system secrecy outage probability (SOP) are characterized. Practical insights on the diversity order of the network are revealed according to the asymptotic behavior of SOP at high signal-to-noise ratio (SNR) regime. Then, analysis of the system throughput is examined to assess the secrecy performance. In the end, numerical simulation results are presented to validate the theoretical analysis and point out: (1) The secrecy performance of the considered network is affected by the channel fading scenario, the system configuration; (2) Decrease of the relay coverage airspace can provide better SOP performance; (3) Jamming from the relay can improve secrecy performance without additional network resources.

Relay Selection for Two-hop Cooperative Jamming Network with Multiple Eavesdroppers (다수의 중계기와 도청자가 존재하는 협력 재밍 네트워크를 위한 중계기 선택 기법)

  • Choi, Yongyun;Lee, Jae Hong
    • Journal of Broadcast Engineering
    • /
    • v.21 no.1
    • /
    • pp.105-108
    • /
    • 2016
  • In this paper, a cooperative jamming network with multiple relays and multiple eavesdroppers is investigated. Among the relays, one best relay is selected to amplify and forward the signal to destination through two phases. To confuse eavesdroppers, the destination transmits a jamming signal in the first phase and the source transmits jamming signal in the second phase. Secrecy rate of this system is derived, and based on the available channel state information (CSI), relay selection schemes are proposed, respectively. Numerical results show that the performance of the proposed relay selection scheme outperforms than that of random relay selection scheme.