• 제목/요약/키워드: In-network computation

검색결과 797건 처리시간 0.028초

EETCA: Energy Efficient Trustworthy Clustering Algorithm for WSN

  • Senthil, T.;Kannapiran, Dr.B.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5437-5454
    • /
    • 2016
  • A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

Robust Conditional Privacy-Preserving Authentication based on Pseudonym Root with Cuckoo Filter in Vehicular Ad Hoc Networks

  • Alazzawi, Murtadha A.;Lu, Hongwei;Yassin, Ali A.;Chen, Kai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권12호
    • /
    • pp.6121-6144
    • /
    • 2019
  • Numerous privacy-preserving authentication schemes have been proposed but vehicular ad hoc networks (VANETs) still suffer from security and privacy issues as well as computation and communication overheads. In this paper, we proposed a robust conditional privacy-preserving authentication scheme based on pseudonym root with cuckoo filter to meet security and privacy requirements and reduce computation and communication overheads. In our proposed scheme, we used a new idea to generate pseudonyms for vehicles where each on-board unit (OBU) saves one pseudonym, named as "pseudonym root," and generates all pseudonyms from the same pseudonym. Therefore, OBU does not need to enlarge its storage. In addition, the scheme does not use bilinear pairing operation that causes computation overhead and has no certification revocation list that leads to computation and communication overheads. The proposed scheme has lightweight mutual authentication among all parties and just for once. Moreover, it provides strong anonymity to preserve privacy and resists ordinary attacks. We analyzed our proposed scheme and showed that it meets security and privacy requirements of VANETs and is more efficient than traditional schemes. The communication and computation overheads were also discussed to show the cost-effectiveness of the proposed scheme.

센서 데이터 스트림 환경에서 효율적인 질의처리 연구방향 (Research Directions for Efficient Query Processing over Sensor Data Streams)

  • 안동찬
    • 한국컴퓨터정보학회지
    • /
    • 제14권2호
    • /
    • pp.199-204
    • /
    • 2006
  • 센서 네트워크는 센싱(sensing), 연산(computation), 통신(communication) 능력을 갖춘 센서 노드들의 무선 네트워크라고 할 수 있다. 각각의 센서 노드들은 노드에 있는 하나 이상의 센서들에 의해 얻어지는 데이터아이템들을 생성한다. 이러한 특징은 센서 네트워크가 분산 데이터베이스 시스템과도 유사한 특징을 가지고 있음을 알 수 있다. 그러나 센서 네트워크에서 센서 노드의 제한된 전력(power)과 메모리 자원은 가장 큰 단점이며 주요 연구 대상이 되고 있다. 본 연구에서는 이러한 센서 네트워크 환경에서 발생되는 데이터 즉, 센서 데이터 스트림을 제한된 자원을 효율적으로 활용하면서 질의에 대해 효율적으로 응답하는 방안을 여러 가지 측면에서 모색해 보았다.

  • PDF

MIN의 최적경로 배정을 위한 신경회로망 알고리즘의 비교 (Comparison of neural network algorithms for the optimal routing in a Multistage Interconnection Network)

  • 김성수;공성곤
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1995년도 추계학술대회 논문집 학회본부
    • /
    • pp.569-571
    • /
    • 1995
  • This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

  • PDF

Path Computation Element 프로토콜 (PCEP)의 설계 및 구현 - FSM과 인터페이스 (Design and Implementation of Path Computation Element Protocol (PCEP) - FSM and Interfaces)

  • 이원혁;강승애;김현철
    • 융합보안논문지
    • /
    • 제13권4호
    • /
    • pp.19-25
    • /
    • 2013
  • 백본(코어) 네트워크에서 유연하고 안정적인 품질이 보장되는 서비스 제공에 대한 요구가 폭발적으로 증가하면서 이러한 요구를 수용하기 위해 제어평면의 프로토콜로 MPLS/GMPLS가 도입되었다. GMPLS 기반 제어평면에서 경로계산 및 상호연동 기능은 최적의 서비스 품질을 제공하기 위한 핵심기술 중의 하나이다. 이를 위해 IETF에서는 Path Computation Element (PCE) 구조를 제안하였다. PCE는 경로계산 전용의 네트워크 요소이며 경로계산을 요청하는 Path Computation Clients (PCC) 와 경로계산을 수행하는 PCE 간의 통신은 PCE 프로토콜 (PCEP)을 이용한다. 본 논문은 PCE 기반 경로계산 구조에 대해서 살펴보고 이를 기반으로 PCEP 설계 및 구현을 위한 몇 가지 요소를 제시하였다. 우선 본 논문에서는 PCEP Finite State Machine (FSM)을 포함하여 각 상태에서 필요한 동작 요소를 정리하였다. 또한 본 논문에서는 PCEP에서 제공하는 통신 채널을 효과적으로 제어하기 위한 내부/외부 인터페이스를 더불어 제안하였다.

