• 제목/요약/키워드: relay selection algorithm

검색결과 66건 처리시간 0.021초

Relay Selection Scheme Based on Quantum Differential Evolution Algorithm in Relay Networks

  • Gao, Hongyuan;Zhang, Shibo;Du, Yanan;Wang, Yu;Diao, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3501-3523
    • /
    • 2017
  • It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

Distributed Relay Selection Algorithm for Cooperative Communication

  • Oo, Thant Zin;Hong, Choong-Seon
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(D)
    • /
    • pp.213-214
    • /
    • 2011
  • This paper presents a distributed relay selection algorithm for cooperative communication. The algorithm separates the decision making into two simple steps, decision making for employing cooperative communication and decision making for relay selection.

Swarm Intelligence-based Power Allocation and Relay Selection Algorithm for wireless cooperative network

  • Xing, Yaxin;Chen, Yueyun;Lv, Chen;Gong, Zheng;Xu, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1111-1130
    • /
    • 2016
  • Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

Packet Scheduling for Cellular Relay Networks by Considering Relay Selection, Channel Quality, and Packet Utility

  • Zhou, Rui;Nguyen, Hoang Nam;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • 제11권5호
    • /
    • pp.464-472
    • /
    • 2009
  • In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

Joint Relay Selection and Power Allocation for Two-way Relay Channels with Asymmetric Traffic Requirements

  • Lou, Sijia;Yang, Longxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권8호
    • /
    • pp.1955-1971
    • /
    • 2013
  • This paper studies relay selection and power allocation for amplify-and-forward (AF) based two-way relay networks (TWRN) with asymmetric traffic requirements (ATR). A joint relay selection and power allocation algorithm is proposed to decrease the outage probability of TWRN with ATR. In this algorithm, two sources exchange information with the help of the relay during two time slots. We first calculate the optimal power allocation parameters based on instantaneous channel state information (CSI), and then derive a tight lower bound of outage probability. Furthermore, we propose a simplified relay selection criterion, which can be easily calculated as harmonic mean of instantaneous channel gains, according to the outage probability expressions. Simulation results verified the theoretical analyses we presented. It is shown that the outage probability of our algorithm improves 3-4dB comparing with that of other existing algorithms, and the lower bound is tight comparing with actual value for the entire signal-to-noise ratio (SNR) region.

릴레이 네트워크에서의 협업전송 프로토콜 (Cooperative transmission protocol in the relay network)

  • 고상;박형근
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 추계학술대회
    • /
    • pp.1046-1048
    • /
    • 2009
  • 협업통신은 다중경로페이딩의 문제를 해결하고 전송전력소모를 감소시키기위한 효과적인 기술이다. 릴레이선택과 전력할당은 협업통신의 성능을 결정하는 중요한 요소이다. 본 논문에서는 센서네트워크에서 네트워크수명 극대화를 위해 새로운 형태의 다중 릴레이선택 방법과 전력할당 알고리즘을 제안한다. 제안하는 릴레이 선택 알고리즘은 채널상태 뿐아니라 각 노드의 잔여전력을 함께 고려함으로써 전송전력을 극소화하고 네트워크의 수명을 증가시킨다. 시뮬레이션결과는 제안된 알고리즘이 기존의 방식에비해 더 긴 네트워크 수명을 갖을 수 있음을 보여준다.

  • PDF

효율적인 D2D 메시지 확산을 위한 최외곽 k개의 릴레이 선택 알고리즘 (Farthest-k relay selection algorithm for efficient D2D message dissemination)

  • 한세호;이호원
    • 한국정보통신학회논문지
    • /
    • 제21권3호
    • /
    • pp.543-548
    • /
    • 2017
  • Epidemic 라우팅 프로토콜 기반의 메시지 확산 방식은 메시지를 수신한 기기들이 모두 릴레이를 수행하기 때문에 기기들의 전송 커버리지 중복으로 인한 메시지 중복 수신 문제가 빈번하게 발생한다. 따라서 본 논문에서는 이러한 문제점을 완화하기 위해 전송 범위 내에 존재하는 기기들 중 최외곽에 위치한 k개의 기기들만이 메시지 릴레이를 수행하는 최외곽 k개의 릴레이 선택 알고리즘을 제안하고 기존방식과 성능 비교분석을 수행한다. 포함 확률과 총 수신 메시지의 수 그리고 전송 효율에 대한 시뮬레이션 결과를 통해 제안 방안의 우수성을 증명한다.

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

  • 고상;박형근
    • 전기학회논문지
    • /
    • 제58권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 distributed relay selection algorithm for two-hop wireless body area networks

  • Kim, Seung-Ku;Joo, Yang-Ick
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제41권2호
    • /
    • pp.156-162
    • /
    • 2017
  • This paper investigates two-hop extension communication in wireless body area networks. Many previous studies have demonstrated that two-hop extended topology outperforms single-hop topology. Although many researchers have proposed using two-hop extension communication to improve link reliability, no one has considered using a relay selection algorithm or provided a suitable solution for wireless body area networks. The design goal of the proposed algorithm is selecting a proper relay node to retransmit failed packets distributively. The proposed algorithm configures the carrier sensing period to choose one relay node promptly without requiring additional interaction. We analyze the link conditions corresponding to various body postures and investigate which factors are proper to determine the carrier sensing period. The empirical results show that the proposed algorithm reduces the expected number of transmissions required to deliver a packet successfully.

전력 제한된 무선 센서네트워크에서 협력 다이버시티를 위한 전력인지 릴레이 선택 알고리즘 (Power-aware Relay Selection Algorithm for Cooperative Diversity in the Energy-constrained Wireless Sensor Networks)

  • 고상;박형근
    • 한국통신학회논문지
    • /
    • 제34권10A호
    • /
    • pp.752-759
    • /
    • 2009
  • 본 논문에서는 간단히 한국통신학회의 논문작성법에 대하여 설명하고자 합니다. (스타일-요약본문)협력 다이버시티 기법은 다중경로 페이딩 환경을 효과적으로 극복할 수 있는 통신 기술이다. 이 기술을 에너지 제한된 무선 센서 네트워크에 적용하기 위해서는 무선 센서네트워크에서 가장 중요한 성능요소인 네트워크 수명을 고려한 릴레이 선택과 전력 할당 방법 등이 설계되어야 한다. 본 논문에서는 네트워크 수명을 최대화하기 위해 노드의 잔여전력을 고려한 새로운 다중 릴레이 선택 및 전력 할당 알고리즘을 제시하였다. 제시한 알고리즘은 2단계로 구분 되어 있다. 먼저 각 노드의 채널 상태를 고려하여 릴레이 후보노드를 선택 한 후 각 노드의 잔여전력을 고려하여 전력을 할당함으로써 전체 송신전력을 최소화함과 동시에 네트워크수명을 극대화 하도록 하였다. 본 논문에서 제시한 알고리즘은 기본적으로 AF(Amplify and Forward) 릴레이 모델을 바탕으로 하였으며 시뮬레이션을 통해 제안한 방식이 기존의 방식에 비해 더 높은 네트워크 수명을 가지는 것을 입증할 수 있었다.