• Title/Summary/Keyword: Sensor Node Relocation

Search Result 3, Processing Time 0.02 seconds

Adaptive Success Rate-based Sensor Relocation for IoT Applications

  • Kim, Moonseong;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3120-3137
    • /
    • 2021
  • Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.

Configuration Technique of Efficient Wireless Sensor Networks using Node Relocation Algorithm (노드 재배치 알고리즘을 이용한 효율적인 무선 센서 네트워크 구성 기법)

  • Heo, Junyoung;Min, Hong;Kim, Bongjae;Jung, Jinman
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.205-210
    • /
    • 2017
  • Wireless sensor networks are useful to various unmanned monitoring application such as monitoring environments, surveillance system, unmanned space exploration, and so on. Due to the inappropriate placement of sensor nodes, there are some problems, for example, low connectivity and high overlapped sensing area. These problems can make it difficult for the data collection and lead to a waste of energy. In this paper, we propose a node relocating method to resolve the inappropriate placement of sensor nodes. Given monitoring area, we place sensor nodes randomly and find redundant nodes and move them to uncovered area. Through the simulation, We show that the proposed method is viable and efficient compared with the existing randomly locating method.

Uniform Sensor-node Request Scheme for the Recovery of Sensing Holes on IoT Network (IoT 네트워크의 센싱홀 복구를 위한 센서 이동 균등 요청 방법)

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.16 no.4
    • /
    • pp.9-17
    • /
    • 2020
  • When IoT sensor nodes are deployed in areas where data collection is challenging, sensors must be relocated if sensing holes occur due to improper placement of sensors or energy depletion, and data collection is impossible. The sensing hole's cluster header transmits a request message for sensor relocation to an adjacent cluster header through a specific relay node. However, since a specific relay node is frequently used, a member sensor located in a specific cluster area adjacent to the sensing hole can continuously receive the movement message. In this paper, we propose a method that avoids the situation in which the sensing hole cluster header monopolizes a specific relay node and allows the cluster header to use multiple relay nodes fairly. Unlike the existing method in which the relay node immediately responds to the request of the header, the method proposed in this paper solves a ping-pong problem and a problem that the request message is concentrated on a specific relay node by applying a method of responding to the request of the header using a timer. OMNeT++ simulator was used to analyze the performance of the proposed method.