• Title/Summary/Keyword: 변경 프로토콜

Search Result 408, Processing Time 0.027 seconds

Update Propagation of Replicated Spatial Data using New Locking Techniques in Distributed Geographic Information System (분산된 지리정보시스템에서 새로운 잠금기법을 이용한 중복된 공간 데이터의 변경 전파)

  • Choe, Jin-O;Hong, Bong-Hui
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.9
    • /
    • pp.1061-1072
    • /
    • 1999
  • 한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

Design and Implementation of Wireless Lighting LED Controller using Modbus TCP for a Ship (Modbus TCP를 이용한 선박용 무선 LED 제어기의 설계 및 구현)

  • Jeong, Jeong-Soo;Lee, Sang-Bae
    • Journal of Navigation and Port Research
    • /
    • v.41 no.6
    • /
    • pp.395-400
    • /
    • 2017
  • As a serial communications protocol, Modbus has become a practically standard communication protocol and is now a commonly available means of connecting industrial electronic devices. Therefore, all devices can be connected using the Modbus protocol with the measurement and remote control on ships, buildings, trains, airplanes and more. The existing Modbus that has been used is based on serial communication. Modbus TCP uses Ethernet communication based on TCP / IP which is the most widely used Internet protocol today; so, it is faster than serial communication and can be connected to the Internet of Things. In this paper, we designed an algorithm to control LED lighting in a wireless Wi-Fi environment using the Modbus TCP communication protocol, and designed and implemented a LED controller circuit that can check external environmental factors and control remotely through the integrated management system of a ship. Temperature, humidity, current and illuminance values, which are external environmental factors, are received by the controller through the sensors, and these values are communicated to the ship's integrated management system via the Modbus protocol. The Modbus can be connected to Master devices via TCP communication to monitor temperature, humidity, current, illuminance status and LED output values, and also users can change the RGB value remotely in order to change to the desired color. In addition, in order to confirm the implementation of the controller, we developed a simulated ship management system to monitor the temperature, humidity, current and illumination conditions, and change the LED color of the controller by changing the RGB value remotely.

A New Dynamic-ID based RFID Mutual Authentication Protocol Eliminated Synchronization Problem (동기화 문제를 해결한 새로운 동적 아이디기반 RFID 상호 인증 프로토콜)

  • Lim, Ji-Hwan;Oh, Hee-Kuck;Kim, Sang-Jin
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.469-480
    • /
    • 2008
  • The recently proposed RFID(Radio Frequency Identification) authentication protocol based on a hash function can be divided into two types according to the type of information used for authentication between a reader and a tag: either a value fixed or one updated dynamically in a tag memory. In this paper, we classify the protocols into a static ID-based and a dynamic-ID based protocol and then analyze their respective strengths and weaknesses. Also, we define a new security model including forward/backward traceability, synchronization, forgery attacks. Based on the model, we analyze the previous protocols and propose a new dynamic-ID based RFID mutual authentication protocol. Our protocol provide enhanced RFID user privacy compared to previous protocols and identify a tag efficiently in terms of the operation quantity of a tag and database.

Highly-reliable Multi-path Protocol by MANET (MANET에 의한 신뢰성 높은 다중 경로 프로토콜)

  • Lee, Yang-Min;Lee, Jae-Kee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.352-362
    • /
    • 2008
  • In the mobile ad hoc network, network nodes are continuously capable of movement, but have battery limitations and these characteristics of MANET cause network link failure. Therefore, when performing ubiquitous services with the application of MANET, a technique is required to improve the packet transmission rates as to enable continuous packet transmission while flexibly adapting to topology changes caused by the mobility of nodes. In this paper, we are proposing PAOMDV(Possibility based AOMDV) and OLSR-ME(OLSR with Modified Energy Efficiency) which are mixed-type protocols to solve the problem for design a more efficient protocol. Especially by classifying mobile ad hoc networks as clusters, OLSR-ME protocol is implemented on communication within the clusters, while PAOMDV is used in protocols between clusters. In addition, a selection algorithm for forwarding nodes that responding packet relays in the case of increased hops was proposed for designing a more efficient protocol than existing protocols. We verified the performance of the proposed protocols through a comparative experiment with AODV, AOMDV, ZRP, and the existing protocols. We confirmed the results of the experiment revealed that the proposed protocol had the best packet transmission rate, the shortest delay between nodes, and showed better results in routing overhead.

Vulnerability Analysis of Remote Multi-Server User Authentication System Based on Smart Card and Dynamic ID (스마트 카드 및 동적 ID 기반 멀티서버 원격 사용자 인증 프로토콜의 취약점 분석)

  • Kwon Soon Hyung;Byeon Hae won;Choi Youn Sung
    • Convergence Security Journal
    • /
    • v.23 no.4
    • /
    • pp.43-52
    • /
    • 2023
  • Many businesses and organizations use smartcard-based user authentication for remote access. In the meantime, through various studies, dynamic ID-based remote user authentication protocols for distributed multi-server environments have been proposed to protect the connection between users and servers. Among them, Qiu et al. proposed an efficient smart card-based remote user authentication system that provides mutual authentication and key agreement, user anonymity, and resistance to various types of attacks. Later, Andola et al. found various vulnerabilities in the authentication scheme proposed by Qiu et al., and overcame the flaws in their authentication scheme, and whenever the user wants to log in to the server, the user ID is dynamically changed before logging in. An improved authentication protocol is proposed. In this paper, by analyzing the operation process and vulnerabilities of the protocol proposed by Andola et al., it was revealed that the protocol proposed by Andola et al. was vulnerable to offline smart card attack, dos attack, lack of perfect forward secrecy, and session key attack.

