• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.1-7
• /
• 2014

WireWireless sensor networks(WSNs) are generally comprised of densely deployed sensor nodes, which causes highly redundant sensor data transmission and energy waste. Many studies have focused on energy saving in WSNs. However, delay problem also should be taken into consideration for mission-critical applications. In this paper, we propose a BISA (Bio-Inspired Scheduling Algorithm) to reduce the energy consumption and delay for WSNs inspired by biological systems. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission. Through simulations, we observe that the BISA archives energy efficiency and delay guarantees.

• Journal of the Korea Convergence Society
• /
• v.11 no.5
• /
• pp.9-17
• /
• 2020

Human activity recognition(HAR) using smartphones is a hot research topic in computational intelligence. Smartphones are equipped with a variety of sensors. Fusing the data of these sensors could enable applications to recognize a large number of activities. However, these devices have fewer resources because of the limited number of sensors available, and feature selection and classification methods are required to achieve optimal performance and efficient feature extraction. This paper proposes a smartphone-based HAR scheme according to these requirements. The proposed method in this paper extracts time-domain features from acceleration sensors, gyro sensors, and barometer sensors, and recognizes activities with high accuracy by applying KDA and SVM. This approach selects the most relevant feature of each sensor for each activity. Our comparison results shows that the proposed system outperforms previous smartphone-based HAR systems.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.1-5
• /
• 2015

Recently, RF energy harvesting technology is a promising technology for small-size IoT(Internet of Things) devices such as sensor to resolve battery scarcity problem. When applied to existing cognitive radio networks, this technology can be expected to increase network throughput through the increase of cognitive user's operating time. This paper proposes a optimal channel-selection policy for RF energy harvesting CR networks model where cognitive users in harvesting zone harvest ambient RF energy from transmission by nearby active primary users and the others in non-harvesting zone choose the channel and communicate with their receiver. We consider that primary users and secondary users are distributed as Poisson point processes and contact with their intended receivers at fixed distances. Finally we can derive the optimal frame duration, transmission power and density of secondary user from the proposed model that can maximize the secondary users's throughput under the given several conditions and suggest future directions of research.

• Korean Journal of Remote Sensing
• /
• v.22 no.4
• /
• pp.275-284
• /
• 2006

The noise sources of a Hyperion image are mainly due to the atmospheric effects, the sensor's instrumental errors, and A/D conversion. Though uncalibrated, overlapping, and all deep water absorption bands generally are removed, there still exist noisy bands. The visual inspection for selecting clean and stable processing bands is a simple practice, but is a manual, inefficient, and subjective process. In this paper, we propose that the extrema ratio be used for noise estimation and unsupervised band selection. The extrema ratio was compared with existing SNR and entropy measures. First, Gaussian, salt and pepper, and Speckle noises were added to ALI (Advanced Land Imager) images with relatively low noises, and the relation of noise level and those measures was explored. Second, the unsupervised band selection was performed through the EM (Expectation-Maximization) algorithm of the measures which were extracted from a Hyperion images. The Hyperion data were classified into 5 categories according to the image quality by visual inspection, and used as the reference data. The experimental result showed that the extrema ratio could be used effectively for band selection of Hyperion images.

• Journal of Internet Computing and Services
• /
• v.24 no.6
• /
• pp.155-160
• /
• 2023

In principle, data from all databases and systems managed by the Ministry of Defense or public institutions must be guaranteed to have a certain level of quality or higher, but since most information systems are built and operated, data quality management for all systems is realistically limited. Most defense data is not disclosed due to the nature of the work, and many systems are strategically developed or integrated and managed by the military depending on the need and importance of the work. In addition, many types of data that require data quality management are being accumulated and generated, such as sensor data generated from weapon systems, unstructured data, and artificial intelligence learning data. However, there is no data quality management guide for defense data and a guide for selecting quality control targets, and the selection criteria are ambiguous to select databases and systems for quality control of defense data according to the standards of the public data quality management manual. Depends on the person in charge. Therefore, this paper proposes criteria for selecting a target system for quality control of defense data, and describes the relationship between the proposed selection criteria and the selection criteria in the existing manual.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.3
• /
• pp.367-376
• /
• 2012

This paper describes a Adaptive Impedance Tuning Circuit which can be adaptively tuned between circuit's characteristic impedance and the arbitrary load impedance. The Adaptive Impedance Tuning Circuit is consisted of such parts as mismatch sensor, impedance tuner and tuning algorithm. Each parts's design methods proposed in other papers are compared with their advantages and disadvantages. And we propose simple design method for Adaptive Impedance Tuning Circuit using a ${\lambda}/4$ transmission line and ${\pi}$-network. Calculation formulas and selection algorithm from calculated values of a complex load impedance are proposed and simulation using induced calculation formulas and selection algorithm is performed. Simulation results show good agreement with theoretical predictions.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.905-915
• /
• 2012

This paper suggests the online method to identify normal and abnormal state of water quality on the ocean USN. To define normal of the ocean water quality, we utilize the negative selection algorithm of artificial immunity system which has self and nonself identification characteristics. To distinguish abnormal status, normal state set of the ocean water quality needs to be defined. For this purpose, we generate normal state set base on mutations of each data and mutation of the data as logical product. This mutated normal (or self) sets used to identify abnormal status of the water quality. We represent the experimental result about mutated self set with the Gaussian function. Through setting the method on the ocean sensor logger, we can monitor whether the ocean water quality is normal or abnormal state by online.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1224-1228
• /
• 2010

The existing cluster-based routing protocols have some problems. Firstly, because of selecting cluster head at random, they occur a node concentration problem. Secondly, they have a low reliability for data communication due to the less consideration of node communication range. Finally, data communication overhead is greatly increased because of sending all sensor node information to sink node for constructing clusters. To solve these problems, we in this paper, propose a cluster-based routing protocol using message reception success rate. Firstly, to solve the node concentration problem, we design a cluster head selection algorithm based on node connectivity and devise cluster spliting/merging algorithms. Secondly, to guarantee data communication reliability, we use message reception success rate. Finally, to reduce data communication overhead, we use only neighbor nodes information at both cluster construction and cluster head selection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2143-2149
• /
• 2010

An agent based geographic routing protocol is proposed to improve the well-known geographic routing protocol-GPSR routing protocol. In the proposed scheme, the agent is selected by sink node which concern about the source node's position as well as agent candidate's state. So packets will first be forwarded to agent and next step is to be forwarded to their final goal- sink node from agent. During the next hop selection process, nodes select their neighbors by considering not only position but also their average available buffer size. This results in efficient selection of next hop node in congestion area, and then increases the successful packet delivery ratio. The simulation is conducted for two scenarios: general number of connections and large number of connections in our map. Results show that new method with agent achieves improved performance in successful packet delivery ratio when compares to GPSR without our scheme.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.658-663
• /
• 2018

In this paper, we consider node deployment algorithms for the sequence-based localization (SBL) which is recently employed for in-door positioning systems, Whereas previous node selection or deployment algorithms seek to place nodes at centrold of the region where more targets are likely to be found, we observe that the boundaries dividing such regions can be good locations for the nodes in SBL systems. Motivated by this observation, we propose an efficient node deployment algorithm that determines the boundaries by using the well-known K-means algorithm and find the potential node locations based on the bi-section method for low-complexity design. We demonstrate through experiments that the proposed algorithm achieves significant localization performance over random node allocation with a substantially reduced complexity as compared with a full search.