• Smart Media Journal
• /
• v.10 no.2
• /
• pp.92-99
• /
• 2021

Smart space is a technology that supports humans by interacting with the surrounding environment. Smart space has a built-in dynamic intelligent environment. This paper proposes a framework that provides user-customized dynamic intelligent environments in smart spaces. In the existing research that provides user-customized intelligent services, users' interests are only explicitly analyzed, and smart spaces are not considered. Implicit interest analysis can suggest a service that may be of interest to users rather than explicit interest analysis, but it requires higher performance than explicit interest analysis. Smart spaces can obtain useful information by interacting with information in the space. The framework proposed in the study uses a proximity-based social network of things to fit into a smart space. In addition, the implicit interest analysis provides intelligent information for smart spaces using the social media information and spatial information objects. In addition, we propose a method to prevent performance degradation while maintaining accuracy in consideration of the characteristics of the smart space.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.236-245
• /
• 2007

Wireless sensor networks consist of numerous nodes equipped with small-sized and limited calculation capacities and storage space as well as low-capacity batteries. Therefore, the key issue is to reduce energy consumption of sensor nodes in sensor network environment. To reduce energy consumption of sensor nodes, consideration must be given to decreasing frequency of messages transmitted by nodes. Also, considering network application, security of sensor networks is also considered important. Therefore, this study proposes a key distribution scheme in dynamic clustering model. The dynamic clustering model used for this scheme is very effective in extending life span of wireless sensor networks. The proposed scheme provides improved security compared to the existing key distribution scheme by applying grid-based key distribution scheme and allocating polynomial s hare to the nodes forming a cluster. Also, comparison was made with the previously proposed grid-based, location-based and cluster-based key distribution schemes to illustrate the advantages of the proposed scheme.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.10
• /
• pp.1131-1138
• /
• 2015

As the size of the internet market grows rapidly, the number of IPv4 addresses available is being exhausted, while transition to IPv6 is being delayed. As the best alternative solution, Network Address Translation(NAT) scheme is being used. It connects the public internet network with the private internet network in order to reduce the waste of IPv4 addresses space. The purpose of this paper is to study the effective example of network based on common virtual network using Packet Tracer with topology designed rather than usual theoretical approach in Dynamic NAT and PAT, which allows more efficient use of address space.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

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

In wireless sensor networks application, sensor nodes are randomly deployed in wide and opened environment typically. Since sensor networks have these features, it is vulnerable to physical attacks in which an adversary can capture deployed nodes and use them to inject a fabricated report into the network. This threats of network security deplete the limited energy resource of the entire network using injected fabricated reports. A dynamic en-route filtering scheme is proposed to detect and drop the injected fabricated report. In this scheme, node executes the key redistribution to increases the detection power. It is very important to decide the authentication key redistribution because a frequent key redistribution can cause the much energy consumption of nodes. In this paper, we propose a key redistribution determining method to enhance the energy efficiency and maintain the detection power of network. Each node decides the authentication key redistribution using a fuzzy system in a definite period. The proposed method can provide early detection of fabricated reports, which results in energy-efficiency against the massive fabricated report injection attacks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1235-1238
• /
• 2005

P2P(peer-to-peer) 웹 캐슁 모델은 서버 쪽에 집중되는 트래픽을 완화시킴으로써 전통적인 웹 캐슁 모델을 보완할 수 있다는 측면에서 최근에 활발히 연구되어 왔다. P2P 웹 캐슁은 클라이언트들의 로컬 캐쉬를 활용하여 부가적인 인프라의 추가없이 캐쉬 공간이 확대되는 효과를 얻을 수 있지만, 각 클라이언트들은 독립된 피어로서의 자율성(autonomy)을 가지므로 이러한 자율성의 제한을 최소화해야한다. 본 논문에서는 피어의 자율적인 동적 참여와 로컬 캐슁 전략을 보장하여 시스템의 실행 가능성(feasibility)을 높인 환경에서 효율적인 디렉토리 기반 P2P 웹 캐슁 시스템을 제안하였다. 제안하는 P2P 웹 캐슁 시스템은 동적인 P2P 네트워크 상에서의 오브젝트의 lifetime을 예상하여 이를 저장 공간 관리(storage management)에 적용하였다. 시스템의 성능 평가를 위하여 클라이언트의 http 요청 로그 데이터셋을 이용하여 트레이스 기반(trace-driven) 실험을 수행하고, 제안하는 시스템이 기존의 시스템에 비하여 주어진 동일한 환경에서 더 높은 정확성을 가짐을 확인하였다.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2002.03a
• /
• pp.3-8
• /
• 2002

