• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4781-4803
• /
• 2017

Environmental monitoring systems using Wireless Sensor Networks (WSNs) face the challenge of high power consumption, due to the high levels of multi-hop data communication involved. In order to overcome the issue of fast energy depletion, a proof-of-concept implementation proves that adopting a clustering algorithm in environmental monitoring applications will significantly reduce the total power consumption for environment sensor nodes. In this paper, an energy-efficient WSN-based environmental monitoring system is proposed and implemented, using eight sensor nodes deployed over an area of $1km^2$, which took place in the city of Tabuk in Saudi Arabia. The effectiveness of the proposed environmental monitoring system has been demonstrated through adopting a number of real experimental studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.528-534
• /
• 2013

The energy consumption problem should be taken into consideration in wireless sensor network. Many studies have been proposed to address the energy consumption and delay problem. In this paper, we propose BISA(Bio-inspired Scheduling Algorithm) to reduce the energy consumption and delay in wireless sensor networks based on biological system. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission by multiplexing data transmission path. Through simulation, we confirm that the proposed scheme guarantees the efficient energy consumption and delay requirement.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.97-103
• /
• 2009

This paper proposes efficient routing scheme named MP-DD(MultiPath-Direct Diffusion) which is simple enough to be applicable to the wireless sensor networks. Conventional DD uses only one optimal path, therefore it consumes more energy of specific nodes. MP-DD uses multiple path and has a information of hop upstream node in the direction of the base-station is determined which are obtainable via the process of self-organization of the network. Simulation results show the feasibility of the simple routing schemes for the sensor networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.472-474
• /
• 2019

We propose an antenna for subminiature sensor node in the marine IoT service based on low power wide area (LPWA) network. The proposed antenna is designed for multi-band in ISM band. The specification of the proposed antenna expressed here is also for multi-band service.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.163-167
• /
• 2006

Multi-level ${\mu}TESLA$ is an efficient extension to ${\mu}TESLA$ to provide an extended lifetime for long-lived sensor networks. This paper presents new constructions of multi-level ${\mu}TESLA$ with immediate authentication of key chain commitments. The proposed constructions are shown to be more efficient and robust than the previous multi-level ${\mu}TESLA$ extension.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.47-56
• /
• 2012

In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.706-714
• /
• 2010

In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.95-105
• /
• 2008

In this paper, we propose the DAMMC(Distributed Authentication Model using Multi-level Cluster) for wireless sensor networks. The proposed model is that one cluster header in m-layer has a role of CA(Certificate Authority) but it just authenticates sensor nodes in lower layer for providing an efficient authentication without authenticating overhead among clusters. In here, the m-layer for authentication can be properly predefined by user in consideration of various network environments. And also, the DAMMC uses certificates based on the threshold cryptography scheme for more reliable configuration of WSN. Experimental results show that the cost of generation and reconfiguration certification are decreased but the security performance are increased compared to the existing method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.2
• /
• pp.161-166
• /
• 2006

Localization of mobile agent within a sensing network is a fundamental requirement for many applications, using networked navigating systems such as the sonar-sensing system or the visual-sensing system. To fully utilize the strengths of both the sonar and visual sensing systems, This paper describes a networked sensor-based navigation method in an indoor environment for an autonomous mobile robot which can navigate and avoid obstacle. In this method, the self-localization of the robot is done with a model-based vision system using networked sensors, and nonstop navigation is realized by a Kalman filter-based STSF(Space and Time Sensor Fusion) method. Stationary obstacles and moving obstacles are avoided with networked sensor data such as CCD camera and sonar ring. We will report on experiments in a hallway using the Pioneer-DX robot. In addition to that, the localization has inevitable uncertainties in the features and in the robot position estimation. Kalman filter scheme is used for the estimation of the mobile robot localization. And Extensive experiments with a robot and a sensor network confirm the validity of the approach.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.289-291
• /
• 2005

Even though a lot of routing algorithms have been proposed, an omnipotent algorithm of routing technique, which has optimal efficiency, does not exist. Therefore, A routing algorithm in a sensor network is an application oriented; the best effective routing algorithm depends on which application it is used to. In this paper, the routing algorithm is proposed for the purpose of monitoring a movement of Assets in office. This Paper proposes a new multi-hop routing algorithm, that is, RSS(Received Signal Strength) value which was used in a localization of sensor network is applied to routing algorithm.