• 제목/요약/키워드: Representative node

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

A Grid-based Efficient Routing Protocol for a Mobile Sink in Wireless Sensor Networks

  • Lee, Taekkyeun
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권2호
    • /
    • pp.35-43
    • /
    • 2018
  • In this paper, we propose a grid-based efficient routing protocol for a mobile sink in wireless sensor networks. In the proposed protocol, the network is partitioned into grids and each grid has a grid head. For the efficient routing to a mobile sink, the proposed protocol uses a mobile sink representative node to send the data to a mobile sink and grid heads are used as a mobile sink representative node. Furthermore, the proposed protocol uses nodes in the boundary of the center grid as position storage nodes. The position storage nodes store the position of a mobile sink representative node and provide source nodes with it for data delivery. With these features, the proposed protocol can reduce a lot of overhead to update the position information and improve the delay of data delivery to a mobile sink. The proposed protocol performs better than other protocols in terms of the delay and the energy consumption per node in the performance evaluation.

오디오의 파형과 FFT 분석을 이용한 대표 선율 검색 (Representative Melodies Retrieval using Waveform and FFT Analysis of Audio)

  • 정명범;고일주
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제34권12호
    • /
    • pp.1037-1044
    • /
    • 2007
  • 최근 내용 기반 음악 검색 시스템에서는 사용자의 응답 시간을 단축시키기 위해 음악의 대표성을 갖는 선율을 추출하여 색인하고, 검색 시 이를 사용한다. 기존 연구에서는 미디(midi) 데이타를 이용하여 대표 선율을 추출하는 방법이 제안되었으나, 미디 데이타에 한정되는 단점이 있었다. 따라서 본 논문에서는 디지털 신호처리를 이용하여 모든 오디오 파일 포맷에 적용 가능한 대표 선율 검색을 제안한다. 대표 선율 검색을 위해 FFT(Fast Fourier Transform)을 이용하여 박자와 마디를 찾고 각 마디들의 PCM 데이타로부터 높은 수치가 나타나는 빈도를 측정한다. 이때 높은 수치들이 가장 많이 뭉쳐 있는 영역에서 여덟 마디 간격이 오디오 데이타의 대표 선율 영역이다. 제안 방법의 유효성을 검증하기 위한 실험으로 총 1000곡을 선택하여 대표 선율을 추출하였고, 그 결과 템포를 찾아낸 737곡 중 79.5%의 정확성을 보였다.

상태천이모델 기반의 센서 노드 설계 (Sensor Node Design based on State Transition Model)

  • 신동현;김창화
    • 한국멀티미디어학회논문지
    • /
    • 제20권8호
    • /
    • pp.1357-1368
    • /
    • 2017
  • Sensor networks are used in various fields such as marine, defense, and smart home etc. Among the components of the sensor network, the sensor node collects sensor data, as one of the representative sensor network roles, and the sensor node makes a greate influence on the overall performance of the sensor network. Therefore, how to design the sensor node is an important issue in the sensor network field. However, the research on the sensor network architecture suitable for the sensor network installation environment has been made more important than the research on how to configure the sensor node. In this paper, we propose to identify elements to be considered for designing a sensor node that makes a large influence on the performance of the sensor network, and to easily implement the sensor node through the state transition model based on these elements.

A New Link-Based Single Tree Building Algorithm for Shortest Path Searching in an Urban Road Transportation Network

  • Suhng, Byung Munn;Lee, Wangheon
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권4호
    • /
    • pp.889-898
    • /
    • 2013
  • The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

MQTT와 Node-RED를 기반한 MongoDB로 저장 하는 스마트 팜 시스템 구현 (Based on MQTT and Node-RED Implementation of a Smart Farm System that stores MongoDB)

  • 박홍진
    • 한국정보전자통신기술학회논문지
    • /
    • 제16권5호
    • /
    • pp.256-264
    • /
    • 2023
  • 농촌의 인구 감소, 고령화에 따른 농촌 인력 부족, 기후 변화에 따른 병해충 증가로 인해 어려움을 격고 있는 농업에 생산성을 높이고, 농산물의 품질을 향상시키는 기술 중 하나가 IoT를 활용한 스마트 팜 기술이다. 기존의 IoT를 활용한 스마트 팜은 단순히 농장을 모니터링하거나, 스마트 식물 재배기 구현, 온실 자동 개폐 시스템 등이 있다. 본 논문은 사물 인터넷의 산업 표준 프로토콜인 MQTT와 사물 인터넷의 대표적인 개발 미들웨어인 Node-RED을 기반한 스마트 팜 시스템을 구현한다. 먼저, 아두이노 센서들로 데이터를 추출하고, MQTT 프로토콜을 사용하여 IoT 디바이스에서 데이터를 수집하고 전송한다. 그런 다음, Node-RED를 사용하여 MQTT 메시지를 처리하고 데이터를 저장하기 위해 대표적인 NoSQL인 MongoDB에 실시간적으로 센싱 데이터를 저장한다. 농장 관리자는 본 스마트 팜 시스템을 통해 컴퓨터나 모바일 폰을 이용하여 시간과 공간에 제약없이 언제 어디든지 실시간적으로 스마트 팜에 센싱 정보를 확인할 수 있다.

