• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1286-1302
• /
• 2012

In this paper, the resource allocation problem with proportional fairness rate in cognitive OFDM-based wireless network is studied. It aims to maximize the total system throughput subject to constraints that include total transmit power for secondary users, maximum tolerable interferences of primary users, bit error rate, and proportional fairness rate among secondary users. It is a nonlinear optimization problem, for which obtaining the optimal solution is known to be NP-hard. An efficient bio-inspired suboptimal algorithm called immune clonal optimization is proposed to solve the resource allocation problem in two steps. That is, subcarriers are firstly allocated to secondary users assuming equal power assignment and then the power allocation is performed with an improved immune clonal algorithm. Suitable immune operators such as matrix encoding and adaptive mutation are designed for resource allocation problem. Simulation results show that the proposed algorithm achieves near-optimal throughput and more satisfying proportional fairness rate among secondary users with lower computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5149-5173
• /
• 2016

Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5249-5267
• /
• 2016

Cognitive radio is an efficient technique to improve spectrum efficiency and relieve the pressure of spectrum resources. In this paper, we investigate the spectrum sensing period in cooperative relay cognitive radio networks; analyze the relationship between the available capacity and the signal-to-noise ratio of the received signal of second users, the target probability of detection and the active probability of primary users. Finally, we derive the closed form expression of the optimal spectrum sensing period in terms of maximum throughput. We simulate the probability of false alarm and available capacity of cognitive radio networks and compare optimal spectrum sensing period scheme with fixed sensing period one in these performance. Simulation results show that the optimal sensing period makes the cognitive networks achieve the higher throughput and better spectrum sensing performance than the fixed sensing period does. Cooperative relay cognitive radio networks with optimal spectrum sensing period can achieve the high capacity and steady probability of false alarm in different target probability of detection. It provides a valuable reference for choosing the optimal spectrum sensing period in cooperative relay cognitive radio networks.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.382-392
• /
• 2011

This paper proposes the streaming radio frequency identification (RFID) protocol to support robust data streaming in a passive communication, which is extended from the ISO18000-6 Type C RFID standard. By observing and modeling the unique bit error behavior through detailed analysis in this paper, we found that performance is significantly limited by inaccurate and unstable link frequencies as well as low SNR which are inevitable for passive devices. Based on the analysis, we propose a simple and efficient protocol to adaptively insert extra error control sequences in a packet for tolerating tough link condition while maximizing the throughput and preserving the minimal implementation cost. To evaluate effectiveness of our proposal in real-time streaming applications, we experimented on real-time H.264 video streaming and prototyped the system on FPGA. To our best knowledge, our paper is the first work to take analytical approach for maximizing the throughput and demonstrate the possibility of the realtime multimedia streaming transmission in the passive RFID system.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.377-382
• /
• 2010

With the advent of flash memory based new storage device (SSD), there is considerable interest within the computer industry in using flash memory based storage devices for many different types of application. The dynamic index structure of large text collections has been a primary issue in the Information Retrieval Applications among them. Previous studies have proven the three approaches to be effective: In- Place, merge-based index structure and a combination of both. The above-mentioned strategies have been researched with the traditional storage device (HDD) which has a constraint on how keep the contiguity of dynamic data. However, in case of the new storage device, we don' have any constraint contiguity problems due to its low access latency time. But, although the new storage device has superiority such as low access latency and improved I/O throughput speeds, it is still not well suited for traditional dynamic index structures because of the poor random write throughput in practical systems. Therefore, using the experimental performance evaluation of various index maintenance schemes on the new storage device, we propose an efficient index structure for new storage device that improves significantly the index maintenance speed without degradation of query performance.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2046-2052
• /
• 2016

Ramp metering is one of the most efficient and widely used control methods for an intelligent transportation management system on a freeway. Its objective is to control and upgrade freeway traffic by regulating the number of vehicles entering the freeway entrance ramp, in such a way that not only the alleviation of the congestion but also the smoothing of the traffic flow around the desired density level can be achieved for the maintenance of the maximum mainline throughput. When the cycle of the signal detection is larger than that of the system process, the density tracking problem needs to be considered in the form of the discrete-time system. Therefore, a discrete-time sliding mode control method is proposed for the ramp metering problem in the presence of both input constraint in the on-ramp and exogenous disturbance in the off-ramp considering the random behavior of the driver. Simulations were performed using a validated second-order macroscopic traffic flow model in Matlab environment and the simulation results indicate that proposed control method can achieve better performance than previously well-known ALINEA strategy in the sense that mainstream flow throughput is maximized and congestion is alleviated even in the presence of input constraint and exogenous disturbance.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.157-164
• /
• 2008

In this paper we suggest a scheduling algorithm that transmits periodic traffics efficiently in tree-structured wireless sensor networks (WSNs). The related research[l] showed the problems such as increasing the energy consumption and decreasing the data throughput as the depth of tree increases. To solve these problems. we use idle time slots and avoid the redundancy at data transmission. Also we suggest the algorithm that transmits the control packet when it is similar to a previously measured data. And if emergency data is occurred, our proposed algorithm transits that data in EDP(Emergency Data Period) for reducing the wait time. The proposed algorithm shows more data throughput and less energy consumption than that of the related research.

• Journal of electromagnetic engineering and science
• /
• v.16 no.2
• /
• pp.80-86
• /
• 2016

This paper proposes the algorithm for forward link adaptive coding and modulation (ACM) and the detailed design for a satellite communication system to improve network reliability and system throughput. In the ACM scheme, the coding and modulation schemes are changed by as much as the channel can provide depending on the quality of the communication link. To implement the forward link ACM system in the Ka-band, channel prediction and modulation/coding decision methods are proposed and simulated. The parameters of the adaptive filter predictor based on the least mean square are optimized, the minimum mean square error of the channel predictor is 0.0608 when step size and the number of filter tap are 0.0001 and 4, respectively. A test-bed is set up to verify the forward link ACM system, and a test is performed using a Ka-band satellite (i.e., Communication, Ocean, and Meteorological Satellite [COMS]). This test verifies that the ACM scheme can increase the system throughput.

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

Cognitive Radio system can guarantee available channel whenever, wherever by sensing surrounding channel condition. Therefore, there is a strict rule that have to use allocated channel efficiently without any interference from incumbent User. In this paper, to avoid interference which can occur during uplink transmission in CR system, we propose reporter using scheme which informs incumbent user's situation to adjacent cell to limit channel usage. Therefore, we can use more channel in each cell without interference. With this scheme we can expect better throughput using more channel in a large space with same resource.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.692-699
• /
• 2008

Semiconductor research and development(R&D) fabs are very different than production fabs in many ways such as the scales of production, job priority, production methods, and performance measures. Efficient operations of R&D fabs are very important to the development of new product, process stability, high yield, and ultimately company competitiveness. This paper proposes the fab-wide scheduling method for operational optimization of the R&D fabs. Most scheduling systems of semiconductor fabs have only focused on maximizing throughput of each separated areas without considering WIP(works in process) flows of entire fab. In this paper, we proposes the a fab-wide scheduling system which schedules all lots to entire fab equipment at once. We develop the MIP(mixed integer programing) model which allocates the lots to production equipment considering many constraints of all processes and the CP(constraint programming) model which determines the sequences of the lots in the production equipment. The proposed FAB-wide scheduling model is applied to the newly constructed R&D fab. As a result, we have accomplished the system based automated job reservation, decrease of the hot lot delay, increase of the queue time satisfaction, the high throughput by maximizing the batch sizes, decrease of the WIP TAT(Turn Around Time).