• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2011

When some sensors under Wireless Sensor Networks fail or become energy-exhausted, redundant mobile sensors might be moved to recover the sensing holes. Within rugged terrain where wheeled sensors are unsuitable, other type of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. Recent study for this work considered the relocation using the shortest path between clusters; however, the shortest path might be used repeatedly and create other sensing holes. In order to overcome the mentioned problem, we propose relocation schemes using the most disjointed paths or multi-paths. Simulation results show that the proposed schemes guarantee more balanced migration distributions of efficient sensors and higher movement success ratios of required sensors than those of the shortest path-based scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.170-172
• /
• 2014

In this paper, one of reliable schemes of In-ship sensor networks using a Grid-based WPAN is proposed. The proposed scheme is based on a novel grid network which allows a multi-path communication, and is robust, energy efficient. The results demonstrate that the proposed Grid-based WPAN outperforms the IEEE 802.15.4 based network in terms of power efficiency.

• The Journal of the Acoustical Society of Korea
• /
• v.42 no.4
• /
• pp.357-363
• /
• 2023

In underwater signal processing, separating individual signals from mixed signals has long been a challenge due to low signal quality. The common method using Short-time Fourier transform for spectrogram analysis has faced criticism for its complex parameter optimization and loss of phase data. We propose a Triple-path Recurrent Neural Network, based on the Dual-path Recurrent Neural Network's success in long time series signal processing, to handle three-dimensional tensors from multi-channel sensor input signals. By dividing input signals into short chunks and creating a 3D tensor, the method accounts for relationships within and between chunks and channels, enabling local and global feature learning. The proposed technique demonstrates improved Root Mean Square Error and Scale Invariant Signal to Noise Ratio compared to the existing method.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.182-196
• /
• 2008

The location estimation using sensor network has been considerably researched. The methods taking the differences of the forms of location estimation between indoors and outdoors into consideration have been studied. While it is possible for outdoor location to be estimated because outdoor location estimation has a consistent distribution during unit period through the value of RSSI(Received Signal Strength Indication) on outdoor location estimation, Indoor location estimation is difficult since multi-path and interference indoors are higher than those outdoors and indoor location estimation can be affected by other factors. In this paper, we revise the information of RSSI changed by multi-path and interference through the Moving Average method and K-means algorithm and propose the method of estimation for the value of RSSI with reliability in the group of signals received during unit period. We also suggest the way to put some weights on fixed nodes in network using a snooping node on location estimation and then evaluate the efficiency of location awareness as compared with the existing method by implementing proposed method on system through the reconfiguration of network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.4
• /
• pp.609-616
• /
• 2023

In a wireless network environment, since sensors are not always connected to power, the life of a battery, which is an energy source supplied to sensors, is limited. Therefore, various studies have been conducted to extend the network life, and a layer-based routing protocol, LEACH(: Low-energy Adaptive Clustering Hierarchy), has emerged for efficient energy use. However, the LEACH protocol, which transmits fused data directly to the sink node, has a limitation in that it consumes as much energy as the square of the transmission distance when transmitting data. To improve these limitations, this paper proposes an algorithm that can minimize the transmission distance with multi-hop transmission where cluster heads are chained between cluster heads through relative distance calculation from sink nodes in every round.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.12
• /
• pp.1113-1119
• /
• 2000

To operate a process plant safely and economically, process monitoring is very important. Process monitoring is the task to identify the state of the system from sensor data. Process monitoring includes data acquisition, regulatory control, data reconciliation, fault detection, etc. This research focuses on the data recon-ciliation using scale-space filtering and fault detection using functional-link associative neural networks. Scale-space filtering is a multi-resolution signal analysis method. Scale-space filtering can extract highest frequency factors(noise) effectively. But scale-space filtering has too large calculation costs and end effect problems. This research reduces the calculation cost of scale-space filtering by applying the minimum limit to the gaussian kernel. And the end-effect that occurs at the end of the signal of the scale-space filtering is overcome by using extrapolation related with the clustering change detection method. Nonlinear principal component analysis methods using neural network have been reviewed and the separately expanded functional-link associative neural network is proposed for chemical process monitoring. The separately expanded functional-link associative neural network has better learning capabilities, generalization abilities and short learning time than the exiting-neural networks. Separately expanded functional-link associative neural network can express a statistical model similar to real process by expanding the input data separately. Combining the proposed methods-modified scale-space filtering and fault detection method using the separately expanded functional-link associative neural network-a process monitoring system is proposed in this research. the usefulness of the proposed method is proven by its application a boiler water supply unit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1661-1670
• /
• 2016

In this paper, we present a risk prediction system and customized evacuation pathfinding algorithm in fire scenarios. For the risk prediction, we apply a multi-level clustering mechanism using collected temperature at sensor nodes throughout the network in order to predict the temperature at the time that users actually evacuate. Based on the predicted temperature and its reliability, we suggest an evacuation pathfinding algorithm that finds a suitable evacuation path from a user's current location to the safest exit. Simulation results based on FDS(Fire Dynamics Simulator) of NIST for a wireless sensor network consisting of 47 stationary nodes for 1436.41 seconds show that our proposed prediction system achieves a higher accuracy by a factor of 1.48. Particularly for nodes in the most reliable group, it improves the accuracy by a factor of up to 4.21. Also, the customized evacuation pathfinding based on our prediction algorithm performs closely with that of the ground-truth temperature in terms of the ratio of safe nodes on the selected path, while outperforming the shortest-path evacuation with a factor of up to 12% in terms of a safety measure.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.