• Title/Summary/Keyword: 랜덤 네트워크

Search Result 195, Processing Time 0.023 seconds

Implementation of Publickey-based Key Distribution in Wireless Sensor Network (공개암호키를 사용한 센서네트워크에서의 키 분배 구현)

  • Oh, Kyung-Hee;Kim, Tae-Sung;Kim, Ho-Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2008.02a
    • /
    • pp.95-98
    • /
    • 2008
  • 센서네트워크는 넓은 지역에 무선 인프라로 묶여 설치된 센서들을 사용하여 상황 인지로 감지된 데이터를 응용서비스 서버와 연동하는 기술이다. 이는 환경 감시, 대상 추적, 환자 모니터링, 군사적 목적 등 매우 다양한 분야에 사용될 수 있다. 센서네트워크 역시 기존 네트워크에서 필요로 하는 보안 기능을 요구한다. 그러나 센서네트워크에 사용되는 노드들이 사용할 수 있는 자원에 제약이 있어, 기존의 암호기술을 그대로 적용하는데 어려움이 있다. 이러한 센서네트워크에서의 키 분배 문제를 해결하기 위하여 인증센터를 사용하는 기법, 랜덤 키 사전 분배 기법, q-합성수 랜덤 키 사전 분배 기법, Blom 스킴, 위치 기반 키 사전 분배 기법 등이 제안되어 있다. 한편, 공개키 연산의 많은 부하로 인하여 공개키 기법을 센서네트워크에 적용하기에 적합하지 않으리라 여겨져 왔으나, 최근의 연구결과들에 의하면 PKI처럼 복잡한 시스템을 구현하는 것은 부적합할지라도 공개키를 이용한 키 분배 기법을 센서네트워크에 적용하는 것이 실효성이 있다는 것을 보여준다. 본 논문에서는 TinyOS 플랫폼에서 공개키를 이용하여 센서 노드 간 상호 인증 및 세션키를 생성하여 암호 데이터 통신을 수행하는 센서네트워크 플랫폼을 구현한 결과를 제시한다.

  • PDF

Numerical Analysis of Authentication Algorithm using Randomized CA Groups in Mobile Ad Hoc Networks (모바일 애드혹 네트워크에서 랜덤 CA 그룹을 이용한 인증 알고리즘에 대한 성능 분석)

  • Lee, Yong;Lee, Goo-Yeon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.8
    • /
    • pp.22-33
    • /
    • 2009
  • Mobile Ad Hoc Networks (MANETs) are self-organized networks that do not rely in their operation on wired infrastructure. As in any networking technology, security is an essential element in MANET as well, for proliferation of this type of networks. But supporting secure communication in MANETs proved to be a significant challenge, mainly due to the fact that the set of nodes in the network can change frequently and rapidly and due to the lack of access to the wired infrastructure. In particular, the trust model and the authentication protocols, which were developed for wired and infrastructure-based networks, cannot be used in MANETs. In [1], we addressed the problem of efficient authentication of distributed mobile users in geographically large networks and proposed a new authentication scheme for this case of MANETs. The proposed scheme exploits randomized groups to efficiently share authentication information among nodes that together implement the function of a distributive Certification Authority(CA). In this paper, we analyze numerically the performance of authentication method using randomized groups and compare with the simulation result.

Comparison of Parallelized Network Coding Performance (네트워크 코딩의 병렬처리 성능비교)

  • Choi, Seong-Min;Park, Joon-Sang;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.19C no.4
    • /
    • pp.247-252
    • /
    • 2012
  • Network coding has been shown to improve various performance metrics in network systems. However, if network coding is implemented as software a huge time delay may be incurred at encoding/decoding stage so it is imperative for network coding to be parallelized to reduce time delay when encoding/decoding. In this paper, we compare the performance of parallelized decoders for random linear network coding (RLC) and pipeline network coding (PNC), a recent development in order to alleviate problems of RLC. We also compare multi-threaded algorithms on multi-core CPUs and massively parallelized algorithms on GPGPU for PNC/RLC.

Stochastic Mobility Model for Energy Efficiency in MANET Environment (MANET 환경에서 에너지 효율적인 Stochastic 노드 이동 모델)

  • Yun, Dai-Yeol;Yoon, Chang-Pyo;Hwang, Chi Gon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.05a
    • /
    • pp.444-446
    • /
    • 2021
  • MANETs(Mobile Ad-hoc Networks) are composed of mobile nodes that are not subordinate to fixed networks and have the feature that can form their own networks. they are used in various fields for specific goals. The mobility model in MANET can be applied in various ways depending on the purpose of usage. The random mobility model has the advantage of being simple and easy to implement, so it is being used the most. In a MANET, it is assumed that each node moves independently. The random movement model is a good model for expressing this independence of each node. However, it is insufficient to express the characteristics of all nodes with only random properties of individual nodes. This paper limits the stochastic mobility model applicable in MANET. we compare the proposed stochastic mobility model and the random mobility model. We confirm that the proposed mobility model is applied to the routing protocol to show improved characteristics in terms of energy consumption efficiency.

  • PDF

