• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1569-1586
• /
• 2015

This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l₁-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3887-3907
• /
• 2015

This paper introduces a full duplex single secondary user multiple-input multiple-output (FD-SSU-MIMO) cognitive radio network, where secondary user (SU) opportunistically accesses the authorized spectrum unoccupied by primary user (PU) and transmits data based on FD-MIMO mode. Then we study the network achievable average sum-rate maximization problem under sum transmit power budget constraint at SU communication nodes. In order to solve the trade-off problem between SU's sensing time and data transmission time based on opportunistic spectrum access (OSA) and the power allocation problem based on FD-MIMO transmit mode, we propose a simple trisection algorithm to obtain the optimal sensing time and apply an alternating optimization (AO) algorithm to tackle the FD-MIMO based network achievable sum-rate maximization problem. Simulation results show that our proposed sensing time optimization and AO-based optimal power allocation strategies obtain a higher achievable average sum-rate than sequential convex approximations for matrix-variable programming (SCAMP)-based power allocation for the FD transmission mode, as well as equal power allocation for the half duplex (HD) transmission mode.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.18-25
• /
• 2020

In the fifth generation (5G) and beyond 5G (B5G) mobile communication, non-orthogonal multiple access (NOMA) has attracted great attention due to higher spectral efficiency and massive connectivity. We investigate the impacts of the channel estimation errors on the bit-error rate (BER) of NOMA, especially with the single-user decoding (SUD) receiver, which does not perform successive interference cancellation (SIC), in contrast to the conventional SIC NOMA scheme. First, an analytical expression of the BER for SUD NOMA with channel estimation errors is derived. Then, it is demonstrated that the BER performance degrades severely up to the power allocation less than about 20%. Additionally, we show that for the fixed power allocation of 10% in such power allocation range, the signal-to-noise (SNR) loss owing to channel estimation errors is about 5 dB. As a consequence, the channel estimation error should be considered for the design of the SUD NOMA scheme.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.559-567
• /
• 2014

In this paper, a framework for power allocation of downlink transmissions in orthogonal frequency division multiple access-based decode-and-forward cellular relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Advanced power allocation schemes are crucial for such networks. The optimal relay power allocation which maximizes the data rate is proposed as an upper bound, by finding the optimal power requirement for each user based on knapsack problem formulation. Then by considering the fairness, a new relay power allocation scheme, called weighted-based scheme, is proposed. Finally, an efficient power reallocation scheme is proposed to efficiently utilize the power and improve the data rate of the network. Simulation results demonstrate that the proposed power allocation schemes can significantly improve the data rate of the network compared to the traditional scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.6
• /
• pp.477-487
• /
• 2005

As embedded system grows in size and complexity, the importance of the technique for dynamic memory allocation has increased. The objective of this paper is to measure the performance of dynamic memory allocation by varying both hardware and software design parameters for embedded systems. Unlike torrent performance evaluation studies that have presumed the single threaded system with single address spate without OS support, our study adopts realistic environment where the embedded system runs on Linux OS. This paper contains the experimental performance analyses of dynamic memory allocation method by investigating the effects of each software layer and some hardware design parameters. Our quantitative results tan be used to help system designers design high performance, low power embedded systems.

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

• Korean Management Science Review
• /
• v.25 no.1
• /
• pp.55-74
• /
• 2008

In recent warfare, the performance improvement of air weapon systems enables an aircraft to strike multiple targets on a single sortie. Further, aircrafts attacking targets may carry out an operation as a strike package that is composed of bombers, escort aircrafts, SEAD (Suppression of Enemy Air Defenses) aircrafts and etc. In this paper, we present an aircraft allocation model that allocates multiple targets to a single sortie in the form of a strike package. A mixed integer programming is developed and solved by using a commercially available software. The new model is better than existing ones because not only it allocates aircrafts to multiple targets but also it models the concept of the strike package. We perform a computational experiment to compare the result of the new model with that of existing ones, and perform sensitivity analysis by varying a couple of important parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.53-63
• /
• 1997

In this paper, we present a new macroblock-based bit allocation scheme in multiple MPEG-1 video encoders system and a single multiplexer over a single channel. The proposed scheme models the relations between fate(Bits/MB) and distortion(MSE/MB), rate and quantizer parameter(QP), distortion and quantizer parameter, respectively, in the same form. By using these relations, we minimize the Larangian cost function to obtain a bit allocation scheme based on macroblock unit. Experimental results show that the proposed scheme can reduce MSE compared to other conventional buffer-based rate control methods, i.e. independent buffer control method and shared common buffer control one. And we confirmed, through computer simulation, that the proposed scheme can be effectively modified to maintain the objective quality of a specific video service at a constant level.