• Title/Summary/Keyword: Representative node

Search Result 129, Processing Time 0.035 seconds

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

  • Lee, Taekkyeun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.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.

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

  • Chung, Myoung-Bum;Ko, Il-Ju
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.12
    • /
    • pp.1037-1044
    • /
    • 2007
  • Recently, we extract the representative melody of the music and index the music to reduce searching time at the content-based music retrieval system. The existing study has used MIDI data to extract a representative melody but it has a weak point that can use only MIDI data. Therefore, this paper proposes a representative melody retrieval method that can be use at all audio file format and uses digital signal processing. First, we use Fast Fourier Transform (FFT) and find the tempo and node for the representative melody retrieval. And we measure the frequency of high value that appears from PCM Data of each node. The point which the high value is gathering most is the starting point of a representative melody and an eight node from the starting point is a representative melody section of the audio data. To verity the performance of the method, we chose a thousand of the song and did the experiment to extract a representative melody from the song. In result, the accuracy of the extractive representative melody was 79.5% among the 737 songs which was found tempo.

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

  • Shin, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.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
    • /
    • v.8 no.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.

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

  • Hong-Jin Park
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.16 no.5
    • /
    • pp.256-264
    • /
    • 2023
  • Smart farm technology using IoT is one of the technologies that can increase productivity and improve the quality of agricultural products in agriculture, which is facing difficulties due to the decline in rural population, lack of rural manpower due to aging, and increase in diseases and pests due to climate change. . Smart farms using existing IoT simply monitor farms, implement smart plant growers, and have automatic greenhouse opening and closing systems. This paper implements a smart farm system based on MQTT, an industry standard protocol for the Internet of Things, and Node-RED, a representative development middleware for the Internet of Things. First, data is extracted from Arduino sensors, and data is collected and transmitted from IoT devices using the MQTT protocol. Then, Node-RED is used to process MQTT messages and store the sensing data in real time in MongoDB, a representative NoSQL, to store the data. Through this smart farm system, farm managers can use a computer or mobile phone to check sensing information on the smart farm in real time, anytime, anywhere, without restrictions on time and space.

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

  • Chaehyeon Kim;Hyewon Ryu;Ki Yong Lee
    • Journal of Information Processing Systems
    • /
    • v.19 no.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.

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

  • Lee, Taekmin;Lee, Jinhae;Wang, Jihyeun;Yoo, Joonhyuk;Yoo, Seong-eun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.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 (센서 네트워크의 균등분포 클러스터 기반 멀티홉 라우팅)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.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
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • 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

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

  • Park, Hee-Jung;Kim, Kyung-Tae;Youn, Hee-Young
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2014.01a
    • /
    • pp.353-354
    • /
    • 2014
  • 무선 센서 네트워크(WSN)환경에서는 저가의 센서 노드를 구성하기 위해 배터리, 제한된 에너지 등과 같은 하드웨어적인 제약을 갖고 있다. 특히, 센서 노드의 제한된 에너지는 네트워크 수명과 직접적인 관련이 있기 때문에 네트워크의 수명을 연장하기 위한 효율적인 기법들이 요구되는 실정이다. 이를 위해 본 논문에서는 WSN환경에서 고정 노드와 모바일 노드를 혼용하여 음영지역을 최소화할 수 있는 모바일 노드 이동 기법을 제안한다. 이는 대표 노드를 선정하여 네트워크의 밀도를 제어하고 각 노드들의 거리에 따라 신호 세기를 제어한다. 이를 통해 네트워크 지역의 확장과 각 노드의 에너지를 효율적으로 사용할 수 있다.

  • PDF