• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.870-872
• /
• 2007

Sensor networks have been widely applied for data collection. Due to the energy limitation of the sensor nodes and the most energy consuming data transmission, we should allocate as much work as possible to the sensors, such as data compression and aggregation, to reduce data transmission and save energy. Querying extreme values is a general query type in wireless sensor networks. In this paper, we propose a novel querying method called Two-Level Filter (TLF) for querying extreme values in wireless sensor networks. We first divide the whole sensor network into domains using the Distributed Data Aggregation Model (DDAM). The sensor nodes report their data to the cluster heads using push method. The advantages of two-level filter lie in two aspects. When querying extreme values, the number of pull operations has the lower boundary. And the query results are less affected by the topology changes of the wireless sensor network. Through this method, the sensors preprocess the data to share the burden of the base station and it combines push and pull to be more energy efficient.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.820-829
• /
• 2006

Wireless sensor networks consisting of hundreds to thousands of nodes are expected to be increasingly deployed in coming years, as they enable reliable monitoring and analysis of physical worlds. These networks have unique features that are very different from traditional networks, e.g., the numerous numbers of nodes, limitation in power, processing, and memory. Due to these unique features of wireless sensor networks, sensor data management including querying becomes a challenging problem. Furthermore, due to wide popularization of the Internet and its facility in use, it is generally accepted that an unattended network can be efficiently managed and monitored over the Internet. In particular, in order to more efficiently query and manage data in a sensor network. in this paper, the architecture of a sensor gateway including web-based query server is presented and its implementation detail is illustrated. The presented web-based gateway is largely divided into two important parts: Internet part and sensor network part. The sensor network part plays an important role of handling a variety of sensor networks, including flat or hierarchical network architecture, by using internally layered architecture for efficiently querying and managing data in a sensor network. In addition, the Internet part provides a modular gateway function for favorable exchange between the sensor network and Internet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.271-280
• /
• 2014

In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.909-937
• /
• 2011

Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.24-33
• /
• 2009

Stream data, gathered from ubiquitous sensor networks, change continuously over time. Because they have quite different characteristics from traditional databases, we need new techniques for storing and querying/analyzing these stream data, which are research issues recently emerging. In this research, we implemented a storage manager gathering stream data and storing them into databases, which are sampled continuously from sensor networks. The storage manager cleans faulty data occurred in mobile sensors and it also reduces the size of stream data by merging repeatedly-sampled values into one and by employing the tilted time frame which stores stream data with several different sampling rates. In this research furthermore, we measured the performance of the storage manager in the context of a sensor network monitoring fires of a building. The experimental results reveal that the storage manager reduces significantly the size of storage spaces and it is effective to manage the data stream for real applications monitoring buildings and their fires.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.2
• /
• pp.45-52
• /
• 2014

This paper proposes an efficient photo retrieval system that automatically indexes for searching of relevant images, using a combination of geo-coded information, direction/location of image capture device and content-based visual features. A photo image is labeled with its GPS (Global Positioning System) coordinates and direction of the camera view at the moment of capture, and the label leads to generate a geo-spatial index with three core elements of latitude, longitude and viewing direction. Then, content-based visual features are extracted and combined with the geo-spatial information, for indexing and retrieving the photo images. For user's querying process, the proposed method adopts two steps as a progressive approach, filtering the relevant subset prior to use a content-based ranking function. To evaluate the performance of the proposed scheme, we assess the simulation performance in terms of average precision and F-score, using a natural photo collection. Comparing the proposed approach to retrieve using only visual features, an improvement of 20.8% was observed. The experimental results show that the proposed method exhibited a significant enhancement of around 7.2% in retrieval effectiveness, compared to previous work. These results reveal that a combination of context and content analysis is markedly more efficient and meaningful that using only visual feature for image search.

• KIISE Transactions on Computing Practices
• /
• v.20 no.11
• /
• pp.598-603
• /
• 2014

In wireless sensor networks, two methods have been generally used to track continuously moving object: a user query-based method and a periodic report-based method. Although the former method generates more overhead as a result of the user queries, the former one is also an energy-efficient method that does not transfer unnecessary information. For the user query-based method, a virtual tree that consist of sensor nodes is used to perform the user query and the sensor reporting. The tree stores the information of the mobile objects, and the stored information triggers a report b the user query. However, in case of a fast-moving object, the tracking accuracy decreases as a result of the time delay of the end-to-end repeated query. In order to solve this problem, we propose a query-relay method that reduces the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to adjacent nodes according to the movement of mobile object that is tracked. When the query messages are relayed. The end-to-end querying time delay is reduced. and a simulation shows that our method is superior to existing ones in terms of tracking accuracy.