• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.771-776
• /
• 2010

In this paper, we present an efficient centralized dynamic bandwidth allocation scheme with multicasting for asymmetric 10G-Ethernet Passive Optical Networks (10G-EPONs). The proposed scheme is based on multicast-burst polling and provides quality of service (QoS) with class of service (CoS) to different lasses of packets. It is shown that a well-known conventional interleaved polling scheme severely decreases downstream channel capacity for user traffic when the upstream network load is low (avalanche gate frequency). To overcome this problem, we have proposed a multicast burst polling scheme which shows impressively lower downstream bandwidth consumption compare to IPACT and moreover it did not show the light load penalty problem. Simulation results using an OPNET tool show that the multicast burst polling effectively eliminates light-load penalty and minimizes downstream bandwidth consumption under avalanche gate frequencies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1034-1042
• /
• 2008

It is very hard, but important to sustain path stability for a reliable communication in mobile ad hoc networks. We propose a novel source routing protocol that establishes a group path with virtual multiple paths to enable a robust communication. The entire mobile nodes form a disjoint set of clusters: Each has its clusterhead as a cluster leader and a unique cluster label to identify itself from other clusters. A group path is a sequence of cluster labels instead of nodes and the nodes with the same label collaborate to deliver packets to a node with next label on the group path. We prove by resorting to simulation that our proposed protocol outperforms the existing key routing protocols, even for a network with a high node mobility and a high traffic.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.2
• /
• pp.190-197
• /
• 2011

In industrial distributed control systems, sensors collect data from the physical environment periodically and transmit them to the actuators, which process the control operations based on the received data. For the effective operation of the control systems, the data transmitted by the sensors has to be delivered to the actuators reliably within the deadline, and if the message reception rate of the actuators becomes lower than a threshold, then the performance of the control systems drops greatly. This paper suggests a message routing protocol to transmit periodic messages reliably in a distributed control system based on wireless sensor networks. For reliable message transmission, the proposed protocol selects a routing path whose end-to-end message reception rate is the highest before transmitting data messages. The proposed protocol has the capability of maintaining a target message reception rate for each flow. To maintain the required target reception rate, each destination monitors the actual message reception rate periodically and transmits a feedback message to the source if it drops below the target reception rate. On receiving the feedback message, the source tries to find a new path which can satisfy the target rate. The performance of the proposed protocol has been evaluated using simulation and compared with other protocols in terms of the message reception rate, the message delay and delay jitter, and so on. The simulation results show that the proposed protocol has a higher message reception rate and comparable message delay and delay jitter to other protocols. The simulation results also show that the proposed protocol has an ability to adapt well to the dynamic network traffic change.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.208-214
• /
• 2014

Vehicle dynamic states used in various advanced driving safety systems are influenced by road geometry. Among the road geometry information, the vehicle pitch angle influenced by road slope and acceleration-deceleration is essential parameter used in pose estimation including the navigation system, advanced adaptive cruise control and others on sag road. Although the road slope data is essential parameter, the method measuring the parameter is not commercialized. The digital map including the road geometry data and high-precision DGPS system such as DGPS(Differential Global Positioning System) based RTK(Real-Time Kinematics) are used unusually. In this paper, low-cost cascade extended Kalman filter(CEKF) based road slope estimation method is proposed. It use cascade two EKFs. The EKFs use several measured vehicle states such as yaw rate, longitudinal acceleration, lateral acceleration and wheel speed of the rear tires and 3 D.O.F(Degree Of Freedom) vehicle dynamics model. The performance of proposed estimation algorithm is evaluated by simulation based on Carsim dynamics tool and T-car based experiment.

• Convergence Security Journal
• /
• v.7 no.1
• /
• pp.19-27
• /
• 2007

Detecting unknown threats is a paradox ; how do you detect a threat if it is not known to exist? The answer is that unknown threat detection is the process of making a previously unknown threat identifiable in the shortest possible time frame. This paper examines the possibility of creating an unknown threat detection mechanism that security experts can use for developing a flexible protection system for networks. A system that allows the detection of unknown threats through monitoring system and the incorporation of dynamic and flexible logics with situational knowledge is described as well as the mechanisms used to develop such a system is illustrated. The system not only allows the detection of new threats but does so in a fast and efficient manner to increase the available time for responding to these threats.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.433-436
• /
• 2004

In this paper, we introduce a new Fuzzy Polynomial Neural Networks (FPNNS)-like structure whose neuron is based on the Fuzzy Set-based Fuzzy Inference System (FS-FIS) and is different from that of FPNNS based on the Fuzzy relation-based Fuzzy Inference System (FR-FIS) and discuss the ability of the new FPNNS-like structure named Fuzzy Set-based Polynomial Neural Networks (FSPNN). The premise parts of their fuzzy rules are not identical, while the consequent parts of the both Networks (such as FPNN and FSPNN) are identical. This difference results from the angle of a viewpoint of partition of input space of system. In other word, from a point of view of FS-FIS, the input variables are mutually independent under input space of system, while from a viewpoint of FR-FIS they are related each other. The proposed design procedure for networks architecture involves the selection of appropriate nodes with specific local characteristics such as the number of input variables, the order of the polynomial that is constant, linear, quadratic, or modified quadratic functions being viewed as the consequent part of fuzzy rules, and a collection of the specific subset of input variables. On the parameter optimization phase, we adopt Information Granulation (IC) based on HCM clustering algorithm and a standard least square method-based learning. Through the consecutive process of such structural and parametric optimization, an optimized and flexible fuzzy neural network is generated in a dynamic fashion. To evaluate the performance of the genetically optimized FSPNN (gFSPNN), the model is experimented with using the time series dataset of gas furnace process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1318-1324
• /
• 2003

There are two problems in the conventional ART1 algorithm. One is in similarity testing method of the conventional ART1 between input patterns and stored patterns. The other is that vigilance threshold of conventional ART1 influences the number of clusters and the rate of recognition. In this paper, new similarity testing method and dynamical vigilance threshold method are proposed to solve these problems. The former is similarity test method using the rate of norm of exclusive-NOR between input patterns and stored patterns and the rate of nodes have equivalence value, and the latter method dynamically controls vigilance threshold to similarity using fuzzy operations and the sum operation of Yager. To check the performance of new methods, we used 26 alphabet characters and nosed characters. In experiment results, the proposed methods are better than the conventional methods in ART1, because the proposed methods are less sensitive than the conventional methods for initial vigilance and the recognition rate of the proposed methods is higher than that of the conventional methods.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.975-982
• /
• 2004

In current P2P concept, pure P2P and Hybrid P2P structures are used commonly. Gnutella and Ktella are forms of pure P2P. and forms of Hybrid P2P are innumerable. File searching models exist in these models. These models provide group management for file sharing, searching and indexing. The general file sharing model is good at maintaining connectivity. However, it is defective in group management. Therefore, this study approaches hierarchical structure in file sharing models through routing technique and backup system. This system was designed so that the user was able to maintain group efficiency and connection reliability in large-scale network.