• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.4
• /
• pp.530-536
• /
• 2008

Localization is one of the fundamental problems in wireless sensor networks (WSNs) that forms the basis for many location-aware applications. Localization in WSNs is to determine the position of node based on the known positions of several nodes. Most of previous localization method use triangulation or multilateration based on the angle of arrival (AOA) or distance measurements. In this paper, we propose an enhanced centroid localization method based on edge weights of adjacent nodes using fuzzy modeling and genetic algorithm when node connectivities are known. The simulation results shows that our proposed centroid method is more accurate than the simple centroid method using connectivity only.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2099-2106
• /
• 2006

In this paper, we addressed the node positioning method for minimizing the sensing energy consumption in wireless sensor networks with adjustable sensing ranges. It is necessary for minimizing the sensing energy consumption to minimize the overlapped sensing area by neighboring nodes. To find a optimal node position, we derived a optimal equations by using the overlapped areas, each node's radiuses and expended angles of opposite neighboring nodes. Based on it, we devised a new node positioning method, called as ASRC(Adjustable Sensing Ranges Control). Unlike existing condition based model, our proposed method was derived from mathematical formula, and we confirmed its validity of sensing energy consumption through simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2469-2490
• /
• 2019

A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

• 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.

• Smart Media Journal
• /
• v.9 no.4
• /
• pp.170-175
• /
• 2020

It is important to select the most appropriate channel for efficient transmission of massive multimedia data between smart devices in wireless sensor network. In the fixed channel method, sensor nodes can restrict usefulness of frequency and may be a major constraint to support frequency at various environments. In this paper, we propose a modified efficient channel search algorithm that determines available channel and tolerance of interference of links between two nodes. From the results of computer simulation, the proposed method shows that the link of channel can be set efficiently than the other methods even if the number of interference links increases and the beacon packet waiting time caused by interference is reduced remarkably.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1728-1742
• /
• 2023

In this paper, we extended a hierarchical clustering technique, which is the most researched in the sensor network field, and studied a dynamic differential clustering technique to minimize energy consumption and ensure equal lifespan of all sensor nodes while considering the mobility of sinks. In a sensor network environment with mobile sinks, clusters close to the sinks tend to consume more forwarding energy. Therefore, clustering that considers forwarding energy consumption is desired. Since all clusters form a hierarchical tree, the number of levels of the tree must be considered based on the size of the cluster so that the cluster size is not growing abnormally, and the energy consumption is not concentrated within specific clusters. To verify that the proposed DDC protocol satisfies these requirements, a simulation using Matlab was performed. The FND (First Node Dead), LND (Last Node Dead), and residual energy characteristics of the proposed DDC protocol were compared with the popular clustering protocols such as LEACH and EEUC. As a result, it was shown that FND appears the latest and the point at which the dead node count increases is delayed in the DDC protocol. The proposed DDC protocol presents 66.3% improvement in FND and 13.8% improvement in LND compared to LEACH protocol. Furthermore, FND improved 79.9%, but LND declined 33.2% when compared to the EEUC. This verifies that the proposed DDC protocol can last for longer time with more number of surviving nodes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2461-2466
• /
• 2003

This paper presents a simple sensor fusion algorithm using neural network for navigation of mobile robots with obstacle avoidance and trap recovery. The multiple sensors input sensor data to the input layer of neural network activating the input nodes. The multiple sensors used include optical encoders, ultrasonic sensors, infrared sensors, a magnetic compass sensor, and GPS sensors. The proposed sensor fusion algorithm is combined with the VFH(Vector Field Histogram) algorithm for obstacle avoidance and AGPM(Adaptive Goal Perturbation Method) which sets adaptive virtual goals to escape trap situations. The experiment results show that the proposed low-level fusion algorithm is effective for real-time navigation of mobile robot.

• Journal of Environmental Science International
• /
• v.17 no.1
• /
• pp.77-83
• /
• 2008

The purpose of this study was to develop the national park visitor counting system using the ubiquitous sensor network. This system is composed of a sensor node, sink node, gateways, CDMA module, server, and clients. The results of the study were: 1) stable data transmission distance was possible within 100 meters between sensor nodes, 2) the developed counting sensor system showed a network communication stability level of 88.3 percent in 1.2m wide trails. When installed in concentrate use areas or forks of national parks, the visitor counting system will not only contribute to provide reliable visitor counting, but also to improve the quality of national park visitor service, to manage park facilities and natural resources more efficiently, to achieve an information oriented national park system.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.123-131
• /
• 2009

Process Control Systems (PCSs) or Supervisory Control and Data Acquisition (SCADA) systems have recently been added to the already wide collection of wireless sensor networks applications. The PCS/SCADA environment is somewhat more amenable to the use of heavy cryptographic mechanisms such as public key cryptography than other sensor application environments. The sensor nodes in the environment, however, are still open to devastating attacks such as node capture, which makes designing a secure key management challenging. Recently, Nilsson et al. proposed a key management scheme for PCS/SCADA, which was claimed to provide forward and backward secrecies. In this paper, we define four different types of adversaries or attackers in wireless sensor network environments in order to facilitate the evaluation of protocol strength. We then analyze Nilsson et al. 's protocol and show that it does not provide forward and backward secrecies against any type of adversary model.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.61-68
• /
• 2020

Nuclear power plants have a lower cost of power generation, and they are more eco-friendly than other power generation plants. Also, we need to prepare nuclear plant accidents because of their severe damage. In the event of a safety accident, such as a radiation leak, by applying a wireless sensor network to a nuclear power plant, many sensor nodes can be used to monitor radiation and transmit information to an external base station to appropriately respond to the accident. However, applying a wireless sensor network to nuclear power plants requires routing protocols that consider the sensor network size and bypass obstacles such as plant buildings. In general, the hierarchical-based routing protocols are efficient in energy consumption. In this study, we look into the problems that may occur if hierarchical-based routing protocols are applied to nuclear power plants and propose improved routing protocols to solve these problems. Simulation results show that the proposed routing protocol is more effective in energy consumption than the existing LEACH protocol.