• Title/Summary/Keyword: Relay selection

Search Result 267, Processing Time 0.031 seconds

Node Selection Algorithm for Cooperative Transmission in the Wireless Sensor Networks (무선 센서네트워크에서 협업전송을 위한 노드선택 알고리즘)

  • Gao, Xiang;Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1238-1240
    • /
    • 2009
  • In the wireless sensor network, cooperative transmission is an effective technique to combat multi-path fading and reduce transmitted power. Relay selection and power allocation are important technical issues to determine the performance of cooperative transmission. In this paper, we proposed a new multi-relay selection and power allocation algorithm to increase network lifetime. The proposed relay selection scheme minimizes the transmitted power and increase the network lifetime by considering residual power as well as channel conditions. Simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

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.

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

  • Kim, Taehong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.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.

Outage Probability of Transmit Maximum-Ratio-Combining and Relay Selection Diversity for Amplify-and-Forward Relaying System (증폭 후 전달 릴레이 시스템을 위한 송신 Maximum-Ratio-Combining과 릴레이 선택 다이버시티에 대한 Outage 확률 분석)

  • Min, Hyun-Kee;Lee, Sung-Eun;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.13-18
    • /
    • 2008
  • In this paper, we consider an amplifying-and-forward(AF) dual-hop relaying system where the source node transmits to a destination node with the help of R relay nodes. We assume that the source node equips M transmit antennas, but only one antenna is equipped at the each node of relay and destination. The outage probabilities are presented when the transmit maximum-ratio-combining(MRC) is used at the source-relay(S-R) links, and the best relay selection, which selects only one relay that contributes the most to the received signal-to-noise ratio(SNR) as active relay, is combined. Simulation results validate these analytical results.

Determination of Effective Relay Candidates for the Best Relay Selection in Wireless Systems in the Presence of Interference (간섭이 존재하는 무선 시스템에서 최적의 중계 노드 선택을 위한 효과적인 중계 노드 후보 결정 방법 연구)

  • Lee, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2812-2817
    • /
    • 2013
  • In this paper, an outage probability for the best relay selection in decode-and-forward relaying systems in the presence of interference is analyzed over Rayleigh fading channels. Based on the outage performance results, we propose a method to determine effective relay candidates for the best relay selection, where the effective relay candidates represent the relays except for relays that make no contribution to improving the performance. in all possible relays given in the system. By determining the effective relay candidates, the feedback overhead of channel state information and the energy consumption of relays can be significantly reduced while minimizing the performance degradation. In this paper, we provide important parameters that affect the determination of the effective relay candidates.

Improvement of Underlay Cooperative Cognitive Networks Bandwidth Efficiency under Interference and Power Constraints

  • Al-Mishmish, Hameed R.M.;Preveze, Barbaros;Alkhayyat, Ahmed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5335-5353
    • /
    • 2019
  • The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.

Throughput-efficient Online Relay Selection for Dual-hop Cooperative Networks

  • Lin, Yuan;Li, Bowen;Yin, Hao;He, Yuanzhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2095-2110
    • /
    • 2015
  • This paper presents a design for a throughput-efficient online relay selection scheme for dual-hop multi-relay cooperative networks. Problems arise with these networks due to unpredictability of the relaying link quality and high time-consumption to probe the dual-hop link. In this paper, we firstly propose a novel probing and relaying protocol, which greatly reduces the overhead of the dual-hop link estimation by leveraging the wireless broadcasting nature of the network. We then formulate an opportunistic relay selection process for the online decision-making, which uses a tradeoff between obtaining more link information to establish better cooperative relaying and minimizing the time cost for dual-hop link estimation to achieve higher throughput. Dynamic programming is used to construct the throughput-optimal control policy for a typically heterogeneous Rayleigh fading environment, and determines which relay to probe and when to transmit the data. Additionally, we extend the main results to mixed Rayleigh/Rician link scenarios, i.e., where one side of the relaying link experiences Rayleigh fading while the other has Rician distribution. Numerical results validate the effectiveness and superiority of our proposed relaying scheme, e.g., it achieves at least 107% throughput gain compared with the state of the art solution.

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.

Relay Selection Algorithm for Two-way Multiple Relay Channels (양방향 다중 중계기 채널에서의 중계기 선택 기법)

  • Kang, Yoo-Keun;Lee, Jae-Hong
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.134-143
    • /
    • 2009
  • In this paper, we propose a new relay selection algorithm for a two-way multiple relay channel. In the two-way multiple relay channel, two users exchange information with each other via multiple relays. The relays use a decode-and-forward or amplify-and-forward protocol, and exploit the combining process of the received packets to reduce the required channel resources. In the multiple relay network, diversity gain is achieved as the number of relays increases, and various schemes are proposed. In this paper, we propose a single best relay selection scheme based on instantaneous channel conditions. First of all, relays obtain the instantaneous channel state information in the handshaking process, and a single best relay is selected in a distributed methods prior to data transmissions. The relay selection metric is proposed so that the end-to-end channel condition is evaluated based on the intantaneous channel state informations. Simulation results show that the proposed relay selection algorithm achieve the increased throughput and diversity order when the number of potential relays is increased.

Bit Error Rate of Underlay Decode-and-Forward Cognitive Networks with Best Relay Selection

  • Ho-Van, Khuong;Sofotasios, Paschalis C.;Alexandropoulos, George C.;Freear, Steven
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.162-171
    • /
    • 2015
  • This paper provides an analytic performance evaluation of the bit error rate (BER) of underlay decode-and-forward cognitive networks with best relay selection over Rayleigh multipath fading channels. A generalized BER expression valid for arbitrary operational parameters is firstly presented in the form of a single integral, which is then employed for determining the diversity order and coding gain for different best relay selection scenarios. Furthermore, a novel and highly accurate closed-form approximate BER expression is derived for the specific case where relays are located relatively close to each other. The presented results are rather convenient to handle both analytically and numerically, while they are shown to be in good agreement with results from respective computer simulations. In addition, it is shown that as in the case of conventional relaying networks, the behaviour of underlay relaying cognitive networks with best relay selection depends significantly on the number of involved relays.