• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.998-1007
• /
• 2018

The advent of Wireless Sensor Networks (WSN) has led to their use in numerous applications. Sensors are autonomous in nature and are constrained by limited resources. Designing an autonomous topology with criteria for economic and energy conservation is considered a major goal in WSN. The proposed honey-hive clustering consumes minimum energy and resources with minimal transmission delay compared to the existing approaches. The honey-hive approach consists of two phases. The first phase is an Intra-Cluster Min-Max Discrepancy (ICMMD) analysis, which is based on the local honey-hive data gathering technique and the second phase is Inter-Cluster Frequency Matching (ICFM), which is based on the global optimal data aggregation. The proposed data aggregation mechanism increases the optimal connectivity range of the sensor node to a considerable degree for inter-cluster and intra-cluster coverage with an improved optimal energy conservation.

• Annual Conference of KIPS
• /
• 2019.10a
• /
• pp.145-148
• /
• 2019

Principal Component Analysis (PCA) is a powerful technique in data analysis and widely used to detect anomalies in Wireless Sensor Networks. However, the performance of conventional PCA is not high on time-series data collected by sensors. In this paper, we propose a Joint Exponential Smoothing and Trend-based Principal Component Analysis (JES-TBPCA) for Anomaly Detection which is based on conventional PCA. Experimental results on a real dataset show a remarkably higher performance of JES-TBPCA comparing to conventional PCA model in detection of stuck-at and offset anomalies.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.607-608
• /
• 2012

Data aggregation is a fundamental problem in wireless sensor networks which attracts great attention in recent years. Delay and energy efficiencies are two crucial issues of designing a data aggregation scheme. In this paper, we propose a distributed, energy efficient algorithm for collecting data from all sensor nodes with the minimum latency called Delay-aware Power-efficient Data Aggregation algorithm (DPDA). The DPDA algorithm minimizes the latency in data collection process by building a time efficient data aggregation network structure. It also saves sensor energy by decreasing node transmission distances. Energy is also well-balanced between sensors to achieve acceptable network lifetime. From intensive experiments, the DPDA scheme could significantly decrease the data collection latency and obtain reasonable network lifetime compared with other approaches.

• Annual Conference of KIPS
• /
• 2020.11a
• /
• pp.144-146
• /
• 2020

Discrete Wavelet Transform (DWT) is an effective technique that is commonly used for detecting noise in collected data of an individual sensor. In addition, the detection accuracy can be significant improved by exploiting the correlation in the data of neighboring sensors of Wireless Sensor Networks (WSNs). Principal component analysis is the powerful technique to analyze the correlation in the multivariate data. In this paper, we propose a DWT-PCA combination scheme for noise detection (DWT-PCA-ND). Experimental results on a real dataset show a remarkably higher performance of DWT-PCA-ND comparing to conventional PCA scheme in detection of noise that is a popular anomaly in collected data of WSN.

• Annual Conference of KIPS
• /
• 2020.05a
• /
• pp.69-71
• /
• 2020

Principal Component Analysis (PCA) is an effective data analysis technique which is commonly used for fault detection on collected data of Wireless Sensor Networks (WSN), However, applying PCA on the whole data make the detection performance low. In this paper, we propose Joint PCA and Adaptive Threshold for Fault Detection (JPATAD). Experimental results on a real dataset show a remarkably higher performance of JPATAD comparing to conventional PCA model in detection of noise which is a popular fault in collected data of sensors.

• Journal of Sensor Science and Technology
• /
• v.33 no.3
• /
• pp.147-151
• /
• 2024

The importance of Wireless Sensor Networks is becoming more evident owing to their practical applications in various areas. However, the energy problem remains a critical barrier to the progress of WSNs. By reducing the energy consumed by the sensor nodes that constitute WSNs, the performance and lifespan of WSNs will be enhanced. In this study, we introduce an energy-efficient ternary modulator that employs multi-threshold CMOS for logic conversion. We optimized the design with a low-power ternary gate structure based on a pass transistor using the MTCMOS process. Our design uses 71.69% fewer transistors compared to the previous design. To demonstrate the improvements in our design, we conducted the HSPICE simulation using a CMOS 180 nm process with a 1.8V supply voltage. The simulation results show that the proposed ternary modulator is more energy-efficient than the previous modulator. Power-delay product, a benchmark for energy efficiency, is reduced by 97.19%. Furthermore, corner simulations demonstrate that our modulator is stable against PVT variations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.8
• /
• pp.15-22
• /
• 2019

