• Journal of information and communication convergence engineering
• /
• 제5권2호
• /
• pp.83-87
• /
• 2007

This research studies real time interaction and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted disorderly, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dead-reckoning path prediction, the error between the estimated and the actual static values which is over the threshold based on the shared object location requires interpolation and multicasting of the previous location by the ESPDU of DIS. The shared dynamic data of the 3D virtual environment is implementation using the VRML.

• Annual Conference of KIPS
• /
• 한국정보처리학회 2001년도 추계학술발표논문집 (하)
• /
• pp.1533-1536
• /
• 2001

This paper considers the TMN system for management of public ATM switching network which has the four-level hierarchical structure consisting of one network management system, a few element management system and several agent-ATM switch pairs, respectively. The effects of one TMN command on the local call processing performance of the component ATM switch an analyzed using Jackson's queueing model. The TMN command considered is the permanent virtual call connection, and the performance measures of ATM switch are the utilization, mean queue length and mean waiting time for the processor interfacing the subscriber lines and trunks directly, and the call setup delay of the ATM switch.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 한국소음진동공학회 2007년도 춘계학술대회논문집
• /
• pp.978-982
• /
• 2007

A new neuro-control scheme for active control of structures is proposed. It utilizes lattice pattern of state vector as training data of probabilistic neural network (PNN). Therefore, it is the so-called lattice probabilistic neural network (LPNN). PNN makes control forces by using all the training patterns. Therefore, it takes much time to obtain a control force in application. This inevitably may delay the control action. However, control force of LPNN is calculated by using only the adjacent information of LPNN input. So, the response of LPNN is greatly faster than PNN. The proposed control algorithm is applied for one story building under California and El Centro earthquakes. Also, control results of the LPNN are compared with those of the conventional PNN. The structural responses have been suppressed effectively by the proposed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제4권2호
• /
• pp.323-336
• /
• 2000

In order to achieve the deployment of B-ISDN services in a short time, B-ISDN is being combined with terrestrial ATM network and satellite network which covers a widespread service range. This paper analyzes and investigates several previously existent CDV compensation methods in order to compensate CDV arising from interfacing satellite TDMA and ATM. Specifically to supplement the problems of timestamp and cell number counting methods, new Partial Timestamp mechanism for CDV compensation is proposed. The CDV compensating efficiency of the proposed mechanism is analyzed and evaluated by simulations. It goes to show that Partial timestamps mechanism has many advantages in the aspect of the CDV compensation.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.550-552
• /
• 1999

This paper describes a control technique of coupled tank level using Evolutionary Neural Network. In general, the control of tank level without a dangerous overflow and with a high accuracy is difficult because of higher order time delay and nonlinearity. Nonetheless, proposed Evolution Neural Network controller in this paper was successfully implemented and simulation results of the superiority over a conventional PID one was investigated.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.717-720
• /
• 2000

Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• 제39권6호
• /
• pp.19-25
• /
• 2002

A regular virtual topology requires little processing time for routing purposes which may be a desirable property for high-speed networks. Asymmetric bilayered ShuffleNet, proposed by us as a virtual topology, can be more efficient to be used to design a wide-area optical network compared to ShuffleNet. In this paper, asymmetric bilayered ShuffleNet is imbedded on a given physical topology with the objective of minimizing the total message delay.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.448-450
• /
• 2007

Peer-to-Peer system has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical location aware topology can cause serious performance degradation. In this paper, we consider the network distance between peers so that it helps peers select neighbors located at the nearest when they exchange queries for sharing of resources. To reduce the unnecessary signaling traffic and delay of query exchange, we propose a location aware topology based Hybrid P2P system. This system calculates the network distance which combines the direct measurement such as RTT (Round Trip Time) with geographic space of peers using IP address

• Journal of the Korea Society of Computer and Information
• /
• 제21권2호
• /
• pp.51-60
• /
• 2016

This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제39B권5호
• /
• pp.323-325
• /
• 2014

The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the information sharing delay in the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff between these two performances according to node's coverage. In this paper, we present a method of coverage control that minimizes consensus time according to network scale.