• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.3 s.106
• /
• pp.267-271
• /
• 2006

In this paper, we use the OFDM transmission channel model applied to the MIMO antennas considering spatial propagation property to evaluate and investigate the ergodic capacity of the channel. Specially, we have applied our results to 3GPP TR 25.99 V1.1.0 case 1 LOS off channel description and calculated ergodic capacity with parameters, cluster angle spread and angle of arrival(AOA). Our results show that as the cluster angle spread increase the channel capacity increase until 35 degree, but for more than 35 degree channel capacity does not improved.

• Journal of Satellite, Information and Communications
• /
• v.5 no.2
• /
• pp.87-91
• /
• 2010

The IEEE 802.15.4 and IEEE 802.15.7 standard are the typical of low rate wireless and Visible Light Wireless personal area networks. Its Medium Access Control protocol can support the QoS traffic flows for real-time application through guaranteed time slots (GTS) in beacon mode. However, how to achieve a best allocation scheme is not solved clearly. The current analytical models of IEEE 802.15.4 MAC reported in the literature have been mainly developed under the assumption of saturated traffic or non-bursty unsaturated traffic conditions. These assumptions don't capture the characteristics of bursty multimedia traffic. In this paper, we propose a new analytical model for GTS allocation with burst Markov modulated ON-OFF arrival traffic.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.212-215
• /
• 2008

In this paper, we develop the optimal path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. The MAKLINK is a set of edges which consist of the convex set. Some of the edges come from the edges of the obstacles. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1] through the experiment.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.11
• /
• pp.996-1003
• /
• 2016

Trilateration technique using time of arrival(TOA) is generally used for single target position estimation in radar system. However, trilateration technique has limitation in case of multiple targets, since it is difficult to distinguish the measurements corresponding to the respective targets. In this study, to eliminate ambiguity of relation between measurements and targets, micromotion of each target is measured by micro Doppler which is actively studied in radar industry nowadays and these information are used to distinguish measurements used at trilateration technique. Resultingly, the trilateration technique is applied successfully for each target. The targets are considered as multiple submissiles separated from the missile. Simulation results shows the performance of the proposed algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.768-776
• /
• 1995

In a distributed computer system with star topology, the processing power of central node may be greater than that of peripheral nodes and the job arrival rate of each node may be different. The performance of load balancing may be very different according to the selection of sender criteria and receiver criteria for job transfer. But the optimal decision of sender and receiver criteria is very difficult in heterogeneous distributed computer systems. In this paper we propose effective destination decision policies using dynamic criteria such as mean job response time of a node and estimated response time of a job, instead of fixed threshold for dynamic load balancing.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.515-522
• /
• 1997

A neat prefect stable random access protocol for a broadcast channel,the distributed queuing random access protocol(DQRAP)is presented and evaluated.The DQRAP prootcol utilizes minisolts to provide termaty chan-nel feedback and two distributed queues to:9a) resolve contention and (b) to schedute the transmission of messages.Three minislots are sufficient to resolve collisions faster than the tranmission times of all inboled mecages.Three minislots are suffcient to resolve collisions faster than the tranmission times of all inbolved arrivals when ternary minislot feedback is used.Modelingand simulation indicate that the DQRAP protocol, using as few as three minislits,achives a performance level which approaches that of hypothetical perfect cheduling protocol,ie,the M/D/I system,with respect to propagation delay,thus offers the potential of improved performance over current protocols in satellite,metropolitan and packet radio networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.833-841
• /
• 1994

In this paper we develop an approximation formalism for the queue length distribution of general queueing models. Our formalism is based on two steps of analytic approximation employing both the lower and upper bound techniques. It is favorable to a fast numerical calcuation for the queue length distribution of a superposition of a superposition of arbitary type traffic sources. In the application. M+ N D /M/1 is considered. The calculated result for queue length distribution measured by arriving or leaving customers show a good agreement with the direct simulation of the system. Especially, we demonstrate that our formula for M/M/1 is equivalent to the exact solution, while that D/M/1 is simplified in an analytic form.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1063-1069
• /
• 2004

There are some problems with the methods of paging and routing cache(PRC) and quasi soft handoff that are proposed to improve the performance for the transmission of real time data. This paper proposed a reasonable solution of these problems by proposing a new method using a combined cache(CC) and applying a different handoff procedure according to each type of data. The combined cache dose not maintain the handoff state but the idlle/active state. The simulation results in a better performance than the above methods in terms of the control packet traffic load, initial recevied data packet traffic load and arrival tune of real time packet at the epoch of handoff.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.940-947
• /
• 2010

A Parking Guidance and Information Service System is to provide real-time parking-information and the shortest parking-path for increasing the user's convenience, relieving traffic congestion, reducing illegal parking, and maximizing the efficiency of parking management. This paper discusses the result of the needs analysis, design, and implementation of the Parking Guidance and Information Service System. Furthermore, it analyzes and compares the parking time and vehicle turnover rate before and after the system installation.