• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1293-1316
• /
• 2021

Using directional antennas in wireless Ad hoc networks has many superiorities, including reducing interference, extending transmission range, and increasing space division multiplexing. However, directional transmission introduces two problems: deafness and directional hidden terminals problems. We observe that these problems result in saturation throughput disparity among the competing flows in directional CSMA/CA based Ad hoc networks and bring challenges for modeling the saturation throughput of the flows. In this article, we concentrate on how to model and analyze the saturation throughput disparity of different flows in directional CSMA/CA based Ad hoc networks. We first divide the collisions occurring in the transmission process into directional instantaneous collisions and directional persistent collisions. Then we propose a four-dimensional Markov chain to analyze the transmission state for a specific node. Our model has three different kinds of processes, namely back-off process, transmission process and freezing process. Each process contains a certain amount of continuous time slots which is defined as the basic time unit of the directional CSMA/CA protocols and the time length of each slot is fixed. We characterize the collision probabilities of the node by the one-step transition probability matrix in our Markov chain model. Accordingly, we can finally deduce the saturation throughput for each directional data stream and evaluate saturation throughput disparity for a given network topology. Finally, we verify the accuracy of our model by comparing the deviation of analytical results and simulation results.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.641-646
• /
• 2011

In this paper, we investigate a power control problem which is very critical in underlay-based spectrum sharing systems. Although an underlay-based spectrum sharing system is more efficient compared to an overlay-based spectrum sharing system in terms of spectral utilization, some practical problems obstruct its commercialization. One of them is a real-time-based power adaptation of secondary transmitters. In the underlay-based spectrum sharing system, it is essential to adapt secondary user's transmit power to interference channel states to secure primary users' communication. Thus, we propose a practical power control scheme for secondary transmitters. The feedback overhead of our proposed scheme is insignificant because it requires one-bit signaling, while the optimal power control scheme requires the perfect information of channel states. In addition, the proposed scheme is robust to feedback delay. We compare the performance of the optimal and proposed schemes in terms of primary user's outage probability and secondary user's throughput. Our simulation results show that the proposed scheme is almost optimal in terms of both primary user's outage probability and secondary user's throughput when the secondary user's transmit power is low. As the secondary user's transmit power increases, the primary user's outage probability of the proposed scheme is degraded compared with the optimal scheme while the secondary user's throughput still approaches that of the optimal scheme. If the feedback delay is considered, however, the proposed scheme approaches the optimal scheme in terms of both the primary user's outage probability and secondary user's throughput regardless of the secondary user's transmit power.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2372-2380
• /
• 2015

In this paper, we propose frequency allocation and path selection scheme in underlay cognitive radio (CR) networks using network coding. In the proposed scheme, we choose the path with consideration of network coding and interference temperature in underlay CR networks and propose an optimization problem to maximize the system throughput of secondary users (SUs). Then, we represent the proposed optimization problem as the multi-dimensional multiple-choice knapsack problem and give the theoretical upper bound for the system throughput of SUs by using linear programming. Finally, we compute the system throughput of SUs by using brute-force search (BFS) and link quality first (LQF) scheme in underlay CR networks. Simulation results show that the system throughput of SUs with BFS is higher than that with LQF in underlay CR networks with and without application of network coding, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.24-33
• /
• 2007

In this paper, two different dynamic cell coordination strategies for frequency flat and selective fading are proposed for efficient subcarrier allocation in the joint consideration of adaptive modulation and variable frequency reuse in the channel-aware OFDMA downlink multicellular environment. Compared to a conventional OFDMA system without cell coordination, where system throughput may become degraded due to the persistent interference from other cells, the proposed system dynamically allows RNC to apply different reuse factors on each subchannel and scheduling in consideration of channel and interference conditions of individual users so as to increase the system throughput and guarantee QoS of each user. In a frequency flat fading, the dynamic scheme with the proposed scheduling achieves on average three times larger throughput than the conventional dynamic scheme [8]. In a selective fading channel, the proposed schemes showed 2.6 times as large throughput as that of a single reuse factor of one for all subchannels.

• Korean Management Science Review
• /
• v.28 no.3
• /
• pp.15-29
• /
• 2011

