• Title/Summary/Keyword: 메시지 신뢰도

Search Result 433, Processing Time 0.024 seconds

Study on data preprocessing method based on In-Network data merge (In-Network 데이터 병합 기반 데이터 전처리 기법 연구)

  • Lim, Hwan-Hee;Kim, Se-Jun;Lee, Byung-Jun;Kim, Kyung-tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.01a
    • /
    • pp.91-92
    • /
    • 2019
  • 본 논문에서는 IoT 기기의 각 센서로부터 획득된 데이터에 대한 수집 및 효율적 라우팅 기법을 기반으로 대용량 데이터 수집의 효율성 및 신뢰도 향상을 위해 In-network 데이터 병합 기반 데이터 전처리 기법을 제안한다. 기존의 Wireless Sensor Network에서는 모든 단말 노드가 스스로 라우팅 된 하위 센서 노드들의 데이터를 병합하는 In-network 병합기법을 사용한다. 이 기법은 이벤트가 발생하지 않거나 필요한 쿼리가 없어도 주기적으로 라우팅에 필요한 메시지를 전송하므로 불필요한 에너지 소모를 야기 시키며 데이터 전송 에러가 발생할 확률이 높다. 기존 In-Network 데이터 병합 기법의 효율성 및 정확성을 향상시키기 위해, 본 논문에서는 조건 병합 기반의 In-network 병합 기법을 제안한다.

  • PDF

Wireless Sensor Networks have Applied the Routing History Cache Routing Algorithm (무선센서 네트워크에서 Routing History Cache를 이용한 라우팅 알고리즘)

  • Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1018-1021
    • /
    • 2009
  • Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

  • PDF

A Security Protocol Providing Location Privacy in VANET (VANET 환경에서 위치 프라이버시를 보장하는 보안 프로토콜)

  • Hyo Kim;Heekuck Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1448-1451
    • /
    • 2008
  • VANET(Vehicle Ad-hoc Network)은 통신 기능을 지원하는 지능형 차량들로 이루어진 애드혹 네트워크 환경으로써 최근 들어서 그 연구가 매우 활발하게 진행되고 있는 분야이다. VANET은 원활한 교통 소통, 사고 방지 등 여러 가지 편리한 기능들을 제공하지만, 그 기반을 애드혹 네트워크에 두고 있기 때문에 애드혹 네트워크에서 발생할 수 있는 보안 문제가 그대로 발생하며, 또한 그 환경적 특성에 따라 추가적인 보안 요구사항 역시 존재한다. VANET 환경에서 가장 중요하게 요구되는 보안요소는 협력 운전(cooperative driving) 시 메시지 인증, 무결성, 부인방지 등과 특정 차량에 대한 추적을 할 수 없도록 하는 위치 프라이버시 보호이다. 그러나 이 가운데 사용자의 위치 프라이버시는 조건적으로 신뢰기관에 의한 추적 역시 가능해야 한다는 조건을 포함한다. 본 논문에서는 L. Martucci 등이 제안한 자체적으로 생성하고 인증하는 pseudonym 기법[1]을 이용하여 이러한 보안 요구사항들을 만족시키는 방법을 제안하고자 한다. 제안하는 기법은 최초 차량 등록 시 받은 비밀 인자를 이용하여 보안 통신을 하며 추가적으로 신뢰 기관으로의 통신이 필요하지 않는 효율적인 보안 기법이다. 또한 기존 연구에서 발생했던 저장 공간의 문제, RSU(Road Side Unit) 접근 문제 등을 해결한다.

Development of a Cell Phone Addiction Scale for Korean Parents of Young Children (아동의 휴대전화 중독 사정을 위한 부모용 도구 개발)

  • Koo, Hyun-Young
    • Child Health Nursing Research
    • /
    • v.19 no.1
    • /
    • pp.29-38
    • /
    • 2013
  • Purpose: This study was done to develop a cell phone addiction scale for Korean parents of young children, and to evaluate the reliability and validity of the developed scale. Methods: The scale was developed through construction of a conceptual framework, generation of initial items, verification of content validity, selection of secondary items, preliminary study, and extraction of final items. Participants were 465 parents and 178 children. Data were analyzed using item analysis, factor analysis, criterion related validity, internal consistency, and split-half reliability. Results: Twenty items were categorized into three factors explaining 60.3% of total variance. Factors were named as withdrawal - 4 items, loss of control - 9 items, and persistence - 7 items. Scores for the scale were significantly correlated with self-control, impulsiveness, cell phone use, and cell phone addiction of children as measured by a scale for Korean children. Cronbach's alpha coefficient for the 20 items was .94, and Guttman coefficient was .87. Scale scores identified children as high risk users, at risk users, or average users by standard scores. Conclusion: The results suggest that the cell phone addiction scale for Korean parents is a reliable and valid instrument to measure cell phone addiction in young children.

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.

