• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.929-932
• /
• 2004

DRACO 구조는 이중 링 연결형태에 대비하여 노드간 접근 경로를 단축할 수 있는 구조로, CC-NUMA 시스템에 대하여 그 적용성과 프로토콜이 시험되어 그 효율성이 입증되었다. 본 논문은 이러한 DRACO 구조가 보다 많은 프로세서를 수용할 수 있는 클러스터 시스템에 대하여 동일한 경로 단축과 대역폭 확장을 적용할 수 있음에 기반하여, 이중 연결 링크를 가지고 있는 점대 점 연결 형태의 클러스터 시스템에 대한 적용성을 연구하였다. 노드 내의 네트워크 인터페이스 및 소프트웨어만을 이용한 DRACO 구조 적용은 많은 수의 노드를 필요로 하는 시스템에 적합하고, 하드웨어를 이용한 연결 경로를 이용할 경우 상대적으로 적은 수의 노드를 채용하고 고속의 링크 성능을 필요로 하는 시스템에 적합할 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1399-1401
• /
• 2010

본 연구는 새만금과 새만금 주변에서 Geosensor 스트림 데이터 측정을 위해 대기관련 센서들로 3개의 클러스터를 구성하고, 수질관련 센서들로 하나의 클러스터를 구성하여 Geosensor 네트워크를 구축하였다. 각 클러스터로부터 5분 단위로 수집된 센서 스트림 데이터를 시스템에 전송하고, 시스템에서는 수신된 스트림 데이터를 분석 및 처리하여 DB에 저장한다. 본 연구에서는 Geosensor 데이터 가공 처리 및 저장, Geosensor 관리, 상황정보 관리, Geosensor 스트림 데이터와 GIS 연동 기능을 포함한 시스템을 개발하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1165-1168
• /
• 2007

센서노드들이 배치되었을 때 초기 보안 요구사항은 이웃 노드 사이의 보안키를 안전하고 효율적으로 설정하는 것이다. 이를 위해 본 논문에서는 클러스터 단위로 직접키를 공유함으로써 공유하는 센서 수를 줄임과 동시에 다항식이 노출 되어도 전체 센서 네트워크에 끼치는 영향을 최소화하여 안전성을 보장하게하고 컴퓨팅 오버헤드를 줄일 수 있게 하였다. 또한 가용성 보장을 위해 불필요한 키관리 동작을 지양하고 센서 노드의 에너지 소모를 감소시키기 위하여 근접 클러스터 헤더 노드와의 사전 키 분배를 통해 경로키를 설정하게 함으로써 센서노드간의 안전하고 효율적인 pairwise key 설정을 통해 안전한 통신이 가능하게 하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.67-77
• /
• 2007

In sensor networks, it is very important to refresh communication keys of sensors in a periodic or on-demand manner. To perform a dynamic key management efficiently, sensor networks usually employ cluster architecture and each CH (Cluster Head) is responsible for key management within its cluster. In cluster-based sensor networks, CHs are likely to be targets of capture attacks, and capture of CHs threatens the survival of network significantly. In this paper, we propose a periodical key refreshment scheme which counteracts against capture of CHs. First, the proposed scheme reduces the threat caused by compromise of CHs by forcing each CH to manage a small number of sensors and changing CH role nodes periodically. Second, the proposed scheme flings attackers into confusion by involving other nodes in a key establishment between BS (Base Station) and a CH. Our numerical analyses showed that the proposed scheme is more secure than other schemes and robust against compromise of CHs.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.43-52
• /
• 2008

The paper presents the problem definition of video placement and efficient methods for placing video data on a cluster of video servers. The video placement is to place each of video replicas on one of the servers where the number and location of the servers are already determined. The rejection ratio of user requests is one of most important user-perceive performance measures, so it has been used as a performance criteria in many researches on the VOD system. The objective of our video placement is to achieve the load balancing among servers and the minimization of total network loads. To our experiment, the presented methods show better performance in terms of the rejection ratio of user requests than the methods for video placements in which only either server load balancing or network load minimization is considered. Also, it is observed that considerations on server load balancing is especially important in video placement. To our survey, little research has been published on video placement in which server and network load are considered together in a video server cluster environment.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.161-171
• /
• 2010

