• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.1
• /
• pp.75-84
• /
• 2021

For analyzing big data, the social network is increasingly being utilized through relational data, which means the connection characteristics between entities such as people and objects. When the relational data does not exist directly, a social network can be configured by calculating relational data such as attribute similarity from attribute data of entities and using it as links. In this paper, the composition method of the social network using the attribute similarity between entities as a connection relationship, and the clustering method using subgroups for the configured social network are suggested, and the clustering effectiveness of the clustering results is evaluated. The analysis results can vary depending on the type and characteristics of the data to be analyzed, the type of attribute similarity selected, and the criterion value. In addition, the clustering effectiveness may not be consistent depending on the its evaluation method. Therefore, selections and experiments are necessary for better analysis results. Since the analysis results may be different depending on the type and characteristics of the analysis target, options for clustering, etc., there is a limitation. In addition, for performance evaluation of clustering, a study is needed to compare the method of this paper with the conventional method such as k-means.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.229-231
• /
• 2006

NLPCA(Nonlinear Principal Component Analysis) is a novel technique for multivariate data analysis, similar to the well-known method of principal component analysis. NLPCA operates by a feedforward neural network called AANN(Auto Associative Neural Network) which performs the identity mapping. In this work, a sensor fault detection system based on NLPCA is presented. To verify its applicability, simulation study on the data supplied from sensor network is executed.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.115-116
• /
• 2009

Home-network gateway always powered on, while network data is not transferred. And the Power consumption of networked electric devices are greatly increased, to support higher speed data transfer. To reduce the power consumption of networked electric devices, some ideas were proposed. Such as ALR, Proxying, Subset-PHY. In this paper we propose a scheme to reduce power consumption of Home-Network Gateway. Proposed Home-network Gateway architecture consumes less than 1W in passive standby mode.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3641-3655
• /
• 2016

Wireless sensor networks (WSNs) provide a promising approach to monitor the physical environments, to prolong the network lifetime by exploiting the mutual correlation among sensor readings has become a research focus. In this paper, we design a hierarchical network framework which guarantees layered-compression. Meanwhile, a data sorting-based adaptive spatial compression scheme (DS-ASCS) is proposed to explore the spatial correlation among signals. The proposed scheme reduces the amount of data transmissions and alleviates the network congestion. It also obtains high compression performance by sorting original sensor readings and selectively discarding the small coefficients in transformed matrix. Moreover, the compression ratio of this scheme varies according to the correlation among signals and the value of adaptive threshold, so the proposed scheme is adaptive to various deploying environments. Finally, the simulation results show that the energy of sorted data is more concentrated than the unsorted data, and the proposed scheme achieves higher reconstruction precision and compression ratio as compared with other spatial compression schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.5
• /
• pp.999-1008
• /
• 2017

In this paper, we propose a pipeline network coding (PNC) scheme for efficient data transmission in wireless networks, a data authentication scheme for verifying the integrity of data, and a node authentication scheme for a virtual source. PNC is a technique that improves the overall network performance by relaying data such that the relay node performing network coding transmits to the sender instead. However, network coding is vulnerable to a pollution attack, which is an attack by a malicious attacker to inject modified data into the network. To prevent this, hash-based message authentication code (HMAC) is used. For this purpose, in order to generate a tag used for data authentication, a key must be distributed to the nodes performing authentication. We applied a hash chain to minimize the overhead of key distribution. A null vector is used as the authentication scheme for the virtual source. Finally, we analyze the safety and complexity of the proposed scheme and show he performance through simulation.

• Journal of the Korea Society for Simulation
• /
• v.18 no.1
• /
• pp.27-34
• /
• 2009

Currently network users, especially the number of internet users, increase rapidly. Also, high quality of service is required and this requirement results a sudden network traffic increment. As a result, an efficient management system for huge network traffic becomes an important issue. Ontology/data engineering based context awareness using the System Entity Structure (SES) concepts enables network administrators to access traffic data easily and efficiently. The network traffic analysis system, which is studied in this paper, is designed and implemented based on a model and simulation using data engineering methodology to be avaiable in evaluating large network traffic data. Extensible Markup Language (XML) is used for metadata language in this system. The information which is extracted from the network traffic analysis system could be modeled and simulated in Discrete Event Simulation (DEVS) methodology for further works such as post simulation evaluation, web services, and etc.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.323-333
• /
• 2011

We analyzed using logistic to find factors with a mental disorder because logistic is the most efficient way assess risk factors. In this paper, we applied data mining techniques that are logistic, neural network, c5.0, cart and Bayesian network to delirium data. The Bayesian network method was chosen as the best model. When delirium data were applied to the Bayesian network, we determined the risk factors associated with delirium as well as identified the network between the risk factors.

• Proceedings of the KIEE Conference
• /
• 2008.11a
• /
• pp.382-384
• /
• 2008

D-TRS is a method of wireless communication. This method will be able to use several frequency for multiple user used chanel together. TETRA of D-TRS technology is not rented network. Using TETRA network has the strong point which cost better than CDMA network of rental network. Master server of SCADA(Supervisory Control And Data Acquisition) system is realtime supervise control and a data acquire the control system or the RTU(Remote Terminal Unit). The present paper is developed and proposal the gateway platform for electronic power backbone network based on D-TRS. This gateway platform is converted DNP3.0 messages with TETRA PDU and converted TETRA PDU with DNP3.0 messages. Master server and FRTU will be able to send and receive DNP3.0 message via TETRA network using this gateway platform.

• Smart Structures and Systems
• /
• v.8 no.1
• /
• pp.69-92
• /
• 2011

This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.