• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.766-780
• /
• 1996

This paper presents a mapping scheme for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph into a system graph. One of them is especially suitable for real-time applications of parallel processing. These objective functions are different from the conventional objective functions in that the edges in the problem graph are weighted and the actual distance rather than the nominal distance for the edges in the system graph is employed. This facilitates a more accurate qualification of the communication overhead. An efficient mapping scheme has been developed for the objective functions, where two levels of assignment optimization procedures are employed: initial assignment and pairwise exchange. The mapping scheme has been tested using the hypercube as a system graph.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.6
• /
• pp.2406-2412
• /
• 2015

Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4^th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.341-346
• /
• 2009

M-WiMAX (Mobile-Worldwide Interoperability for Microwave Access) system, which uses OFDM (Orthogonal Frequency Division Multiplexing) technique, is known to be proper for mobile high-speed data transmission system. Nevertheless, M-WiMAX is seriously sensitive to IQ imbalance caused by the LO (Local Oscillator) at the receiver. In this paper, we analyze the effect of IQ imbalance on the system, and then propose a joint optimization scheme that can optimize DFE (Digital Front-end) of mobile modem by combining operation duplicated between AGC (Automatic Gain Control) and the estimation and compensation of IQ imbalance. Simulation results show that the proposed scheme achieves the same performance of the conventional scheme while reducing the complexity of the H/W implementation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.31-39
• /
• 2011

For rapid formed the ad hoc wireless backbone network in disaster scene, It is necessary for real-time deployment scheme of wireless ad hoc relay devices by first responders without pre-planning. However, in order to realize this scheme, redundant deployment should be minimized, as well as optimal location of relay devices should be selected to expand communication coverage. Therefore, in this paper, we propose a new deployment scheme of relay devices to optimize communication coverage and then through simulations showed that improved performance of algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1560-1566
• /
• 2015

To enable the efficient use of energy, the environment where unscheduled receivers can harvest energy from the transmitted signal is considered in next-generation wireless communication systems. In this paper, we propose a scheme for allocating subchannel and power to maximize the system throughput and harvested energy simultaneously using optimization techniques. Through simulations, we verify that the proposed scheme can increase the system throughput and harvested energy harmoniously. In particular, the proposed scheme improves the harvested energy remarkably with a negligible degradation of system throughput, compared with conventional scheme, as a result, energy can be used efficiently in the system.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.926-937
• /
• 2016

In this paper, we study the feasibility of receiver diversity for application to downlink cellular networks, where low-energy devices are equipped with information decoding and energy harvesting receivers for simultaneous wireless information and power transfer. We compare several options that are based on selection combining and maximum ratio combining, which provide different implementation complexities. By capitalizing on the Frechet inequality, we shed light on the advantages and limitations of each scheme as a function of the transmission rate and harvested power that need to be fulfilled at the low-energy devices. Our analysis shows that no scheme outperforms the others for every system setup. It suggests, on the other hand, that the low-energy devices need to operate in an adaptive fashion, by choosing the receiver diversity scheme as a function of the imposed requirements. With the aid of stochastic geometry, we introduce mathematical frameworks for system-level analysis. We show that they constitute an important tool for system-level optimization and, in particular, for identifying the diversity scheme that optimizes wireless information and power transmission as a function of a sensible set of parameters. Monte Carlo simulations are used to validate our findings and to illustrate the trade-off that emerge in cellular networks with simultaneous wireless information and power transfer.

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

On large-scale data analysis platforms deployed on cloud infrastructures over the Internet, the instability of the data transfer time and the dynamics of the processing rate require a more sophisticated data distribution scheme which maximizes parallel efficiency by achieving the balanced load among participated computing elements and by eliminating the idle time of each computing element. In particular, under the constraints that have the real-time and limited data buffer (in-memory storage) are given, it needs more controllable mechanism to prevent both the overflow and the underflow of the finite buffer. In this paper, we propose an auto regulated data provisioning model based on receiver-driven data pull model. On this model, we provide a synchronized data replenishment mechanism that implicitly avoids the data buffer overflow as well as explicitly regulates the data buffer underflow by adequately adjusting the buffer resilience. To estimate the optimal size of buffer resilience, we exploits an adaptive buffer resilience control scheme that minimizes both data buffer space and idle time of the processing elements based on directly measured sample path analysis. The simulation results show that the proposed scheme provides allowable approximation compared to the numerical results. Also, it is suitably efficient to apply for such a dynamic environment that cannot postulate the stochastic characteristic for the data transfer time, the data processing rate, or even an environment where the fluctuation of the both is presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6190-6213
• /
• 2019

For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.368-374
• /
• 2009

This paper focuses on a distributed multiple spectrum pricing scheme to maximize system capacity in next generation multiaccess systems, where multimode user equipments (MUEs) can connect simultaneously to multiple base stations (BSs) with multiple radio access technologies (RATs). The multi-price based scheme provides a distributed decision making for an optimal solution where radio resource allocations are determined by each MUE, unlike most centralized mechanisms where BS controls the whole radio resource. By the proposed optimal solution, MUEs can decide their share of spectrum bands and power allocation according to the spectrum price of each RAT, and at the same time the multiaccess system can achieve maximized total throughput. Numerical analysis shows that the proposed scheme achieves the maximal capacity by distributed resource allocation for the multiaccess system.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.599-608
• /
• 2014

This paper studies a parallel relay network where the relays employ an amplify-and-forward (AF) relaying scheme and are subjected to individual power constraints. We consider correlated effective relay noise arising from practical scenarios when the relays are exposed to common interferers. Assuming that the noise covariance and the full channel state information are available, we investigate the problem of finding the optimal AF scheme in terms of maximum end-to-end transmission rate. It is shown that the maximization problem can be equivalently transformed to a convex semi-definite program, which can be efficiently solved. Then an upper bound on the maximum achievable AF rate of this network is provided to further evaluate the performance of the optimal AF scheme. It is proved that the upper bound can be asymptotically achieved in two special regimes when the transmit power of the source node or the relays is sufficiently large. Finally, both theoretical and numerical results are given to show that, on average, noise correlation is beneficial to the transmission rate - whether the relays know the noise covariance matrix or not.