Towards Improving Causality Mining using BERT with Multi-level Feature Networks

  • Ali, Wajid;Zuo, Wanli;Ali, Rahman;Rahman, Gohar;Zuo, Xianglin;Ullah, Inam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권10호
    • /
    • pp.3230-3255
    • /
    • 2022
  • Causality mining in NLP is a significant area of interest, which benefits in many daily life applications, including decision making, business risk management, question answering, future event prediction, scenario generation, and information retrieval. Mining those causalities was a challenging and open problem for the prior non-statistical and statistical techniques using web sources that required hand-crafted linguistics patterns for feature engineering, which were subject to domain knowledge and required much human effort. Those studies overlooked implicit, ambiguous, and heterogeneous causality and focused on explicit causality mining. In contrast to statistical and non-statistical approaches, we present Bidirectional Encoder Representations from Transformers (BERT) integrated with Multi-level Feature Networks (MFN) for causality recognition, called BERT+MFN for causality recognition in noisy and informal web datasets without human-designed features. In our model, MFN consists of a three-column knowledge-oriented network (TC-KN), bi-LSTM, and Relation Network (RN) that mine causality information at the segment level. BERT captures semantic features at the word level. We perform experiments on Alternative Lexicalization (AltLexes) datasets. The experimental outcomes show that our model outperforms baseline causality and text mining techniques.

발전 플랜트 설계용 시뮬레이터에서 Executive system의 개발 (Development of executive system in power plant simulator)

  • 예재만;이동수;권상혁;노태정
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
    • /
    • pp.488-491
    • /
    • 1997
  • The PMGS(Plant Model Generating System) was developed based on modular modeling method and fluid network calculation concept. Fluid network calculation is used as a method of real-time computation of fluid network, and the module which has a topology with node and branch is defined to take advantages of modular modeling. Also, the database which have a shared memory as an instance is designed to manage simulation data in real-time. The applicability of the PMGS was examined implementing the HRSG(Heat Recovery Steam Generator) control logic on DCS.

  • PDF

자동 양자이득 조정에 의한 퍼지 제어방식 (Fuzzy Control Method By Automatic Scaling Factor Tuning)

  • 강성호;임중규;엄기환
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 V
    • /
    • pp.2807-2810
    • /
    • 2003
  • In this paper, we propose a fuzzy control method for improving the control performance by automatically tuning the scaling factor. The proposed method is that automatically tune the input scaling factor and the output scaling factor of fuzzy logic system through neural network. Used neural network is ADALINE (ADAptive Linear NEron) neural network with delayed input. ADALINE neural network has simple construct, superior learning capacity and small computation time. In order to verify the effectiveness of the proposed control method, we performed simulation. The results showed that the proposed control method improves considerably on the environment of the disturbance.

  • PDF

최적분해법에 의한 최단경로계산 (Shortest paths calculation by optimal decomposition)

  • 이장규
    • 전기의세계
    • /
    • 제30권5호
    • /
    • pp.297-305
    • /
    • 1981
  • The problem of finding shortest paths between every pair of points in a network is solved employing and optimal network decomposition in which the network is decomposed into a number of subnetworks minimizing the number of cut-set between them while each subnetwork is constrained by a size limit. Shortest path computations are performed on individual subnetworks, and the solutions are recomposed to obtain the solution of the original network. The method when applied to large scale networks significantly reduces core requirement and computation time. This is demonstrated by developing a computer program based on the method and applying it to 30-vertex, 160-vertex, and 273-vertex networks.

  • PDF

진동성 신경회로망의 CMOS 회로설계 (CMOS Circuit Design of a Oscillatory Neural Network)

  • 송한정
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • pp.103-106
    • /
    • 2003
  • An oscillatory neural network circuit has been designed and fabricated in an 0.5 ${\mu}{\textrm}{m}$ double poly CMOS technology. The proposed oscillatory neural network consists of 3 neural oscillator cells with excitatory synapses and a neural oscillator cell with inhibitory synapse. Simulations of a network of oscillators demonstrate cooperative computation. Measurements of the fabricated chip in condition of $\pm$ 2.5 V power supply is shown.

  • PDF