A Gradient-Based Explanation Method for Node Classification Using Graph Convolutional Networks

  • Chaehyeon Kim;Hyewon Ryu;Ki Yong Lee
    • Journal of Information Processing Systems
    • /
    • 제19권6호
    • /
    • pp.803-816
    • /
    • 2023
  • Explainable artificial intelligence is a method that explains how a complex model (e.g., a deep neural network) yields its output from a given input. Recently, graph-type data have been widely used in various fields, and diverse graph neural networks (GNNs) have been developed for graph-type data. However, methods to explain the behavior of GNNs have not been studied much, and only a limited understanding of GNNs is currently available. Therefore, in this paper, we propose an explanation method for node classification using graph convolutional networks (GCNs), which is a representative type of GNN. The proposed method finds out which features of each node have the greatest influence on the classification of that node using GCN. The proposed method identifies influential features by backtracking the layers of the GCN from the output layer to the input layer using the gradients. The experimental results on both synthetic and real datasets demonstrate that the proposed explanation method accurately identifies the features of each node that have the greatest influence on its classification.

분산 낙하 이동 모델에서의 평균 노드 거리 기반 적응적 OLSR 프로토콜 (Adaptive OLSR Protocol Based on Average Node Distance in Airdropped Distributed Mobility Model)

  • 이택민;이진해;왕지현;유준혁;유성은
    • 대한임베디드공학회논문지
    • /
    • 제13권2호
    • /
    • pp.83-91
    • /
    • 2018
  • With the development of IT (Information Technology) technology, embedded system and network technology are combined and used in various environments such as military environment as well as everyday life. In this paper, we propose a new airdropped distributed mobility model (ADMM) modeling the dispersion falling of the direct shot of a cluster bomb, and we compare and analyze some representative MANET routing protocols in ADMM in ns-3 simulator. As a result of the analysis, we show OLSR routing protocol is promising in ADMM environment in the view points of packet delivery ratio (PDR), end to end delay, and jitter. In addition, we propose a new adaptation scheme for OLSR, AND-OLSR (Average Node Distance based adaptive-OLSR) to improve the original OLSR in ADMM environment. The new protocol calculates the average node distance, adapts the period of the control message based on the average node distance increasing rate. Through the simulation study, we show that the proposed AND-OLSR outperforms the original OLSR in PDR and control message overhead.

센서 네트워크의 균등분포 클러스터 기반 멀티홉 라우팅 (Balanced Cluster-based Multi-hop Routing in Sensor Networks)

  • 우매리
    • 한국멀티미디어학회논문지
    • /
    • 제19권5호
    • /
    • pp.910-917
    • /
    • 2016
  • Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

A Sinkhole Detection Method based on Incremental Learning in Wireless Ad Hoc Networks

  • Kim, Ki-Sung;Kim, Se-Hun
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2007년도 추계학술대회 및 정기총회
    • /
    • pp.377-382
    • /
    • 2007
  • Mobile ad hoc network(MANET) is a kind of wireless network which has no infrastructure. Each component node of MANET can move freely and communicate based on wireless peer to peer mode. Because of its vulnerable routing protocols, MANET is exposed to many kinds of attacks. A sinkhole attack is one of the representative attacks in MANET caused by attempts to draw all network traffic to a sinkhole node. This paper focuses on the sinkhole problem on Dynamic Source Routing(DSR) protocol in MANET. To detect the sinkhole node, we extract several useful sinkhole indicators through analyzing the sinkhole problem, then propose an efficient detection method based on an incremental learning algorithm. The simulation results show that the proposed method is effective and reliable for detecting sinkhole intrusion.

  • PDF

WSN 환경에서의 에너지 효율성을 위한 방법론 연구 (A Study on Methodology for energy efficiency in WSN)

  • 박희정;김경태;윤희용
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2014년도 제49차 동계학술대회논문집 22권1호
    • /
    • pp.353-354
    • /
    • 2014
  • 무선 센서 네트워크(WSN)환경에서는 저가의 센서 노드를 구성하기 위해 배터리, 제한된 에너지 등과 같은 하드웨어적인 제약을 갖고 있다. 특히, 센서 노드의 제한된 에너지는 네트워크 수명과 직접적인 관련이 있기 때문에 네트워크의 수명을 연장하기 위한 효율적인 기법들이 요구되는 실정이다. 이를 위해 본 논문에서는 WSN환경에서 고정 노드와 모바일 노드를 혼용하여 음영지역을 최소화할 수 있는 모바일 노드 이동 기법을 제안한다. 이는 대표 노드를 선정하여 네트워크의 밀도를 제어하고 각 노드들의 거리에 따라 신호 세기를 제어한다. 이를 통해 네트워크 지역의 확장과 각 노드의 에너지를 효율적으로 사용할 수 있다.

  • PDF