• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제16권6호
• /
• pp.165-175
• /
• 2016

A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels to process multiple-data queries in the environment where query profiles and query request rates are given, and proposes a new data allocation scheme named QBDA. The proposed scheme allows the query with higher request rate to have higher priority to schedule its data items and introduces the concept of marking to reduce data conflicts. Simulation is performed to evaluate the performance of QBDA. The simulation results show that the proposed scheme outperforms other schemes in terms of the average response time since it can process queries with high request rate fast and show a very desirable characteristics in the aspects of query data adjacency and data conflict probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제39A권12호
• /
• pp.729-738
• /
• 2014

In this paper, we propose interference avoidance resource allocation scheme based on graph-coloring algorithm to introduce performance gain using spatial reuse in D2D (Device-to-Device) system. By assigning multiple D2D pairs to a single D2D resource, interference from neighboring D2D pairs is inevitable, which leads to performance degradation. Therefore, we first introduce the feedback information and the method considering the amount of information that can be practically provided by a D2D pair. Then, we propose how to construct a graph, which is corresponding to the D2D system, using the feedback information and adopt a graph-coloring algorithm to efficiently avoid interference. Simulation results show that the proposed resource allocation scheme outperforms traditional resource allocation schemes in both overall sum rate and spectral efficiency of D2D system while reducing the outage probability. Moreover, the outage probability, which indicates a failure rate of D2D communication, can be reduced by adopting the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제30권3C호
• /
• pp.147-152
• /
• 2005

In this paper, we proposed a method for compressing the static video test patterns in high quality to test the picture quality in DTV. In our method, we use the fact that the generated bits and average quantization value have almost identical distribution characteristics per each GOP and we propose a new target bit allocation method suitable for compressing the static test pattern while the target bit allocation method in MPEG-2 TM5 is suitable for the moving picture. The proposed target bit allocation method is to maintain the high quality video continuously by using the normalized complexities which are updated or maintained by means of picture qualities at each GOP. Experiment result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제42권11호
• /
• pp.1-12
• /
• 2005

In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• Journal of Korean Society of Transportation
• /
• 제25권1호
• /
• pp.49-59
• /
• 2007

This study has examined the allocation of risk in Korea's private provided Infrastructure(PPI) with the following contents (1) Developing a quantitative risk allocation model for Korea's PPI and (2) examining the implication of changes in the minimum revenue guarantees (MRG) clause of government legislation using the developed empirical model. The model of this study adopts and extends H. Yamaguchi's model developed in 2002. To investigate Korea's actual risk allocation deals, the author incorporated the MRG framework. The payment related to the MRG is indeterminable. Hence. the average MRG rate was calculated using probabilistic risk analysis. The risk allocation model is applied to the two eases to validate the model and evaluate the project's VFM(Value for Money). As the revenue guarantee rate is lowered, the government subsidies are increased. This in turn worsens VFM. The same relationship is true when the revenue guarantee Period is shortened.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제26권9호
• /
• pp.1340-1346
• /
• 2022

In this paper, we consider a downlink non-orthogonal multiple access (NOMA) using multiple transmit antennas, where the transmit antenna selection scheme is used to reduce the system complexity. Thus, in this paper, we propose radio resource allocation and receiver selection schemes in order to improve the outage probability performance of the downlink NOMA system using the transmit antenna selection scheme. In particular, the receiver selection scheme is a method of grouping the receivers to improve the outage probability performance, and the radio resource allocation scheme is a method of allocating radio resources to each group in order to enhance the outage probability performance. In addition, through the computer simulation under the assumption of independent Rayleigh fading channels, we show that the proposed radio resource allocation and receiver selection schemes can improve the outage probability performance at the expense of the sum rate performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제18권11호
• /
• pp.130-137
• /
• 2017

To maintain traffic safety during the target lifetime of bridges, it is essential to secure an appropriate maintenance budget and allocate that budget appropriately. This paper proposes a reasonable budget allocation system that considers various impact factors to improve the conventional budget allocation method simply considering the bridge scale. The maintenance action rate model and the unit cost model based on the prior maintenance history were developed to allocate appropriately the bridge maintenance budget for the total bridges of the management organization with the target management level. A method to determine the optimal budget allocation ratio for each management subject was proposed and case analysis was conducted using the proposed model. Proper budget allocation was made considering the bridge types, current safety level, and service life as well as the bridge size as an impact factor of the budget allocation of the bridge. The developed method can prevent budget waste and provide a rational basis for budget allocation by implementing the rational budget distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제40권10호
• /
• pp.1986-1993
• /
• 2015

We investigate the optimal resource and power allocation for device-to-device (D2D) communications in a multicell environment. When D2D links reuse the cellular radio resources, each D2D user will interfere with a cellular link and other D2D links, in its own cell as well as in adjacent cells. Under such situation, we propose a coordinated resource allocation scheme that can handle the intercell interferences as well as the intracell interference. For a given resource allocation, we also formulate a power optimization problem and present an algorithm for finding the optimal solution. The resource and power allocation algorithms are designed to maximize the achievable rate of the D2D link, while limiting the generated interference to the cellular link. The performance of the proposed algorithms is evaluated through simulations in a multicell environment. Numerical results are presented to verify the coordination gain in the resource and power allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2233-2252
• /
• 2018

For the problem of cross-layer joint resource allocation (JRA) in the Long-Term Evolution (LTE)-Advanced standard using carrier aggregation (CA) technology, it is difficult to obtain the optimal resource allocation scheme. This paper proposes a joint resource allocation algorithm based on the weights of user's average quality of experience (JRA-WQOE). In contrast to prevalent algorithms, the proposed method can satisfy the carrier aggregation abilities of different users and consider user fairness. An optimization model is established by considering the user quality of experience (QoE) with the aim of maximizing the total user rate. In this model, user QoE is quantified by the mean opinion score (MOS) model, where the average MOS value of users is defined as the weight factor of the optimization model. The JRA-WQOE algorithm consists of the iteration of two algorithms, a component carrier (CC) and resource block (RB) allocation algorithm called DABC-CCRBA and a subgradient power allocation algorithm called SPA. The former is used to dynamically allocate CC and RB for users with different carrier aggregation capacities, and the latter, which is based on the Lagrangian dual method, is used to optimize the power allocation process. Simulation results showed that the proposed JRA-WQOE algorithm has low computational complexity and fast convergence. Compared with existing algorithms, it affords obvious advantages such as improving the average throughput and fairness to users. With varying numbers of users and signal-to-noise ratios (SNRs), the proposed algorithm achieved higher average QoE values than prevalent algorithms.