Nonlinear Control of Network based Systems with Random Time Delays using Intelligent Algorithms (지능형 알고리즘을 이용한 랜덤 시간지연을 갖는 네트워크 기반 시스템의 비선형 제어)

  • Cho, Hyun-Cheol;Lee, Kwon-Soon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.5
    • /
    • pp.660-667
    • /
    • 2007
  • 본 논문은 확률특성을 갖는 네트워크 기반 제어시스템(NCS; Networked Control Systems)을 위하여 동적 베이시안 네트워크(DBN; Dynamic Bayesian Networks)와 신경회로망 기법을 이용한 지능제어기법을 제안한다. 신경회로망은 시변 시간지연을 갖는 비선형 시스템의 실시간 오차를 보상하기 위한 제어기의 최적화에 적용된다. 모듈화 신경회로망이 구성되며 이것은 제어기의 파라미터를 출력한다 가장 간단한 DBN 구조인 마코브 체인(MC; Markov Chain)이 구성되며 NCS의 랜덤 관측값을 모델링에 적용되며 예측 제어기의 구성에 또한 사용된다. 제안한 제어기법은 위성시스템의 자세제어에 적용하여 컴퓨터 시뮬레이션을 통해 성능을 검증하였다.

Multi-hop Transmission Scheme for Delay-Sensitive Information in Wireless Sensor Networks (무선 센서 네트워크에서 지연에 민감한 정보의 다중 홉 전송 기법)

  • Cha, Jae-Ryong;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.876-884
    • /
    • 2012
  • This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

Network Coding-Based Information Sharing Strategy for Reducing Energy Consumption in IoT Environments (사물인터넷 환경에서 에너지 소모량을 줄이기 위한 네트워크 부호화 기반 정보 공유 방식)

  • Kim, Jung-Hyun;Park, Dabin;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.4
    • /
    • pp.433-440
    • /
    • 2016
  • This paper proposes a method of minimizing total energy consumption of IoT environment when communication devices in the network share the information directly. The proposed method reduces total number of transmission for the information sharing by using an effective network coding-based technique which dynamically selects a node and a data packet for each transmission. Simulation results show that the proposed method has better performance than an existing network coding-based method selecting transmission node in fixed order, a network coding-based method selecting transmission node in random order, and a uncoded method selecting transmission node in random order.

Random Linear Network Coding to Improve Reliability in the Satellite Communication (위성 통신에서 신뢰성 향상을 위한 랜덤 선형 네트워크 코딩 기술)

  • Lee, Kyu-Hwan;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.9
    • /
    • pp.700-706
    • /
    • 2013
  • In this paper, we propose a method for applying random linear network coding in satellite communication to improve reliability. In the proposed protocol, network-coded redundancy (NC-R) packets are transmitted in the PEP (Performance Enhancement Proxy). Therefore, if data packets is lost by wireless channel error, they can be recovered by NC-R packets. We also develop the TCP performance model of the proposed protocol and evaluate the performance of the proposed protocol. In the simulation results, It is shown that the proposed protocol can improve the TCP throughput as compared with that of the conventional TCP because the NC-R packets is sent by the sender-side PEP and the receiver-side PEP use these packets to recover the lost packets, resulting in reducing the packet loss in TCP.

A Multi-tiered Data Security Scheme for Sensor Network Environments (센서 네트워크의 다층형 데이터 보안 방법)

  • 박수용;김성수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.355-357
    • /
    • 2004
  • 센서 네트워크는 계산 용량과 에너지가 제한적이라는 특성을 가지며 그 결과 시스템의 보안관련 요구를 만족시키기 위해 기존 네트워크의 방식을 적용할 수 없다. 본 논문에서는 센서 네트워크의 보안을 위하여 기존 다층화 된 보안구조에서 사용되는 키 분배 방식을 개선함으로써 에너지 소모를 크게 증가시키지 않으며 전체 네트워크의 신뢰도를 개선할 수 있는 방법을 제안한다. 랜덤 그래프의 성질을 이용한 키 분배 방식으로 이를 이용하여 비교적 낮은 에너지 소모와 개선된 신뢰성을 적절히 제공할 수 있다.

  • PDF