기존의 건설지원시스템은 주로 문자정보를 대상으로 구축되어 지형이나 공간정보와 같은 실세계에 대한 정보를 제공하는데 취약점이 있으나, GIS(Geographic Information System)는 이러한 문제에 대해 공간정보의 제공뿐만 아니라 설계지원시스템과 연계하여 효율적이고 체계적인 정보의 분석 및 지원 기능을 제공해 줄 수 있을 것으로 기대된다. 이에 더하여 다양한 네트워크의 구축 및 이를 통한 정보서비스의 발전은 GIS의 제공방식과 내용을 변모시키고 있으며 네트워크 상에서 즉각적으로 사용자에게 다양하고 동적인 GIS 솔루션을 제공할 수 있는 Web GIS의 활용이 확산되고 있다. 본 연구에서는 건설진행상황을 즉각적으로 확인하고 실시간으로 업무보고 및 업무지시를 수행함으로써 원격공정관리를 가능하게 하고, 나아가 단지 문서적인 업무보고에만 의존하여 보고자의 의도에 따라 수동적으로 의사결정을 내리던 관행에서 벗어나 Web GIS에 기반한 건설공사 정보관리시스템을 개발함으로써 건설공사 현황을 직관적으로 판단하고 의사결정을 내릴 수 있는 시스템을 구축하였다.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.32-41
• /
• 2006

In data-centric networks, various data items, such as temperature, humidity, etc. are sensed and stored in sensor nodes. As these attributes are mostly scalar values and inter-related, multi-dimensional range queries are useful. To process multi-dimensional range queries efficiently in data-centric storage, data addressing is essential. The Previous work focused on efficient query processing without considering overall network lifetime. To prolong network lifetime and support multi-dimensional range queries, we propose a dynamic data distribution method for multi-dimensional data, where data space is divided into equal-sized regions and linearized by using Hilbert space filling curve.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.129-147
• /
• 2002

This paper presents a variational equality formulation by Providing new dynamic route choice condition for a link-based dynamic traffic assignment model. The concepts of used paths, used links, used departure times are employed to derive a new link-based dynamic route choice condition. The route choice condition is formulated as a time-dependent variational equality problem and necessity and sufficiency conditions are provided to prove equivalence of the variational equality model. A solution algorithm is proposed based on physical network approach and diagonalization technique. An asymmetric network computational study shows that ideal dynamic-user optimal route condition is satisfied when the length of each time interval is shortened. The I-394 corridor study shows that more than 93% of computational speed improved compared to conventional variational inequality approach, and furthermore as the larger network size, the more computational performance can be expected. This paper concludes that the variational equality could be a promising approach for real-time application of a dynamic traffic assignment model based on fast computational performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.53-56
• /
• 2009

본 연구는 차세대 네트워크 환경에서 동적인 상황에 관련된 지식서비스를 제공하기 위해 서술논리와 SWRL 기반의 온톨로지 모델 프레임워크를 제공하여 추론과 상황 결정에 있어 온톨로지 기반의 지식베이스가 유용함을 제시한다. 기존 대부분의 온톨로지 모델은 단일 온톨로지나 정적인 온톨로지를 중심으로 모델링되었으나 본 연구에서 제시하는 온톨로지 모델은 서비스를 중심으로 동적인 상황에 능동적으로 대처할 수 있는 온톨로지 구조와 사용자를 중심으로 다양하게 변화하는 지식을 동적으로 처리할 수 있는 지식표현 패턴을 제안하여 공간과 시간에 따른 동적인 상황서비스가 적합함을 보여주었다.