• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.2
• /
• pp.149-156
• /
• 2005

The HLA is the simulation architecture standard that the civilian and military simulation communities are deeply interested in. We can find various successful practices applying HLA to constructive simulations such as war games in domestics and overseas. However, any case of real-time distributed simulations has not been reported. The reason is that a message transmission period via RTI in a network layer varies according to computing power, simulation nodes, transmission types, and packet size; further a message processing time in an application layer depends on its processing methods, thus too difficult to set up real-time constraints for the enhancement of a real-time resolution. Hence, in this paper we have studied the real-time constraints of RTI for the development of the M-SAM simulator. Thus we have developed a HLA based pilot simulator using 6 PC's in LAN and then measured and analysed the performance of the RTI. As the results of our work, we could obtain the quantitative values for message delay, RTI overhead and RTI packet transmission ratio by a real operation scenario and loads, which are not shown in the previous works. We also expect that the results can be used as a guideline to set up the number of targets, transmission frequency and message processing method in the development of the M-SAM simulator and similar applications.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.7
• /
• pp.613-621
• /
• 2016

This research connected network equipment, including CCTV, PAGA, IP-PBX, and Legacy, in order to enable the operation and configuration of internal IP-based network equipment in maritime plants and vessels, both in the field and from remote places, and to allow for the support of remotely controlling such equipment. It also realized an operating program for the integrated network equipment management system to enable the monitoring and control of equipment status, operation condition, and notifications from distant places. By applying the operating program to satellite stations and vessels sailing on the sea, a performance test was conducted to evaluate data loss and transmission/reception delay in the communication section between the land and vessels. As a result, this research verified the normal operation of CCTV control and of real-time monitoring and control of the network equipment, including PAGA, IP-PBX, and Legacy under the FBB and MVSAT environments. It was observed that the transmission of CCTV video images with a large volume of data as well as the transmission and reception of voice data were found to be slightly delayed, indicating the need to develop technology to compress and convert data for real-time transmission and reception.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.1
• /
• pp.17-34
• /
• 2022

This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.733-736
• /
• 2009

Power Line Communication(PLC) is need not additional communication line. So establishment expense is inexpensive and application is simple. Therefore, lower part network of various application field is possible. However, there are high subordinate interference and noise problem on limited transmission data and communication interference element. Wireless Sensor Network(WSN) is need not infrastructure, Self-regulating network architecture of sensor nodes is possible. So at short time, network construction is available. But, power consumption is increased by active sensing for QoS elevation and unnecessary information transmission, low electric power design and necessity of improve protocol are refered to life shortening problem and is studied. In this paper, supplement problem of power line communication and wireless sensor network mutually and because advantage becomes linkage integration control system using synergy effect of two technologies as more restriction be and tries to approach structurally control network that is improved for smooth network environment construction. Honeywell's hybrid sensor network does comparative analysis(benchmarking). Confirm performance elevation proposing teaming of power line communication and wireless sensor network. Through simulation, service delay decreases and confirms that performance elevation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.980-990
• /
• 2004

In this paper, we propose the dynamic bandwidth allocation algorithm for the IEEE802.3ah Ethernet Passive Optical Network(EPON) system to provide the fairness among terminals, and evaluate the delay-throughput performance by simulation. For the conventional EPON systems, an Optical Line Termination (OLT) schedules the upstream bandwidth for each Optical Network Unit (ONU), based on its buffer state. This scheme can provide a fair bandwidth allocation for each ONU. However, it has a critical problem that it does not guarantee the fair bandwidth among terminals which are connected to ONUs. For an example, we assume that the traffic from a greedy terminal increases at a time. Then, the buffer state of its ONU is instantly reported to the OLT, and finally the OW can get more bandwidth. As a result, the less bandwidth is allocated to the other ONUs, and thus the transfer delay of terminals connected to the ONUs gets inevitably increased. Noting that this unfairness problem exists in the conventional EPON systems, we propose a fair bandwidth allocation scheme by OLT with considering the buffer state of ONU as welt as the number of terminals connected it. For the performance evaluation, we develop the EPON simulation model with SIMULA simulation language. From the result of the throughput-delay performance and the dynamics of buffer state along time for each terminal and ONU, respectively, one can see that the proposed scheme can provide the fairness among not ONUs but terminals. Finally, it is worthwhile to note that the proposed scheme for the public EPON systems might be an attractive solution for providing the fairness among subscriber terminals.

• Journal of Mechanical Science and Technology
• /
• v.14 no.9
• /
• pp.956-967
• /
• 2000

In this paper, we explore the issues of force display in the cooperative virtual environment shared by multiple users distributed over the network with heterogeneous hardware platforms. The proposed method is to cope with the problem of small time delay and the difference of sampling rate in the distributed configuration. In the proposed approach the interaction forces of the participants are just treated as the independent sources of acceleration. Thus the action of a participant simply changes the acceleration of the virtual object and consequently the states of the virtual object will be updated. When the updated states are reported to all the participants, the information on the time of state changes is delivered, too. Employing the discrete state information updated by the other users, each user modifies his own virtual environment and pseudo-realtime simulation can be realized. Excluding the software interface and the communication technique, it is proposed the simulation method for the operation of respective users and the way of calculating the driving input to the display device. For experimental verification we construct a cooperative virtual environment shared by two remote users and outline the results of experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.323-326
• /
• 2007

When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.83-87
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. Mobile terminal acquires a data transmission opportunity as successfulness in channel competition through RCH (Random CHannel) phase. Therefore, AP (Access Point) be able to dynamically assign optimum RCH at next frame according to the number of success and collision. In this paper, we suggest scheme that fluctuate RCH (Random CHannel) number as fixed value considering success and collision for improvement of performance in HiperLAN/2. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed in view of throughput and access delay.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.93-105
• /
• 2006

The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.675-684
• /
• 1993

In this paper, we analyze a traffic control schemes at the interworking unit(IWU) of the IEEE 802.6 DQDB MAN and the B-ISDN, and estimate its performance via computer simulation. We also study traffic management, relaying sublayers for the cases of four service classes defined in the B-ISDN. As for performance criteria, we consider slot waiting time, slot loss rate, and the fairness between DQDB nodes in access networks. We propose a simple control algorithm that decreases the waitint delay at the OWU. With the buffer size of 40 [slots] at the IWU, we have found that the slot loss rate was nearly zero at traffic load below 0.9, and the slot waiting time became less than 15 slot times.