Mutual Attestation Protocol using Software-based Attestation Scheme in Sensor Network Environments (SWATT 기법을 이용한 센서 노드 간 상호 검증 프로토콜)

  • Heo, Kyung-Soo;Choi, Hyun-Woo;Jang, Hyun-Su;Eom, Young-Ik
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.9-18
    • /
    • 2008
  • Prevention of attacks being made through program modification in sensor nodes is one of the important security issues. The software-based attestation technology that verifies the running code by checking whether it is modified or not in sensor nodes is being used to solve the attack problem. However, the current software-based attestation techniques are not appropriate in sensor networks because not only they are targeting static networks that member nodes does not move, but also they lacks consideration on the environment that the trusted verifier may not exist. This paper proposes a mutual attestation protocol that is suitable for sensor networks by using SWATT(Software-based ATTestation) technique. In the proposed protocol, sensor nodes periodically notify its membership to neighbor nodes and carry out mutual attestation procedure with neighbor nodes by using SWATT technique. With the proposed protocol, verification device detects the sensor nodes compromised by malicious attacks in the sensor network environments without trusted verifier and the sensor networks can be composed of only the verified nodes.

A Ring-based Multicast Routing Architecture for Mobile Ad Hoc Networks (모바일 애드혹 네트워크를 위한 링 기반 멀티캐스트 라우팅 구조)

  • Heo Joon;Hong Choong Seon;Yang Yubai
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.895-904
    • /
    • 2004
  • Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in mobile ad hoc network. In this paper, we propose a novel scheme of Hierarchical Eulerian Ring Oriented Multicast Architecture (HEROMA) over mobile ad hoc network. It has features that concentrate on efficiency and robustness simultaneously. It is also an application-driven proposal for hazard detection. Architectures including Eulerian ring, hierarchy and multicast agent are investigated in detail Simulation results different level of improvements on control traffic, end-to-end delay and packet delivery ratio by comparing with tree-based and mesh-based multicast protocols.

A Fair Certified Electronic Mail Protocol that Enhances Guarantee of Reception (수신 보장성이 향상된 공평한 배달 증명 전자 메일 프로토콜)

  • 박용수;조유근
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.86-94
    • /
    • 2003
  • Certified e-mail system guarantees that recipient will get mail content if and only if mall originator receives a receipt. Unlike previous schemes, Optimistic protocols recently published generate a receipt when it meets the condition that the mail content can be accessed by recliner at any time. So originator cannot assure the delivery of e-mail although he can get a receipt. In this paper, we show some flaws in optimistic protocols and propose improved schemes using delivery deadline. Modified protocols guarantee proof-of-receipt and eliminate the problem mentioned above. Furthermore, proposed modification technique can be applicable to most optimistic protocols and is efficient in the sense that modified schemes do not increase the number of messages.

MAC protocol for Energy-Efficiency and Delay in Ubiquitous Sensor Networks (USN에서 에너지 효율성과 지연을 위한 MAC 프로토콜)

  • Oh, Won-Geun;Lee, Sung-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.4 no.1
    • /
    • pp.20-24
    • /
    • 2009
  • sensor node work limited energy. It is undesirable or impossible to replace the batteries that are depleted of energy because of characteristics of the sensor network. Due to the specific energy constrained environment, MAC design for sensor networks generally has to take energy consumption as one of its primary concerns. But in sensor networks, latency has been a key factor affecting the applicability of sensor networks to some delay-sensitive applications. Therefore, we propose MAC protocols based DSMAC in this paper. Which is able to dynamically change the sleeping and duty cycle of sensors is adjusted to adapt to packet amounts in buffer. Proposed MAC has energy efficiency and low latency, compared DSMAC.

  • PDF

Modeling and Simulation of LEACH Protocol to Analyze DEVS Kernel-models in Sensor Networks

  • Nam, Su Man;Kim, Hwa Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.4
    • /
    • pp.97-103
    • /
    • 2020
  • Wireless sensor networks collect and analyze sensing data in a variety of environments without human intervention. The sensor network changes its lifetime depending on routing protocols initially installed. In addition, it is difficult to modify the routing path during operating the network because sensors must consume a lot of energy resource. It is important to measure the network performance through simulation before building the sensor network into the real field. This paper proposes a WSN model for a low-energy adaptive clustering hierarchy protocol using DEVS kernel models. The proposed model is implemented with the sub models (i.e. broadcast model and controlled model) of the kernel model. Experimental results indicate that the broadcast model based WSN model showed lower CPU resource usage and higher message delivery than the broadcast model.