Message Recovery Fair Blind Multi-Signature Scheme Based on Meta-ElGamal Protocol (Meta-ElGamal 기반 메시지 복원 공정 은닉 다중 서명 기법)

  • 이형우
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.4
    • /
    • pp.23-36
    • /
    • 1999
  • As the blind signature(10) does not reveal any information about the message or its signature it has been used for preventing the information leakage and for providing the anonymity in secure electronic payment systems. Unfortunately this perfect anonymity could be misused by criminals as blind signatures prevent linking the withdrawal of money nd the payment made 표 the same customer. Therefore we should provide publicly verifiable mechanism if it is required for the judge to trace the blackmailed messages. In this paper we propose a modified blind signature scheme which additionally provides the role of message recovery after analyzing the existing meta-ELGamal scheme(12) suggested by Horster. And we suggest a new fair blind multi-signature scheme based on the oblivious transfer protocol with which a judge can publicly verify its fairness and correctness if needed. Proposed scheme can also applicable to the diverse electronic payment applications.

An Adaptive Neighbor Discovery for Tactical Airborne Networks with Directional Antenna (지향성 안테나 기반 공중전술네트워크를 위한 적응적 이웃노드 탐색기법)

  • Lee, Sung-Won;Yoon, Sun-Joong;Ko, Young-Bae
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • Network Centric Warfare(NCW) is becoming a prominent concept in the current trend of warfare. To support high quality communication between strategic/tactical units in the concept of NCW, Tactical Airborne Networks are likely to be constructed in the near future to take part in the NCW. In these Tactical Airborne Networks with dynamic topology variations due to very high mobility of participants nodes, more efficient and reliable neighbor discovery protocols are needed. This paper presents the adaptive HELLO message scheduling algorithm for Tactical Airborne Network using directional antennas. The purposed algorithm can reduce the overhead of periodic HELLO message transfer, while guaranteeing successful data transmission. We concluded a mathematical analysis and simulation studies using Qualnet 4.5 for evaluation the performance and efficiency of the proposed scheme.

An Error Recovery Mechanism for Communications with Reliability in Sensor Network (센서 네트워크에서 신뢰성 있는 통신을 위한 에러 복구 기법)

  • Min, Byung-Ung;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.360-363
    • /
    • 2007
  • In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval hop-by-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports traffic congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

  • PDF

IDE-LEACH Protocol for Trust and Energy Efficient Operation of WSN Environment (WSN의 에너지 효율적 운영을 위한 신뢰성이 보장된 IDE-LEACH 프로토콜)

  • Cho, Young-Bok;Woo, Seng-Hee;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.10
    • /
    • pp.801-807
    • /
    • 2013
  • WSN consists of hundreds to thousands of sensor nodes. In order to solve the problem of energy consumption imbalance cluster head is reelected in every round, while node authentication scheme is utilized for secure communication. However, re-clustering increases the overhead of sensor nodes and during the node authentication phase the frequent AREQ/AREP message exchange also increases the overhead. Therefore, a secure and energy efficient protocol, by which overhead of sensor nodes is reduced and long time communication is achieved, is required for wireless sensor network. In this paper, an energy efficient and reliable IDE-LEACH protocol for WSN is proposed. The proposed protocol is prolongs networks lifetime about average 20% compared to the LEACH-based protocols and all attending nodes in communication form BS authentication consisted of trusted nodes.

An Error Recovery Mechanism for Communications with Reliability and Transport Control for Media Access in Sensor Network (센서 네트워크에서의 매체제어를 위한 전송제어 및 신뢰성 있는 통신을 위한 에러 복구 기법)

  • Min, Byung-Ung;Kim, Dong-Il;Choi, Sam-Gil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1190-1194
    • /
    • 2007
  • In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval herby-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports franc congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.