• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.917-918
• /
• 2009

This study evaluated the level of performance improvement in the form of a simulated experiment by adding fixed node in the middle of the network as a way to improve mobile ad.hoc network performance. The result showed that the performance level was much higher when fixed node was used together than when mobile node was used only, and the comparison of the mobile speed of mobile node also showed that use of fixed node together had higher performance. Moreover, the evaluation in accordance with the number of fixed node showed that more number of fixed node had shorter time delay. Further study following this on how many fixed node should be added on the ad.hoc network will ensure establishment of more reliable ad.hoc network.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.6
• /
• pp.61-70
• /
• 2013

This paper proposes a design of SARPE(Speed and Azimuth based Routing Protocol for Emergency) system which transfers an emergency message rapidly and accurately by minimizing path disconnection with a vehicle's speed and azimuth in case of accidents. The SARPE system accomplishes the path search based on an azimuth in order to minimize unnecessary messages and workload. It also selects the paths with the lowest probability that the path disconnection will happen by using the difference between the speed(maximum, minimum) of intermediate nodes and the average speed of a source node and destination node. Therefore, this paper minimizes the path resetting work happening due to path disconnection and transfers an emergency message rapidly and accurately.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1056-1059
• /
• 2003

Self-Oranizing Map(SOM) is an unsupervised neural network providing cluster analysis of high dimensional input data. The output from the SOM is represented in map that help us to explore data. The weak point of conventional SOM is when the map is large, it take a long time to train the data. The computing time is known to be O(MN) for trainning to find the winning node (M,N are the number of nodes in width and height of the map). This paper presents a new method to reduce the computing time by creating new map. Each node in a new map is the centroid of nodes' group that are in the original map. After create a new map, we find the winning node of this map, then find the winning node in original map only in nodes that are represented by the winning node from the new map. This new method is called "High Speed Self-Oranizing Map"(HS-SOM). Our experiment use HS-SOM to cluster documents and compare with SOM. The results from the experiment shows that HS-SOM can reduce computing time by 30%-50% over conventional SOM.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.50-58
• /
• 1996

This paper proposes the channel-access protocol suitable to a very high speed photonic WDM network with star configuration, which can provide a high channel utilization and insensitivity to the propagation delay. The proposed protocol employs a control channel and a simple status table to deal with the propagation delay which has been a major limiting factor in the performance of the very high speed optical communication networks. The control channel transmits control information in order to reserve access on data channels, and each node constitutes a status table after the reception of control pckets which holds information about the availbility of destination node and data channel. The proposed protocol is insensitive to the propagation delay time by removing necessity of the retransmission and by allowing parallel transmission of control packet and data packets. It is proved in analysis and discrete event simulation that the proposed protocol is superior in throughput and mean delay, especially at the high load conditions compared to the existing high speed channel-access protocols.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.3
• /
• pp.333-343
• /
• 2009

Tactical Information Communication Network(TICN) is a concept-type integrated Military Communication system that enables precise command control and decision making by unifying the diversified military communication network and conveying diverse range of battle field information on real-time, at right place at right time. TICN is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network is consist of mobile nodes and nodes in the network depends on the cooperation of other nodes for forwarding of packets. In this context, some non-cooperating nodes may delay forwarding of packets or drop the packets. This may hamper the network as a whole and disrupt communication between the cooperating nodes. To solve this problem, we present a solution with a Node Weight Management Server(NWMS), which manages each node's weight according to its behavior in local area. When the NWMS detects misbehaving node, it increases the node's weight. If the node's weight exceeds a predefined threshold then the NWMS broadcasts the node's information into network to isolate the misbehaving node from the network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

• ETRI Journal
• /
• v.17 no.1
• /
• pp.11-22
• /
• 1995

This paper proposes a modified error function to improve the error back-propagation (EBP) algorithm for multi-Layer perceptrons (MLPs) which suffers from slow learning speed. It can also suppress over-specialization for training patterns that occurs in an algorithm based on a cross-entropy cost function which markedly reduces learning time. In the similar way as the cross-entropy function, our new function accelerates the learning speed of the EBP algorithm by allowing the output node of the MLP to generate a strong error signal when the output node is far from the desired value. Moreover, it prevents the overspecialization of learning for training patterns by letting the output node, whose value is close to the desired value, generate a weak error signal. In a simulation study to classify handwritten digits in the CEDAR [1] database, the proposed method attained 100% correct classification for the training patterns after only 50 sweeps of learning, while the original EBP attained only 98.8% after 500 sweeps. Also, our method shows mean-squared error of 0.627 for the test patterns, which is superior to the error 0.667 in the cross-entropy method. These results demonstrate that our new method excels others in learning speed as well as in generalization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2529-2547
• /
• 2012

In this paper, we use a quadrotor-based mobile sink to gather sensor data from the terrestrial deployed wireless sensor network. By analyzing the flight features of the mobile sink node, we theoretically study the flight constraints of height, velocity, and trajectory of the mobile sink node so as to communicate with the terrestrial wireless sensor network. Moreover, we analyze the data amount which the mobile sink can send when it satisfies these flight constraints. Based on these analysis results, we propose a data acquisition approach for the mobile sink node, which is discussed detailed in terms of network performance such as the transmission delay, packet loss rate, sojourning time and mobile trajectory when given the flying speed and height of the mobile sink node. Extensive simulation results validate the efficiency of the proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.22 no.12
• /
• pp.1438-1446
• /
• 2019

Recently, the number of mobile users as well as high-speed Internet user has been increasing rapidly. Moreover, traffic is growing fast as services that provide real-time content such as Youtube and Netflix become popular. The problem of traffic control in real-time content services is important because many people use cell phones to receive real-time content. In this regard, the field of CCN is currently being studied. We studied the mobility of nodes among CCN research fields. Node mobility can be divided into three categories : consumer mobility, intermediate node, and provide mobility. In this paper, we propose Mobility Node Support(MD-INS) to support the intermediate-node mobility in CCN real-time services. Experimental results show that the proposed scheme shows better performance than CCN in terms of service disconnection time and packet loss.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.358-364
• /
• 2007

This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.141-146
• /
• 2005

The authors investigate the convergence speed problem of nonlinear adaptive equalization. Convergence constraints and time constant of radial basis function network using stochastic gradient (RBF-SG) algorithm is analyzed and a method of making time constant independent of hidden-node output power by using sample-by-sample node output power estimation is derived. The method for estimating the node power is to use a single-pole low-pass filter. It is shown by simulation that the proposed algorithm gives faster convergence and lower minimum MSE than the RBF-SG algorithm.