Awireless sensor network utilizes small sensors with a low cost and low power being deployed over a wide area. They monitor the surrounding environment and gather the associated information to transmit it to a base station via multi-hop transmission. Most of the research has mainly focused on static sensors that are located in a fixed position. Unlike a wireless sensor network based on static sensors, we can exploit drone-based technologies for more efficient wireless networks in terms of coverage and energy. In this paper, we introduce a transmission power model and a video encoding power model to design the network environment. We also explain a priority mapping scheme, and deploy drones oriented for network coverage and energy consumption. Through our simulations, this research shows coverage and energy improvements in adrone-based wireless sensor network with fewer sensors, compared to astatic sensor-based wireless sensor network. Concretely, coverage increases by 30% for thedrone-based wireless sensor network with the same number of sensors. Moreover, we save an average of 25% with respect to the total energy consumption of the network while maintaining the coverage required.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.131-138
• /
• 2006

To achieve security in wireless sensor networks(WSN), it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, many key agreement schemes used in general networks such as Diffie-Hellman and public-key based schemes are not suitable for wireless sensor networks. The current pre-distribution of secret keys uses q-composite random key and it randomly allocates keys. But there exists high probability not to be public-key among sensor nodes and it is not efficient to find public-key because of the problem for time and energy consumption. To remove problems in pre-distribution of secret keys, we propose a new cryptographic key management protocol, which is based on the clustering scheme but does not depend on probabilistic key. The protocol can increase efficiency to manage keys because, before distributing keys in bootstrap, using public-key shared among nodes can remove processes to send or to receive key among sensors. Also, to find outcompromised nodes safely on network, it selves safety problem by applying a function of lightweight attack-detection mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1496-1521
• /
• 2012

Uncertainty is ubiquitous in target tracking wireless sensor networks due to environmental noise, randomness of target mobility and other factors. Sensing results are always unreliable. This paper considers unreliability as it occurs in wireless sensor networks and its impact on target-tracking accuracy. Firstly, we map intersection pairwise sensors' uncertain boundaries, which divides the monitor area into faces. Each face has a unique signature vector. For each target localization, a sampling vector is built after multiple grouping samplings determine whether the RSS (Received Signal Strength) for a pairwise nodes' is ordinal or flipped. A Fault-Tolerant Target-Tracking (FTTT) strategy is proposed, which transforms the tracking problem into a vector matching process that increases the tracking flexibility and accuracy while reducing the influence of in-the-filed factors. In addition, a heuristic matching algorithm is introduced to reduce the computational complexity. The fault tolerance of FTTT is also discussed. An extension of FTTT is then proposed by quantifying the pairwise uncertainty to further enhance robustness. Results show FTTT is more flexible, more robust and more accurate than parallel approaches.

• Convergence Security Journal
• /
• v.21 no.1
• /
• pp.55-62
• /
• 2021

Recently, the use of sensor devices is gradually increasing. As various sensor device emerge and the related technologies advance, there has been a dramatic increase in the interest in heterogeneous wireless sensor networks (WSNs). While sensor device provide us many valuable benefits, automatically and remotely supported services offered and accessed remotely through WSNs also exposes us to many different types of security threats. Most security threats were just related to information leakage and the loss of authentication among the involved parties: users, sensors and gateways. An user authentication protocol for wireless sensor networks is designed to restrict access to the sensor data only to user. In 2019, Chen et al. proposed an efficient user authentication protocol. However, Ryu et al. show that it's scheme still unstable and inefficient. It cannot resist offline password guessing attack and session key attack. In this paper, we propose an improved protocol to overcome these security weaknesses by storing secret data in device. In addition, security properties like session-key security, perfect forward secrecy, known-key security and resistance against offline password attacks are implied by our protocol.