• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.306-313
• /
• 2009

Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.84-95
• /
• 2008

Wireless sensor networks have recently emerged as a platform for several applications. By deploying wireless sensor nodes and constructing a sensor network, we can remotely obtain information about the behavior, conditions, and positions of objects in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering algorithm that distributes the energy consumption of a cluster head. First, we analyze the energy consumption if cluster heads and divide each cluster into a collection layer and a transmission layer according to their roles. Then, we elect a cluster head for each layer to distribute the energy consumption of single cluster head. In order to show the superiority of our clustering algorithm, we compare it with the existing clustering algorithm in terms of the lifetime of the sensor network. As a result, our experimental results show that the proposed clustering algorithm achieves about $10%{\sim}40%$ performance improvements over the existing clustering algorithms.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.324-332
• /
• 2010

The majority of event detection in real-time embedded sensor network systems is based on data fusion that uses noisy sensor data collected from complicated real-world environments. Current research has produced several excellent low-level mechanisms to collect sensor data and perform aggregation. However, solutions that enable these systems to provide real-time data processing using readings from heterogeneous sensors and subsequently detect complex events of interest in real-time fashion need further research. We are developing real-time event detection approaches which allow light-weight data fusion and do not require significant computing resources. Underlying the event detection framework is a collection of real-time monitoring and fusion mechanisms that are invoked upon the arrival of sensor data. The combination of these mechanisms and the framework has the potential to significantly improve the timeliness and reduce the resource requirements of embedded sensor networks. In addition to that, we discuss about a privacy that is foundation technique for trusted embedded sensor network system and explain anonymization technique to ensure privacy.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.372-382
• /
• 2005

Aggregation such as computing an average value of data measured in each sensor commonly occurs in many applications of sensor networks. Since sensor networks consist of low-cost nodes with limited battery power, reducing energy consumption must be considered in order to achieve a long network lifetime. Reducing the amount of messages exchanged is the most important for saving energy. Earlier work has demonstrated the effectiveness of in-network data aggregation and data filtering for minimizing the amount of messages in sensor networks. In this paper, we propose an adaptive error adjustment scheme that is simpler, more effective and efficient than previous work. The proposed scheme is based on self-adjustment in each sensor node. We show through various experiments that our scheme reduces the network traffic significantly, and performs better than existing methods.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.292-305
• /
• 2009

Wireless sensor networks have a lot of application areas such as industrial process control, machine and resource management, environment and habitat monitoring. One of the main objects of using wireless sensor networks in these areas is the event detection. To detect events at a user's request, we need a join processing between sensor data and the predicates of the events. If there are too many predicates of events compared with a node's capacity, it is impossible to store them in a node and to do an in-network join with the generated sensor data This paper proposes a predicate-merge based in-network join approach to efficiently detect multiple events, considering the limited capacity of a sensor node and many predicates of events. It reduces the number of the original predicates of events by substituting some pairs of original predicates with some merged predicates. We create an estimation model of a message transmission cost and apply it to the selection algorithm of targets for merged predicates. The experiments validate the cost estimation model and show the superior performance of the proposed approach compared with the existing approaches.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.118-129
• /
• 2023

The expansion of smart cities drives the growth of data generated from sensor devices, benefitting citizens with enhanced governance, intelligent decision-making, optimized and sustainable management of available resources. The exposure of user data during its collection from sensors, storage in databases, and processing by artificial intelligence-based solutions presents significant security and privacy challenges. In this paper, we investigate the various threats and attacks affecting the growth of future smart cities and discuss the available countermeasures using artificial intelligence and blockchain-based solutions. Open challenges in existing literature due to the lack of countermeasures against quantum-inspired attacks are discussed, focusing on postquantum security solutions for resource-constrained sensor devices. Additionally, we discuss future research and challenges for the growing smart city environment and suggest possible solutions.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.48-52
• /
• 2023

Many studies have been conducted to ensure that Visual Place Recognition is reliable in various environments, including edge cases. However, existing approaches use visible imaging sensors, RGB cameras, which are greatly influenced by illumination changes, as is widely known. Thus, in this paper, we use an invisible imaging sensor, a long wave length infrared camera (LWIR) instead of RGB, that is shown to be more reliable in low-light and highly noisy conditions. In addition, although the camera sensor used to solve this problem is an LWIR camera, but since the thermal image is converted into RGB image the proposed method is highly compatible with existing algorithms and databases. We demonstrate that the proposed method outperforms the baseline method by about 0.19 for recall performance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.103-112
• /
• 2008

In this paper we present two databases for two different systems each having novel implementation ideas: a u-Healthcare system with a mobile gateway and MAGI network monitoring system. u-Healthcare system is capturing and monitoring vital sign data without restrictions of location and time using body sensor network and a mobile gateway. MAGI is a system which has a dynamic firewall function and solves problems of existing traffic monitoring tools. In addition to presenting the design principles behind these two systems, we describe the respective database schemas together with detailed information of the data stored within the databases. We will also show and discuss performance measurements and calculations for both systems. Based on the performance data we will discuss the systems' suitability for their intended uses.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.32-41
• /
• 2006

In data-centric networks, various data items, such as temperature, humidity, etc. are sensed and stored in sensor nodes. As these attributes are mostly scalar values and inter-related, multi-dimensional range queries are useful. To process multi-dimensional range queries efficiently in data-centric storage, data addressing is essential. The Previous work focused on efficient query processing without considering overall network lifetime. To prolong network lifetime and support multi-dimensional range queries, we propose a dynamic data distribution method for multi-dimensional data, where data space is divided into equal-sized regions and linearized by using Hilbert space filling curve.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1325-1331
• /
• 2007

To effectively manage lamp facilities on a remote place, it is required to identify a status of the places where the lamp facilities are placed. however, since there is no methods to notify the status of sensors to the central management system based on the non-networked sensor environments, it is difficult to manage the lamp facilities remotely. In this paper, we propose the lamp facility management system to acquire the various status informations of lamp facilities using more than two sensors. To get the status remotely, the system exploits a wireless network based on the ZigBee. The benefit of this system is to help the efficient dicision makings of administrators.