• 한국정보통신학회논문지
• /
• 제19권2호
• /
• pp.287-292
• /
• 2015

본 논문에서는 사용자들의 밀집도 정보를 기반으로 설정된 목표지역과 릴레이 단말의 수를 제한한 환경에서 광고 확산을 위한 최대 거리 기반 릴레이 단말 선택 알고리즘과 최대 효율 기반 릴레이 단말 선택 알고리즘의 성능을 비교 분석하였다. 최대 거리 기반 릴레이 단말 선택 알고리즘은 단말간의 거리 정보만을 이용하여 릴레이 단말을 선택하고, 최대 효율 기반 릴레이 단말 선택 알고리즘은 설정된 목표지역들을 활용하여 최대 광고 효율을 위한 광고 확산 루트를 설정하였다. 시뮬레이션을 통해 광고를 섹터 수의 변화에 따른 성공적으로 수신한 전체 사용자 수와 전송 효율에 대한 성능을 비교하여, 최대 거리 기반 릴레이 단말 선택 알고리즘 보다 최대 효율 기반 릴레이 단말 선택 알고리즘 성능의 우수성에 대해 분석하였다.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.240-249
• /
• 2011

Cooperative diversity protocols have attracted a great deal of attention since they are thought to be capable of providing diversity multiplexing tradeoff among single antenna wireless devices. In the high signal-to-noise ratio (SNR) region, cooperation is rarely required; hence, the spectral efficiency of the cooperative protocol can be improved by applying a proper cooperation selection technique. In this paper, we present a simple "cooperation selection" technique based on instantaneous channel measurement to improve the spectral efficiency of cooperative protocols. We show that the same instantaneous channel measurement can also be used for relay selection. In this paper two protocols are proposed-proactive and reactive; the selection of one of these protocols depends on whether the decision of cooperation selection is made before or after the transmission of the source. These protocols can successfully select cooperation along with the best relay from a set of available M relays. If the instantaneous source-to-destination channel is strong enough to support the system requirements, then the source simply transmits to the destination as a noncooperative direct transmission; otherwise, a cooperative transmission with the help of the selected best relay is chosen by the system. Analysis and simulation results show that these protocols can achieve higher order diversity with improved spectral efficiency, i.e., a higher diversity-multiplexing tradeoff in a slow-fading environment.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.433-441
• /
• 2010

Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.377-384
• /
• 2011

Cooperative beamforming has previously been proven to be an efficient way to improve the cooperative diversity. This method generally requires all relay nodes to participate in beamforming, which can be seen as "all participate" cooperative beamforming. However, not all relay nodes have constructive impacts on the end-to-end bit error rate (BER) performance. Based on this observation, we propose a new cooperative scheme which only selects those "appropriate" relay nodes to perform cooperative beamforming. Such relay nodes can be simply determined with mean channel gains. Therefore, the selection complexity is significantly reduced as global instantaneous channel state information is not required. This scheme guarantees that energy is only allocated to the "appropriate" relay nodes, and hence provides superior diversity. We also prove that power allocation among source and selected relay nodes is a convex problem, and can be resolved with lower computational complexity. Simulation results demonstrate that our scheme achieves an essential improvement in terms of BER performance for both optimal and limited feedback scenarios, as well as high energy-efficiency for the energy-constrained networks.

• 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.

• 한국정보통신학회논문지
• /
• 제21권3호
• /
• pp.543-548
• /
• 2017

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

• 한국통신학회논문지
• /
• 제34권2A호
• /
• pp.107-112
• /
• 2009

Spectral efficiency of current two-phase cooperative communications protocols is low since in the second time the relay forwards the same signal received from the source to the destination, the source keeps silent in this time. In this paper, we propose a novel cooperative communications protocol where the signal needed to transmit to the destination is sent in both phases, the source and the relay also transmit different signal to the destination thus no loss of spectral efficiency. This protocol performs signal selection based on log-likelihood ratio (LLR) at relay and maximum likelihood (ML) detection at destination. While existing protocols pay for a worse performance than direct transmission in the low SNR regime which is of special interest in ad hoc networks, ours is better over the whole range of SNR. In addition, the proposal takes advantages of bandwidth efficiency, long delay and interference among many terminals in ad hoc network. Simulation results show that the proposed protocol can significantly save total energy for wireless ad hoc networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권8호
• /
• pp.3399-3419
• /
• 2020

In the Vehicular Ad-hoc Network (VANET), the data transmission of time-sensitive applications requires low latency, such as accident warnings, driving guidance, etc. However, frequent changes of topology in VANET will result in data transmission failures. In order to improve the efficiency of VANETs data transmission and increase the timeliness of data, this paper proposes a relay scheme based on Recurrent Neural Network (RNN) trajectory prediction, which can be used to select the optimal relay vehicle to transmit data. The proposed scheme learns vehicle trajectory in a distributed manner and calculates the predicted trajectory, and then the optimal vehicle can be selected to complete the data transmission, which ensures the timeliness of the data. Finally, we carry out a set of simulations to demonstrate the performance of the algorithm. Simulation results show that the proposed scheme enhances the timeliness of the data and the accuracy of the predicted driving trajectory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4087-4102
• /
• 2014

Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

• 정보과학회 논문지
• /
• 제42권6호
• /
• pp.791-800
• /
• 2015

본 논문은 다중 홉 무선 네트워크 환경에서 브로드캐스트 전송 효율성 뿐 아니라 신뢰도도 우수한 기여도 기반 기회적 플러딩 기법을 제안한다. 브로드캐스트 트리를 전송 결과와 관련 없이 미리 결정하면, 무선 네트워크의 내재적 불안정성으로 지정된 릴레이 노드가 패킷을 수신하지 못할 수 있다. 본 논문에서 제안하는 기여도 기반 기회적 플러딩 기법은 릴레이 노드를 전송 결과를 기반으로 선택하는 기회적 전송의 개념을 사용하여 신뢰도를 제고하였다. 또한 전체 네트워크에 대한 단말 기여도에 따라 릴레이 우선 순위를 조정하여 불필요한 릴레이를 제거하고 전송 효율을 높였다. NS-3 시뮬레이터를 활용하여 제안 기법을 블라인드 플러딩, 그리고 도미넌트 프루닝과 비교하였다. 성능 분석 결과 제안 프로토콜은 블라인드 플러딩에 비해 릴레이 횟수에 기초한 효율 관점에서 35%, 도미넌트 프루닝에 비해 수신 노드 수에 기초한 신뢰도 관점에서 20~70% 수준의 성능 향상을 얻었다.