• Title/Summary/Keyword: 전송성능 평가

Search Result 1,632, Processing Time 0.026 seconds

Cortex M3 Based Lightweight Security Protocol for Authentication and Encrypt Communication between Smart Meters and Data Concentrate Unit (스마트미터와 데이터 집중 장치간 인증 및 암호화 통신을 위한 Cortex M3 기반 경량 보안 프로토콜)

  • Shin, Dong-Myung;Ko, Sang-Jun
    • Journal of Software Assessment and Valuation
    • /
    • v.15 no.2
    • /
    • pp.111-119
    • /
    • 2019
  • The existing smart grid device authentication system is concentrated on DCU, meter reading FEP and MDMS, and the authentication system for smart meters is not established. Although some cryptographic chips have been developed at present, it is difficult to complete the PKI authentication scheme because it is at the low level of simple encryption. Unlike existing power grids, smart grids are based on open two-way communication, increasing the risk of accidents as information security vulnerabilities increase. However, PKI is difficult to apply to smart meters, and there is a possibility of accidents such as system shutdown by sending manipulated packets and sending false information to the operating system. Issuing an existing PKI certificate to smart meters with high hardware constraints makes authentication and certificate renewal difficult, so an ultra-lightweight password authentication protocol that can operate even on the poor performance of smart meters (such as non-IP networks, processors, memory, and storage space) was designed and implemented. As a result of the experiment, lightweight cryptographic authentication protocol was able to be executed quickly in the Cortex-M3 environment, and it is expected that it will help to prepare a more secure authentication system in the smart grid industry.

Development of a Slope Condition Analysis System using IoT Sensors and AI Camera (IoT 센서와 AI 카메라를 융합한 급경사지 상태 분석 시스템 개발)

  • Seungjoo Lee;Kiyen Jeong;Taehoon Lee;YoungSeok Kim
    • Journal of the Korean Geosynthetics Society
    • /
    • v.23 no.2
    • /
    • pp.43-52
    • /
    • 2024
  • Recent abnormal climate conditions have increased the risk of slope collapses, which frequently result in significant loss of life and property due to the absence of early prediction and warning dissemination. In this paper, we develop a slope condition analysis system using IoT sensors and AI-based camera to assess the condition of slopes. To develop the system, we conducted hardware and firmware design for measurement sensors considering the ground conditions of slopes, designed AI-based image analysis algorithms, and developed prediction and warning solutions and systems. We aimed to minimize errors in sensor data through the integration of IoT sensor data and AI camera image analysis, ultimately enhancing the reliability of the data. Additionally, we evaluated the accuracy (reliability) by applying it to actual slopes. As a result, sensor measurement errors were maintained within 0.1°, and the data transmission rate exceeded 95%. Moreover, the AI-based image analysis system demonstrated nighttime partial recognition rates of over 99%, indicating excellent performance even in low-light conditions. Through this research, it is anticipated that the analysis of slope conditions and smart maintenance management in various fields of Social Overhead Capital (SOC) facilities can be applied.

Probability-based Pre-fetching Method for Multi-level Abstracted Data in Web GIS (웹 지리정보시스템에서 다단계 추상화 데이터의 확률기반 프리페칭 기법)

  • 황병연;박연원;김유성
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.261-274
    • /
    • 2003
  • The effective probability-based tile pre-fetching algorithm and the collaborative cache replacement algorithm are able to reduce the response time for user's requests by transferring tiles which will be used in advance and determining tiles which should be removed from the restrictive cache space of a client based on the future access probabilities in Web GISs(Geographical Information Systems). The Web GISs have multi-level abstracted data for the quick response time when zoom-in and zoom-out queries are requested. But, the previous pre-fetching algorithm is applied on only two-dimensional pre-fetching space, and doesn't consider expanded pre-fetching space for multi-level abstracted data in Web GISs. In this thesis, a probability-based pre-fetching algorithm for multi-level abstracted in Web GISs was proposed. This algorithm expanded the previous two-dimensional pre-fetching space into three-dimensional one for pre-fetching tiles of the upper levels or lower levels. Moreover, we evaluated the effect of the proposed pre-fetching algorithm by using a simulation method. Through the experimental results, the response time for user requests was improved 1.8%∼21.6% on the average. Consequently, in Web GISs with multi-level abstracted data, the proposed pre-fetching algorithm and the collaborative cache replacement algorithm can reduce the response time for user requests substantially.

  • PDF

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