In this paper, we consider a system working at both primary service and secondary service. A server can switch between the primary service and the secondary service or it can be assigned to secondary service as a dedicated server. A service policy is characterized by the number of servers dedicated to the secondary service and a rule for switching the remaining servers between two services. The primary service system is modelled as a Markovian queueing system and the throughput is a function of the number of servers, buffer capacity, and service policy. And the secondary service system has a service level requirement strategically determined to perform the service assigned. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simultaneously determining the optimal total number of servers, buffers, and service policy to maximize profit of the system subject to both an expected customer waiting time constraint of the primary service and a service level constraint of the secondary service and develop an algorithm which can be successfully applied with the small number of computations.

• The Korean Journal of Pesticide Science
• /
• v.5 no.3
• /
• pp.41-46
• /
• 2001

This study was conducted to develop a high throughput system for screening acetolactate synthase(ALS) inhibitors, and to detect basic mother molecules for developing new novel herbicide candidates. The high throughput screening (HTS) method using 96-well plate and microplate reader was developed. This method is 8 times more effective than basic technique in one cycle per person. Futhermore, considering for less than 1/10 volume of materials required for ALS test and enzyme kinetics with 16 times faster speed compared to those of former procedure, this HTS method has more than 100 times higher efficacy than basic system in a consecutive procedure. We discovered 11 new ALS inhibitors such as 2-oxoglutaric acid, aminooxyacetic acid, azelaic acid, citric acid, cyanuric fluoride, itaconic acid, malonic acid, niclosamide, oxalic acid, glyoxylic acid, and suramin from 107 commercial plant-specific inhibitors using this technique. We hope these results might be useful to discover lead compounds for developing new novel herbicide candidate.

• Journal of Satellite, Information and Communications
• /
• v.12 no.3
• /
• pp.8-14
• /
• 2017

In 4G mobile communication, data services of mobile communication began to be provided in earnest. As a result, services such as the internet and multimedia including the video have become the main contents in the recent wireless traffic. Accordingly, research on 5G mobile communication with higher transmission rate has been actively carried out. 5G mobile communication is expected to be based on 4G for compatibility with existing terminals. Therefore, the simulation of this paper is based on 4G and we propose a new user scheduling scheme based on the Max throughput scheduling algorithm to improve system performance. This paper derives the frequency efficiency and fairness to compare the existing user scheduling algorithm with the proposed user scheduling algorithm. The proposed scheme shows better frequency efficiency and fairness than Max throughput in all situations. This paper contributes to the research for improving the system performance of 5G mobile communication technology, and I hope that it will help some of the ongoing standardization work.

• Journal of Advanced Navigation Technology
• /
• v.17 no.2
• /
• pp.189-195
• /
• 2013

In an environment with frequent job requests and short job processing times, thread pool methods are frequently used to increase throughput by reducing overheads due to thread creation and removal. A watermark method normally reduces unnecessary uses of resources by keeping the number of threads less than those needed in the maximum. In the absence of available threads, however, it processes jobs by creating additional threads up to a specified limit so that the system overhead increases due to creation of threads, which results in throughput degradation. This paper presents a history-based dynamic method that alleviates throughput degradation. By estimating and maintaining the number of threads needed for jobs, it reduces overheads due to thread creation and removal. According to experiments, compared to the watermark thread pool method, it shows average 33% increase in the number of threads kept and average 62% reduction in the number of threads created, which results in 6% increase in terms of system throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.455-464
• /
• 2005

In this paper, we implement resource allocation algorithm based on the WiBro system which including OFDMA, TDD, and we propose the algorithm in order to increase bandwidth efficiency. In this algorithm, data is allocated from the subchannel which has large channel gain to the subchannel which has small channel gain with maximum modulation order. The moment total power is more than available power, the modulation order of the latest subchannel is adjusted. The problem of decreasing of throughput in large channel attenuation environment is solved by allocating additional power. Still, this algorithm has large bandwidth efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1136-1144
• /
• 2010

In this paper, the effects of HARQ feedback error are evaluated in IEEE 802.16m system when the HARQ and ARQ interactions that utilize the HARQ feedback information is used. Also, the HARQ and ARQ interaction scheme considering HARQ feedback errors are proposed. The HARQ and ARQ interaction scheme improve the system throughput by using the HARQ feedback information instead of the ARQ feedback message, which reduce retransmission time. However, errors in the HARQ feedback information generate severe performance degradation. Especially, the local NAK errors between HARQ feedback error critically degrade the performance, because the local NAK errors lead the loss of ARQ blocks. We propose a channel state-based schemes for HARQ and ARQ interactions to mitigate the throughput degradation due to HARQ feedback errors. Simulation results show that the proposed scheme improves the throughput and the delay performance.