• Convergence Security Journal
• /
• v.9 no.2
• /
• pp.71-78
• /
• 2009

It is very difficult to apply previous security protocols to WSNs(Wireless Sensor Networks) directly because WNSs have resource constrained characteristics such as a low computing ability, power, and a low communication band width. In order to overcome the problem, we proposes a secure group communication scheme applicable to WSNs. The proposed scheme is a combined form of the TEEN(Threshold sensitive Energy Efficient sensor Network protocol) clustering based hierarchical routing protocol and security mechanism, and we assume that WSNs are composed of sensor nodes, cluster headers, and base stations. We use both private key and public key cryptographic algorithms to achieve an enhanced security and an efficient key management. In addition, communications among sensor nodes, cluster headers, and base stations are accomplished by a hierarchical tree architecture to reduce power consumption. Therefore, the proposed scheme in this paper is well suited for WSNs since our design can provide not only a more enhanced security but also a lower power consumption in communications.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly collaborative mobility behavior. The key problem of those applications is scalability with regard to the number of multicast members as well as the number of the multicast group. To enhance scalability with group mobility, we have proposed a multicast protocol based on a new framework for hierarchical multicasting that is suitable for the group mobility model in MANET. The key design goal of this protocol is to solve the problem of reflecting the node's mobility in the overlay multicast tree, the efficient data delivery within the sub-group with group mobility support, and the scalability problem for the large multicast group size. The results obtained through simulations show that our approach supports scalability and efficient data transmission utilizing the characteristic of group mobility.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.3-15
• /
• 2003

The secure group communication enables the members, which belong to the same group, to communicate each other in a secure and secret manner. To do so, it is the most important that a group key is securely distributed among them and also group membership is efficiently managed. In detail, the generation, the distribution and the refreshment of a group key would be highly regarded in terms of low communication and computation complexity. In this paper, we show you a new protocol to generate a group key which will be safely shared within a group, utilizing the 2-party Diffie-Hellman key exchange protocol and the complete binary tree. Our protocol has less complexity of computation per group member by substituting many parts of exponentiation computations for multiplications. Consequently, each group member needs constant computations of exponentiation and multiplication regardless of the group size in the protocol and then it has less complexity of the computation than that of any other protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1328-1336
• /
• 2012

Compared to terrestrial RF communications, underwater acoustic communications have several limitations such as limited bandwidth, high level of fading effects, and a large underwater propagation delay. In this paper, in order to tackle those limitations of underwater communications and to make it possible to form a large underwater monitoring systems, we propose a hierarchical underwater network architecture, which consists of underwater sensors, clusterheads, underwater/surface sink nodes, autonomous underwater vehicles (AUVs). In the proposed architecture, for the maximization of packet delivery ratio and the minimization of underwater sensor's energy consumption, a hybrid routing protocol is used. More specifically, cluster members use Tree based routing to transmit sensing data to clusterheads. AUVs on optimal trajectory movements collect the aggregated data from clusterhead and finally forward the data to the sink node. Also, in order to minimize the maximum travel distance of AUVs, an Integer Linear Programming based algorithm is employed. Performance analysis through simulations shows that the proposed architecture can achieve a higher data delivery ratio and lower energy consumption than existing routing schemes such as gradient based routing and geographical forwarding. Start after striking space key 2 times.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.329-342
• /
• 2008

The Sensor Networks have limitations in utilizing energies, developing energy-efficient routing protocol and secure routing protocol are important issues in Sensor Network. In the field of data management, Tributaries and Deltas(TD) which incorporates tree topology and multi-path topology effectively have been suggested to provide efficiency and robustness in data aggregation. And our research rendered hierarchical property to TD and proposed Clustering-based Tributaries-Deltas. Through this new structure, we integrated efficiency and robustness of TD structure and advantages of hierarchical Sensor Network. Clustering-based Tributaries-Deltas was proven to perform better than TD in two situations through our research. The first is when a Base Station (BS) notices received information as wrong and requests the network's sensing data retransmission and aggregation. And the second is when the BS is mobile agent with mobility. In addition, we proposed key establishment mechanism proper for the newly proposed structure which resulted in new Sensor Network structure with improved security and energy efficiency as well. We demonstrated that the new mechanism is more energy-efficient than previous one by analyzing consumed amount of energy, and realized the mechanism on TmoteSKY sensor board using TinyOS 2.0. Through this we proved that the new mechanism could be actually utilized in network design.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.111-125
• /
• 2011

Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.582-591
• /
• 2015

