• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.202-215
• /
• 2023

This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2081-2101
• /
• 2016

Successive interference cancellation (SIC) is considered to be a promising technique to mitigate multi-user interference and achieve concurrent uplink transmissions, but the optimal power allocation (PA) issue for SIC users is not well addressed. In this article, we focus on the optimization of the PA ratio of users on an SIC channel and analytically obtain the optimal PA ratio with regard to the signal-to-interference-plus-noise ratio (SINR) threshold for successful demodulation and the sustainable demodulation error rate. Then, we design an efficient resource allocation (RA) scheme using the obtained optimal PA ratio. Finally, we compare the proposal with the near-optimum RA obtained by a simulated annealing search and the RA scheme with random PA. Simulation results show that our proposal achieves a performance close to the near-optimum and much higher performance than the random scheme in terms of total utility and Jain's fairness index. To demonstrate the applicability of our proposal, we also simulate the proposal in various network paradigms, including wireless local area network, body area network, and vehicular ad hoc network.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2659-2669
• /
• 1999

This paper a heuristic, clustering based task allocation scheme applicable to non-directed task graph on a distributed system. This scheme firstly builds a task-machine graph, and then applies a clustering process where in a pair of tasks that are connected to the highest cost edge is merged into a big one or a task is allocated to a machine. During the process, the proposed scheme figure out a machine onto which the task allocation may cause deduction of large communication overhead that has incurred between the task and tasks that are already allocated to the machine while the computation costs is slightly increased in the machine. Simulation for the various task graphs shows that the scheduling using the proposed scheme result far better than ones by using the traditional schemes. A comparison with optimal task scheduling also promises that our scheme derives optimal results more occasionally than the traditional schemes do.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5381-5399
• /
• 2016

Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

• ETRI Journal
• /
• v.38 no.4
• /
• pp.746-756
• /
• 2016

Owing to the intermittent power generation of renewable energy sources (RESs), future wireless cellular networks are required to reliably aggregate power from retailers. In this paper, we propose a distributed power allocation (DPA) scheme for base stations (BSs) powered by retailers with heterogeneous RESs in order to deal with the unreliable power supply (UPS) problem. The goal of the proposed DPA scheme is to maximize our well-defined utility, which consists of power satisfaction and unit power costs including added costs as a non-subscriber, based on linear and quadratic cost models. To determine the optimal amount of DPA, we apply dual decomposition, which separates the master problem into sub-problems. Optimal power allocation from each retailer can be obtained by iteratively coordinating between the BSs and retailers. Finally, through a mathematical analysis, we show that the proposed DPA can overcome the UPS for BSs powered from heterogeneous RESs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3524-3542
• /
• 2017

In a single-source and multi-relay amplify-forward (AF) cooperative network, the outage probability and the power allocation are two key factors to influence the performance of an entire system. In this paper, an optimized AF relay selection by an exclusive method and near optimal power allocation (NOPA) is proposed for both good outage probability and power efficiency. Given the same power at the source and the relay nodes, a threshold for selecting the relay nodes is deduced and employed to minimize the average outage probability. It mainly excludes the relay nodes with much higher thresholds over the aforementioned threshold and thus the remainders of the relay nodes participate in cooperative forwarding efficiently. So the proposed scheme can improve the utility of the resources in the cooperative multi-relay system, as well as reduce the computational complexity. In addition, based on the proposed scheme, a NOPA is also suggested to approach sub-optimal power efficiency with low complexity. Simulation results show that the proposed scheme obtains about 2.1dB and 5.8dB performance gain at outage probability of $10^{-4}$, when compared with the all-relay-forward (6 participated relays) and the single-relay-forward schemes. Furthermore, it obtains the minimum outage probability among all selective relay schemes with the same number of the relays. Meanwhile, it approaches closely to the optimal exhaustive scheme, thus reduce much complexity. Moreover, the proposed NOPA scheme achieves better outage probability than those of the equal power allocation schemes. Therefore, the proposed scheme can obtain good outage probability, low computational complexity and high power efficiency, which makes it pragmatic efficiently in the single-source and multi-relay AF based cooperative networks.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.215-218
• /
• 2003

본 논문에서는 다수의 셀로 구성된 CDMA 시스템의 순방향 링크를 대상으로 지연 및 PRER 제약과 전송출력 제약 하에서 데이터 전송률과 사용자간 형평성을 반영한 총효용을 최대화하기 위한 각 기지국의 총평균전송출력과 각 사용자의 데이터 전송률 할당 체계를 제시한다. 실험을 통해 모든 셀을 동시에 고려하는 OPARS(Optimal Power and Rate Allocation Scheme)가 각 셀을 개별적으로 고려하는 SPRAS(Separate Power and Rate Allocation Scheme)에 비해 더 좋은 해를 제공한다는 것을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3018-3036
• /
• 2013

In this paper, we investigate power allocation scheme and outage performance for a physical-layer network coding (PNC) relay based secondary user (SU) communication in cognitive multi-antenna relay networks (CMRNs), in which two secondary transceivers exchange their information via a multi-antenna relay using PNC protocol. We propose an optimal energy-efficient power allocation (OE-PA) scheme to minimize total energy consumption per bit under the sum rate constraint and interference power threshold (IPT) constraints. A closed-form solution for optimal allocation of transmit power among the SU nodes, as well as the outage probability of the cognitive relay system, are then derived analytically and confirmed by numerical results. Numerical simulations demonstrate the PNC protocol has superiority in energy efficiency performance over conventional direct transmission protocol and Four-Time-Slot (4TS) Decode-and-Forward (DF) relay protocol, and the proposed system has the optimal outage performance when the relay is located at the center of two secondary transceivers.

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

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.