• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3542-3566
• /
• 2018

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.3
• /
• pp.172-179
• /
• 2013

In this paper, we consider network-coded bi-directional relaying (NCBR) schemes over an asymmetric channel, in which bi-directional links have the different channel quality, as well as the asymmetric traffic load. In order to deal with asymmetric nature, two different types of NCBR schemes are considered: network coding after padding (NaP) and network coding after fragmentation (NaF). Even if NaP has been known as only a useful means of dealing with the asymmetry in traffic load up to now, our analysis shows that its gain can be significantly lost by the asymmetry in channel quality, under the given bit error performance constraint. Furthermore, it is shown that NaF always outperforms NaP, as well as traditional bi-directional relaying scheme.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.717-726
• /
• 2015

In this paper, we study an asymmetric two-way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time-division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy-efficient transmission. Our scheme is based on the asymmetric level of the two source nodes' target signal-to-noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.146-147
• /
• 2010

본 논문은 차세대 양방향 이동통신의 상향링크 전송용량 증대를 위한 다중 단말 기회 중계(opportunistic relaying) 기법을 제안한다. 제안된 기법은 단일 안테나(single antenna) 기지국과 다수의 단일 안테나 단말이 있는 협력 네트워크(cooperative network)에서 시간블록 단위로 라운드 로빈(Round-Robin)과 동일한 공정성(fairness)을 보장하면서 높은 불능확률 성능 이득을 제공한다. 컴퓨터 모의 실험결과를 통해 제안된 기법의 성능 이득 크기를 보이며, 기존의 중계 기법보다 높은 다이버시티 차수를 가짐을 확인한다.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.114-121
• /
• 2010

In this paper, an auctioning strategy is proposed for cellular networks that ensures net energy savings. The pricing scheme, in conjunction with a two dimensional bid structure, incentivizes cooperation at the terminal nodes for better interference management at receivers and for cooperative relaying. It is shown that, for the proposed auctioning strategy, network operators are guaranteed revenue gains, mobile nodes' dominant strategy is to bid their true valuation of their energy resources, and overall effective energy gains occur under the assumption of a reserve price for bidding. Simulation results show that significant energy savings can be achieved by employing this auctioning mechanism for a 3G cellular set-up.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.371-372
• /
• 2012

본 논문은 협력 네트워크(cooperative network)에서 무선 채널의 보안성(security) 강화를 위한 자가 전파방해(self-jamming) 기반 기회적 중계(opportunistic relaying) 기법을 제안한다. 단일 송신 단말 (source)과 단일 수신 단말(destination)이 다중 중계 단말(relay)의 협력을 통해 송수신하는 이중 홉(dualhop) 네트워크에서 도청 단말(eavesdropper)에 의한 정보 절취를 최소화하기 위해 자가 전파방해 기법과 기회적 중계 기법을 결합한다. 이를 통해 무선 채널의 방송(broadcasting) 특성에 기인한 도청 용이성을 저하 시키고, 다중 중계 단말의 송신 전력을 최소화하여 협력 네트워크의 수명(lifetime)을 연장한다. 컴퓨터 모의실험 결과를 통해 제안된 기법이 다중 중계기가 있는 이중 홉 협력 네트워크에서 보안 전송률(secrecy rate)의 불능확률(outage probability) 성능을 제고함을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.121-122
• /
• 2011

본 논문에서는 무선 협력 네트워크(wireless cooperative network)의 전송 신뢰성과 공정성 향상을 위한 비례공정 중계(proportional-fair relaying) 기법을 제안한다. 다중 단말과 단일 기지국이 있는 다원 접속(multiple access) 환경에서 저속 페이딩(slow fading)에 의한 성능 열화를 저감하면서 단말간 자원 사용 공정성 보장하기 위해 비례공정 전송 기법과 중계 기법 결합한다. 이를 통해 기존 기회적(opportunistic) 전송 기법의 비대칭 채널(asymmetric channel)에서의 자원 사용 불공정성을 해결하면서 깊은 페이딩(deep fading)에 의한 데이터 무선 전송 손실을 최소화 한다. 컴퓨터 모의실험 결과를 통해 제안된 기법이 공정성 제한(fairness constraint)이 있는 다원 접속 환경에서 불능 확률(outage probability) 성능을 제고함을 보인다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.47-53
• /
• 2013

In this paper, we propose an incremental cooperative transmission protocol in two-way underlay cognitive radio networks. In the proposed protocol, two secondary sources attempt to transmit their packet to each other with help of a secondary relay under interference constraint. For performance evaluation, we derive exact closed-form expressions of average outage probability over Rayleigh fading channel. Then, we perform Monte Carlo simulations to verify the derivations. Results present that the simulation and theoretical results are in good agreement and the outage performance of the proposed protocol is better than that of two-way direct transmission protocol.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.39-45
• /
• 2013

In this paper, we propose a cooperative relaying protocol using Fountain codes for secondary network under interference constraint. In the proposed protocol, a secondary source uses Fountain codes to transmit its message to a secondary destination with help of a secondary relay. The secondary source and relay operate in the underlay model, in which they must adapt their transmit power so that the interference caused at a primary user is lower than an allowable threshold. To evaluate performance of the proposed protocol, we derive the expressions of average number of transmission times over Rayleigh fading channel. Various Monte-Carlo simulations are presented to verify the derivations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.