Sensor Networks are often deployed in unattended environments, thus leaving these networks vulnerable to false data injection attacks in which an adversary injects forged reports into the network through compromised nodes. Such attacks by compromised sensors can cause not only false alarms but also the depletion of the finite amount of energy in a battery powered network. Ye et al. proposed the Statistical En-route Filtering scheme to overcome this threat. In statistical en-route filtering scheme, all the intermediate nodes perform verification as event reports created by center of stimulus node are forwarded to the base station. This paper applies a probabilistic verification method to the Static Statistical En-route Filtering for energy efficiency. It is expected that the farther from the base station an event source is, the higher energy efficiency is achieved.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.98-107
• /
• 2009

In this paper, we propose a novel centralized energy-efficient clustering algorithm, called "MCCA : Max k-Cut based Clustering Algorithm for Wireless Sensor Networks." The algorithm does not use location information and constructs clusters via a distributive Max k-Cut based cluster-head election method, where only relative and approximate distance information with neighbor nodes is used and nodes, not having enough energy, are excluded for cluster-heads for a specific period. We show that the energy efficiency performance of MCCA is better than that of LEACH, EECS and similar to BCDCP's by simulation studies.

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.9-18
• /
• 2008

This paper propose CAR-TO-CAR protocol which can prevent the cars at high-speed from a multiple clash accident at highway with exchanging information. we construct cluster be linked with distance took from GPS(Global Positioning System) because there is no connection at cars on the road. The proposed method solved the overload problem by establishing route because construct the cluster at the IEEE 802.11 MAC class. 'Multi-hop Routing protocol' based on Active Network enable stable Network to be formed by using Active Network.

• Knowledge Management Research
• /
• v.24 no.4
• /
• pp.103-129
• /
• 2023

This study aims to analyze the network structure of technological innovation resources in SMEs, especially manufacturing firms, and reveal the differences between innovative and non-innovative firms. The study first analyzes connection centrality, flow-mediated centrality, and power centrality for all firms, and derives structural equivalence through CONCOR analysis. Then, the network structure of innovative and non-innovative firms was compared and analyzed according to innovation performance and creation. The results show that entrepreneurship and corporate innovation strategy have a significant impact on the analysis of technological innovation resources of all firms. According to the CONCOR analysis, the innovation resources of SMEs are organized into seven clusters, which can be defined as intrinsic product innovation resources, competitive advantage promotion resources, cooperative activities resources, information system resources, and innovation protection resources. The network analysis of innovative and non-innovative firms showed that innovative firms focused on enhancing competitiveness and improving quality, while non-innovative firms tended to focus more on existing products and customers. In addition, innovative firms had eight clusters, while non-innovative firms had six clusters, suggesting that innovative firms utilize resources diversely to pursue structural change and new value creation, while non-innovative firms operate technological innovation resources in a more stable form. This study emphasizes the importance of entrepreneurship and corporate innovation strategy in SMEs' technological innovation, and suggests that strong internal efforts are needed to increase innovativeness. These findings have important implications for strategy formulation and policy development for technological innovation in SMEs.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.76-90
• /
• 2006

Sensor network consists of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The life time of each node in the sensor network significantly affects the life time of whole sensor network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all sensor nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Cluster-Based Power-Efficient Routing (CBPER) Protocol which provides scalable and efficient data delivery to multiple mobile sinks. Previous r(luting protocols, such as Directed Diffusion and TTDD, need to flood many control packets to support multiple mobile sinks and many sources, causing nodes to consume their battery. In CBPER, we use the fact that sensor nodes are stationary and location-aware to construct and maintain the permanent grid structure, which makes nodes live longer by reducing the number of the flooding control packets. We have evaluated CBPER performance with TTDD. Our results show that CBPER is more power-efficient routing protocol than TTDD.