• Title/Summary/Keyword: Relay node selection

Search Result 74, Processing Time 0.021 seconds

Cooperative Transmission Protocol based on Opportunistic Incremental Relay Selection over Rayleigh fading channels (레일리 페이딩 채널 상에서 기회주의적 증분형 중계기 선택 기법을 기반으로 한 협력 전송 알고리즘)

  • Xuyen, Tran Thi;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.53-58
    • /
    • 2011
  • In this paper, we firstly propose a novel cooperative transmission protocol, which utilizes the advantages of mid-notes in the route from the source to the destination. Taking benefits from balancing between the received packet from the source and acknowledge message from the destination, the mid-node between the source and the destination is firstly considered to be the broadcaster. If its signal is successfully received from the source, it leads to consider the next nodes, which has closer distance to the destination than it. If one of these nodes correctly receives the signal, it performs broadcasting the signal to the destination instead of mid-node. Otherwise, the mid-node directs attention to these nodes being near to the destination. As the result, some nodes are unnecessary to be considered and passed over time. After that, we analyze some published selection relaying schemes based on geographic information to choose the best nodes instead of the instantaneous SNR as before. Finally, simulation results are given to demonstrate the correctness of the performance analyses and show the significant improvement of the selection relaying schemes based geographic information compared to the other ones.

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF

Security-reliability Analysis for a Cognitive Multi-hop Protocol in Cluster Networks with Hardware Imperfections

  • Tin, Phu Tran;Nam, Pham Minh;Duy, Tran Trung;Voznak, Miroslav
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.3
    • /
    • pp.200-209
    • /
    • 2017
  • In this paper, we investigate the tradeoff between security and reliability for a multi-hop protocol in cluster-based underlay cognitive radio networks. In the proposed protocol, a secondary source communicates with a secondary destination via the multi-hop relay method in the presence of a secondary eavesdropper. To enhance system performance under the joint impact of interference constraint required by multiple primary users and hardware impairments, the best relay node is selected at each hop to relay the source data to the destination. Moreover, the destination is equipped with multiple antennas and employs a selection combining (SC) technique to combine the received data. We derive closed-form expressions of the intercept probability (IP) for the eavesdropping links and the outage probability (OP) for the data links over a Rayleigh fading channel. Finally, the correction of our derivations is verified by Monte-Carlo simulations.

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.

Enhancement OLSR Routing Protocol using Particle Swarm Optimization (PSO) and Genrtic Algorithm (GA) in MANETS

  • Addanki, Udaya Kumar;Kumar, B. Hemantha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.131-138
    • /
    • 2022
  • A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

On the Capacity for the Secondary User with Primary Full Duplex Relay Network in Spectrum Sharing Systems (주파수 공유 시스템에서 일차 사용자가 양방향 중계기를 사용할 때의 이차 사용자의 통신 용량 분석)

  • Kim, Hyung-Jong;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.39-45
    • /
    • 2012
  • This paper investigates the capacity for the secondary user with the primary full duplex relay (FDR) network in spectrum sharing systems. For sharing the spectrum of the primary user, sharing scheme under the various primary network should be investigated. However, the conventional works only consider the point-to-point primary communication system. When the FDR node is used for the primary networks, both primary relay and destination suffer the interference from the secondary transmitter simultaneously. Thus, the strict interference constraint should be considered to share the spectrum of the primary user. Therefore, we investigate the capacity of the secondary user with the primary FDR network under the average and peak received-power constraints. In addition, we analyze the performance degradation by the selection of the worst interference channels to consider interference constraint in this system. Through the numerical results, the capacities of the primary and secondary users under the average received-power is superior to the that under the peak received-power constraint.

Study of Set-Operation Based Analytical Approach for OAF Relay Systems over Rayleigh Fading channels (레일리 페이딩 채널에서의 OAF 릴레이 시스템에 대한 집합 연산 기반의 분석 기법에 관한 연구)

  • Ko, Kyun-Byoung;Seo, Jeong-Tae;Kim, Hag-Wone
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.198-204
    • /
    • 2011
  • In this letter, another analytical approach for the opportunistic amplify-and-forward (OAF) relay systems is proposed over Rayleigh fading channels. Based on set-operation at the selected relay node, its selection probability as the best relay is derived and then, the probability density function (PDF) of the received instantaneous signal-to-noise ratio (SNR) is expressed as a more tractable form in which the number of summations and the length of each summation are specified. Then, the average error rate, outage probability, and average channel capacity are obtained as approximated closed-forms. Simulation results are finally presented to validate that the proposed analytical expressions can be a unified frame work covering all Rayleigh fading channel conditions. Furthermore, it is confirmed that OAF schemes can outperform the other non-selective schemes on the average error rate, outage probability, and average channel capacity.

An Effective Route Selection Scheme with Considering Traffic Density in VANET

  • An, Do-Sik;Cho, Gi-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.623-629
    • /
    • 2010
  • A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

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.

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.