• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.113-119
• /
• 2009

The training sequence with the appropriate length for equalization and initial synchronization is necessary before sending the pure data in the burst transmission type DS-UWB system. The length of the training sequence is one of the factors which make throughput decreased. The noble structure with the variable length of the training sequence whose length can be adaptively tailored according to the channel conditions (CM1,CM2,CM3,CM4) in the DS-USB systems is proposed. This structure can increase the throughput without sacrificing the performance than the method with fixed length of training sequence considering the worst case channel conditions. Simulation results under IEEE 802.15.3a channel model show that the proposed scheme can achieve higher throughput than a conventional one with the slight loss of BER performance. And this structure can reduce the computation complexity and power consumption with selecting the short length of the training sequence.

• IE interfaces
• /
• v.15 no.3
• /
• pp.316-324
• /
• 2002

Automated Guided Vehicles are widely used as an essential material handling system for FMS to provide flexibility and efficiency. We suggest a new dispatching rule based on priority function which considers urgency and empty vehicle travel time under finite buffer capacity. We evaluate the performance of the proposed rule by comparing the performance of Shortest Travel Time/Distance(STT/D) rule in terms of machine utilization, throughput and WIP level using simulation. The simulation results show that the suggested dispatching rule is robust and provides better machine utilization, throughput with comparable WIP level compared to STT/D rule.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.486-488
• /
• 2008

In this paper, a scheme to increase the throughput of RFID systems is presented, which considers the capture effect in the context of framed ALOHA protocol. Under the capture model in which the probability of one tag is identified successfully depending on the number of tags involved in the collision, two probabilistic methods for estimating the unknown number of tags are proposed. The first method is the maximum likelihood estimation method, and the second method is an approximate algorithm for reducing the computational time. The optimal frame size condition to maximize the system throughput by considering the capture effect is also presented.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.5
• /
• pp.659-665
• /
• 2013

IPCS(Inter Process Communication Service) is a real-time communication middleware designed for warship combat battle systems based on publisher-subscriber communication model. Because IPCS was originally designed to operated under 100 Mbps network environment, increasing network speed into Gigabit environment does not linearly increase the throughput of IPCS. To solve this problem, we anaylized IPCS structure and optimized IPCS into Gigabit-Ethernet environment. We found parameters to improve IPCS based on UDP and Token-ring structure. By improving, IPCS has reliability and higher throughput than TCP although IPCS is based on UDP.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1462-1470
• /
• 1989

This paper aims at investigating the Demand Assigned Multiple Access(DAMA) system for the packet-switched Satellite Communication. An onboard processor of the multisport beam satellite incorporates the ground controller to macimize the packet transmissions for each slot. 'Request Following' trnasmission mode is introduced as a transmission strategy of ground station under the control of its zone controller. The combined scheme of reservation channel access and contention channel access was proposed by Lee & Mark[3] for improving the Delay-Throughput performance. Our scheme provides less communication delay of approximately max. 200msec for achieving the corresponding throughput than the Lee & Mark's work does. Delay versus Throughput curves as well as Delay versus Traffic parameter curves are obtained. Numerical results obtained through the analysis and by the computer simulation show that the proposed scheme provides the low average packer delay even under the condition that the number of transponders (M)is below the half of the number of zones(N).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.730-738
• /
• 2004

In this paper, System performance parameters such as throughput, blocking probability and delay have been analyzed and expressed as a function of demanding traffic and service termination, probability, and we centers our discussion at particular downlink port of satellite switch which is capable of switching the individual spot beam and processing the information signals in the packet satellite communications with demand assigned multiple access technique. Delay versus throughput as a function of traffic parameters with several service termination probability can be derived via mathematical formulation and the relative differences of transmission delay is also compared.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.73-76
• /
• 2002

In this paper, we consider an algorithm for effectively providing data services for mobile users with different levels of priorities in a DS-CDMA system. The priority level of a user is specified by a factor that is a weighting on the instantaneous data throughput of the user. We define tile weighted instantaneous aggregate data throughput and use it to characterize the performance of the prioritized data service. Our prioritized data service is implemented so that the weighted instantaneous aggregate data throughput is maximized via efficient power and spreading gain allocation. We present efficient algorithms for computing tile optimal power and spreading gain allocation.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.463-471
• /
• 2011

Cooperative communications using relays in wireless networks have similar effects of multiple-input and multiple-output without the need of multiple antennas at each node. To implement cooperation into a system, efficient protocols are desired. In IEEE 802.11 families such as a/b/g, mobile stations can automatically adjust transmission rates according to channel conditions. However throughput performance degradation is observed by low-rate stations in multi-rate circumstances resulting in so-called performance anomaly. In this paper, we propose active relay-based cooperative medium access control (AR-CMAC) protocol, in which active relays desiring to transmit their own data for cooperation participate in relaying, and it is designed to increase throughput as a solution to performance anomaly. We have analyzed the performance of the simplified AR-CMAC using an embedded Markov chain model to demonstrate the gain of AR-CMAC and to verify it with our simulations. Simulations in an infrastructure network with an IEEE 802.11b/g access point show noticeable improvement than the legacy schemes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.19-26
• /
• 1996

A solution procedure to minimize the number of storage carousels has been developed under the carousel throughput rate and total storage capacity requirements. The number of carousels can be reduced by increasing the throughput rate of carousels which depends upon the size of carousels, the storage item allocation to carousels, and the item position assignments in each carousel. Since the problem is very complicated and hard to solve optimally, the following solution procedure to solve the problem hierarchically is proposed: With a given number of carousels, the storage items are allocated to carousels so that the slowest average transaction time among carousels may be minimized, and then the position of each item is assigned in the allocated carousel so that the throughput of the carousel can be maximized.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.348-357
• /
• 2019

Fog radio access network (F-RAN) architectures provide markedly improved performance compared to conventional approaches. In this paper, an efficient genetic algorithm-based content distribution scheme is proposed that improves the throughput and reduces the transmission delay of a F-RAN. First, an F-RAN system model is presented that includes a certain number of randomly distributed fog access points (F-APs) that cache popular content from cloud and other sources. Second, the problem of efficient content distribution in F-RANs is described. Third, the details of the proposed optimal genetic algorithm-based content distribution scheme are presented. Finally, simulation results are presented that show the performance of the proposed algorithm rapidly approaches the optimal throughput. When compared with the performance of existing random and exhaustive algorithms, that of the proposed method is demonstrably superior.