A Study on Method for User Gender Prediction Using Multi-Modal Smart Device Log Data (스마트 기기의 멀티 모달 로그 데이터를 이용한 사용자 성별 예측 기법 연구)

  • Kim, Yoonjung;Choi, Yerim;Kim, Solee;Park, Kyuyon;Park, Jonghun
    • The Journal of Society for e-Business Studies
    • /
    • v.21 no.1
    • /
    • pp.147-163
    • /
    • 2016
  • Gender information of a smart device user is essential to provide personalized services, and multi-modal data obtained from the device is useful for predicting the gender of the user. However, the method for utilizing each of the multi-modal data for gender prediction differs according to the characteristics of the data. Therefore, in this study, an ensemble method for predicting the gender of a smart device user by using three classifiers that have text, application, and acceleration data as inputs, respectively, is proposed. To alleviate privacy issues that occur when text data generated in a smart device are sent outside, a classification method which scans smart device text data only on the device and classifies the gender of the user by matching text data with predefined sets of word. An application based classifier assigns gender labels to executed applications and predicts gender of the user by comparing the label ratio. Acceleration data is used with Support Vector Machine to classify user gender. The proposed method was evaluated by using the actual smart device log data collected from an Android application. The experimental results showed that the proposed method outperformed the compared methods.

Android Based Mobile Combination Login Application (안드로이드 기반 모바일 통합로그인 애플리케이션)

  • Lim, Jung-Gun;Choi, Chang-Suk;Park, Tae-Eun;Ki, Hyo-Sun;An, Beongku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.151-156
    • /
    • 2013
  • Android that was made by Google and Open Handset Alliance is the open source software toolkit for mobile phone. In a few years, Android will be used by millions of Android mobile phones and other mobile devices, and become the main platform for application developers. In this paper, the integrated login application based on Google's Android platform is developed. The main features of the mobile combination login application content based on Android are as follows. First, the application has more convenient login functionality than the functionality of general web browser as the web browser of the mobile-based applications(web browser style applications) as well as security features and faster screen(view) capability by reducing the amount of data transfer. Second, the application is so useful for management of ID and Password, and it can easily manage multiple ID information such as message, mail, profile. The results of performance evaluation of the developed application show the functionality that can login many kinds of portal sites simultaneously as well as the ability that can maintain login continuously. Currently, we are trying to develope a couple of the technologies that can insert multiple accounts into one ID and check all information on one screen.

Distributed Hashing-based Fast Discovery Scheme for a Publish/Subscribe System with Densely Distributed Participants (참가자가 밀집된 환경에서의 게재/구독을 위한 분산 해쉬 기반의 고속 서비스 탐색 기법)

  • Ahn, Si-Nae;Kang, Kyungran;Cho, Young-Jong;Kim, Nowon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.12
    • /
    • pp.1134-1149
    • /
    • 2013
  • Pub/sub system enables data users to access any necessary data without knowledge of the data producer and synchronization with the data producer. It is widely used as the middleware technology for the data-centric services. DDS (Data Distribution Service) is a standard middleware supported by the OMG (Object Management Group), one of global standardization organizations. It is considered quite useful as a standard middleware for US military services. However, it is well-known that it takes considerably long time in searching the Participants and Endpoints in the system, especially when the system is booting up. In this paper, we propose a discovery scheme to reduce the latency when the participants and Endpoints are densely distributed in a small area. We propose to modify the standard DDS discovery process in three folds. First, we integrate the Endpoint discovery process with the Participant discovery process. Second, we reduce the number of connections per participant during the discovery process by adopting the concept of successors in Distributed Hashing scheme. Third, instead of UDP, the participants are connected through TCP to exploit the reliable delivery feature of TCP. We evaluated the performance of our scheme by comparing with the standard DDS discovery process. The evaluation results show that our scheme achieves quite lower discovery latency in case that the Participants and the Endpoints are densely distributed in a local network.