A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.3
• /
• pp.61-69
• /
• 2013

According to ISO 26262 (the international standard on functional safety for automotive industry), the functional safety should be considered during the whole automotive systems life cycle from the design phase throughout the production phase. In order to satisfy the standard, the automotive and related industry needs to take appropriate actions while carrying out a variety of development activities. This paper presents an approach to coping with the standard. Analyzing the standard indicates that the safety issues of the automotive systems should be handled with a system's view whereas the conventional approach to solving the issues has been practiced with focus on the component's level. The aforementioned system's view implies that the functional safety shall be incorporated in the system design from both the system's life-cycle view and the hierarchical view for the structure. In light of this, the systems engineering framework can be quite appropriate in the functional safety development and thus has been taken in this paper as a problem solving approach. Of various design issues, the analysis and verification of the safety requirements for functional safety is a key study subject of the paper. Note, in particular, that the conventional FMEA (failure mode effects analysis) and FTA (fault tree analysis) methods seem to be partly relying on the insufficient experience and knowledge of the engineers. To improve this, a systematic method is studied here and the result is applied in the design of an ABS braking system as a case study.

• Journal of Convergence for Information Technology
• /
• v.10 no.11
• /
• pp.16-22
• /
• 2020

Since it is difficult for individual power producers and non-professionals who lack basic knowledge to control, manage, and operate facilities through EMS (Energy Management System), augmented reality and virtual reality monitoring systems are applied. However, in the existing systems, data access efficiency is inferior due to the process of analyzing column values for analog signal values collected from sensors and converting data after combining the columns. In addition, high-speed operation processing is difficult due to a large number of indexes for accommodating access patterns for various analog signal waveforms. Therefore, in this paper, a bitmap generator is inserted into a non-tree structure to convert the data collected from power facilities into physical property information, and the converted information is encrypted with a common key, so that the resources for the resources shared between each device are We propose a method of exchanging data for an augmented reality-based power system that is controlled by measurement.

• Korean Journal of Heritage: History & Science
• /
• v.50 no.3
• /
• pp.110-125
• /
• 2017

The purpose of this study is to investigate the constructional facts and the operational features of Hamchunwon(含春苑), a wonyu(苑?, a royal garden) constructed in Dongbu(Eastern District) of the capital city of Hanyang. As the living quarters of the queen dowagers were scheduled for relocation after the construction of Changgyeonggung Palace(昌慶宮) during the reign of King Seongjong(成宗), it is presumed that the screening tree planting project discussed around tongmangcheo(通望處, a place allowing open view) was the original form of Dongbu Hamchunwon. Dongbu Hamchunwon was a longitudinal royal garden built in the area across the section from Wolgeunmun Gate(月覲門) to Seoninmun Gate(宣仁門), which were both attached to the east side walls of Changgyeonggung Palace. The area corresponds to the west side area of the newly built main building of Seoul National University Hospital today. During the Joseon Dynasty, only royal gardens built within a palace were referred to as geumwon(禁苑, a palace garden). But Dongbu Hamchunwon which was built outside a palace was recognized as a symbolic and hierarchical space comparable to geumwon. The site location of Donbu Hamchunwon was an important place that corresponded to Naecheongnyong(內靑龍) according to Hanyang's geomancy, and large-scale public works were prohibited in order to protect the vein of Naecheongnyong. During the reign of King Injo(仁祖), part of Dongbu Hamchunwon was partitioned as a ranch. The area around the ranch was called Madongsan(馬東山) and Bangmawon(放馬苑) and was an open space used for rest and pleasure (amusement). In the early days of Hamchunwon's construction, fast growing trees were planted to screen the view to Changgyeonggung Palace. However, after the construction of Gyeongmogung Shrine(景慕宮), a broad scale tree planting project was undertaken to complement Naecheongnyong's vapor of the earth. In particular, after the construction of Yugeunmum Gate(?覲門) and Yucheommun Gate(?瞻門) during the reign of King Jeongjo(正祖), Dongbu Hamchunwon functioned as a key point on the King's progress for paying respects to the ancestors, which followed the route of Palace(Changgyeonggung)-Wonyu(Hamchunwon)-Ancestral Shrine(Gyeongmogung).