Flexible Disjoint Multipath Routing Protocol Using Local Decision in Wireless Sensor Networks (무선 센서 네트워크에서 지역 결정을 통한 유연한 분리형 다중경로 라우팅 프로토콜)

  • Jung, Kwansoo;Yeom, Heegyun;Park, Hosung;Lee, Jeongcheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.911-923
    • /
    • 2013
  • Multipath routing is one of challenging issues for improving the reliability of end-to-end data delivery in wireless sensor networks. Recently, a disjointedness and management of path have been studying to enhance the robustness and efficiency of the multipath routing. However, previous multipath routing protocols exploit the disjointed multipath construction method that is not to consider the wireless communication environment. In addition, if a path failures is occurred due to the node or link failures in the irregular network environment, they maintain the multipath through the simple method that to construct a new extra path. Even some of them have no a method. In order to cope with the insufficiency of path management, a hole detouring scheme, to bypass the failures area and construct the new paths, was proposed. However, it also has the problem that requires a heavy cost and a delivery suspension to the some or all paths in the hole detouring process due to the centralized and inflexible path management. Due to these limitations and problems, the previous protocols may lead to the degradation of data delivery reliability and the long delay of emergency data delivery. Thus, we propose a flexible disjoint multipath routing protocol which constructs the radio disjoint multipath by considering irregular and constrained wireless sensor networks. It also exploits a localized management based on the path priority in order to efficiently maintain the flexible disjoint multipath. We perform the simulation to evaluate the performance of the proposed method.

Real-Time IoT Big-data Processing for Stream Reasoning (스트림-리즈닝을 위한 실시간 사물인터넷 빅-데이터 처리)

  • Yun, Chang Ho;Park, Jong Won;Jung, Hae Sun;Lee, Yong Woo
    • Journal of Internet Computing and Services
    • /
    • v.18 no.3
    • /
    • pp.1-9
    • /
    • 2017
  • Smart Cities intelligently manage numerous infrastructures, including Smart-City IoT devices, and provide a variety of smart-city applications to citizen. In order to provide various information needed for smart-city applications, Smart Cities require a function to intelligently process large-scale streamed big data that are constantly generated from a large number of IoT devices. To provide smart services in Smart-City, the Smart-City Consortium uses stream reasoning. Our stream reasoning requires real-time processing of big data. However, there are limitations associated with real-time processing of large-scale streamed big data in Smart Cities. In this paper, we introduce one of our researches on cloud computing based real-time distributed-parallel-processing to be used in stream-reasoning of IoT big data in Smart Cities. The Smart-City Consortium introduced its previously developed smart-city middleware. In the research for this paper, we made cloud computing based real-time distributed-parallel-processing available in the cloud computing platform of the smart-city middleware developed in the previous research, so that we can perform real-time distributed-parallel-processing with them. This paper introduces a real-time distributed-parallel-processing method and system for stream reasoning with IoT big data transmitted from various sensors of Smart Cities and evaluate the performance of real-time distributed-parallel-processing of the system where the method is implemented.

AFLRS: An AODV-based Fast Local Repair Scheme in Ad Hoc Networks (AFLRS: 애드 혹 네트워크에서 AODV에 기반한 빠른 경로 복구 기법)

  • 서현곤;김기형;서재홍
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.81-90
    • /
    • 2004
  • A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies without the use of any existing network infrastructure. The AODV (Ad Hoc On-Demand Distance Vector) Protocol is one of the typical reactive routing protocols, in that mobile nodes initiate routing activities only in the presence of data packets in need of a route. In this paper, we focus upon the local repair mechanism of AODV. When a link is broken, the upstream node of the broken link repairs the route to the destination by initiating a local route discovery process. The process involves the flooding of AODV control messages in every node within a radius of the length from the initiating node to the destination. In this paper, we propose an efficient local repair scheme for AODV called AFLRS (AODV-based Fast Local Repair Scheme). AFLRS utilizes the existing routing information in the intermediate nodes which have been on the active route to the destination before a link break occurs. AFLRS can reduce the flooding range of AODV control messages and the route recovery time because it can repair route through the intermediate nodes. For the performance evaluation of the proposed AFLRS, we have simulated the local repair mechanisms by using NS2 and AODV-UU. The performance results show that AFLRS can achieve faster route recovery than the local repair mechanism of AODV.