Myung-Ho Yeo

Data Correlation-Based Clustering Algorithm in Wireless Sensor Networks

Many types of sensor data exhibit strong correlation in both space and time. Both temporal and spatial suppressions provide opportunities for reducing the energy cost of sensor data collection. Unfortunately, existing clustering algorithms are difficult to utilize the spatial or temporal opportunities, because they just organize clusters based on the distribution of sensor nodes or the network topology but not on the correlation of sensor data. In this paper, we propose a novel clustering algorithm based on the correlation of sensor data. We modify the advertisement sub-phase and TDMA schedule scheme to organize clusters by adjacent sensor nodes which have similar readings. Also, we propose a spatio-temporal suppression scheme for our clustering algorithm. In order to show the superiority of our clustering algorithm, we compare it with the existing suppression algorithms in terms of the lifetime of the sensor network and the size of data which have been collected in the base station. As a result, our experimental results show that the size of data is reduced and the whole network lifetime is prolonged.

Data-aware top-k monitoring in wireless sensor networks

Top-k queries are important to many wireless sensor applications. Conventional Top-k query processing algorithms install a filter at each sensor node and suppress unnecessary sensor updates. However, they have some drawbacks that the sensor nodes consume energy extremely to probe sensor reading or update filters. Especially, it becomes worse, when the variation ratio of top-k result is higher. In this paper, we propose a novel top-k query processing algorithm for energy-efficiency. First, each sensor determines its priority as the order of data gathering. Next, sensor nodes that have higher priority transmit their sensor readings to the base station until gathering k sensor readings. In order to show the superiority of our query processing algorithm, we simulate the performance with the existing query processing algorithms. As a result, our experimental results show that the network lifetime of our method is prolonged largely over the existing method.

Huffman coding algorithm for compression of sensor data in wireless sensor networks

Sensor data exhibit strong correlation in both space and time. Many algorithms have been proposed to utilize these characteristics. However, each sensor just utilizes neighboring information, because its communication range is restrained. Information that includes the distribution and characteristics of whole sensor data provides other opportunities to enhance the compression technique. In this paper, we propose an orthogonal approach for compressing sensor readings based on a novel feedback technique. That is, the base station or a super node generates Huffman code for the compression of sensor data and broadcasts it into sensor networks as feedback information. All sensor nodes that have received the information compress their sensor data and transmit them to the base station. We call this approach as feedback-diffusion and this modified Huffman coding as sHuffman coding. In order to show the superiority of our approach, we compare it with the existing data compression algorithms in terms of the lifetime of the sensor network. As a result, our experimental results show that the whole network lifetime was prolonged by about 30%.

An Energy-Efficient Multiple Path Data Routing Scheme Using Virtual Label in Sensor Network

The multi-path routing schemes that assigns labels to sensor nodes for the reliability of data transmission and the accuracy of an aggregation query over the sensor networks where data transfer is prone to defect have been proposed. However, the existing schemes have high costs for reassigning labels to nodes when the network topology is changed. In this paper, we propose a novel routing method that avoids duplicated data and reduces the update cost of a sensor node. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the various experiments. Our experimental results show that our proposed method reduces about 95% the amount of the transmitted data for restoration to node failure and about 220% the amount of the transmitted data for query processing over the existing method on average.

An Energy-Efficient Sequence-Aware Top-k Monitoring Scheme in Wireless Sensor Networks

We focus on top-k monitoring in wireless sensor networks and propose a novel sequence-aware top-k monitoring algorithm called SAT. Top-k monitoring is important to many applications of sensor networks. Conventional top-k monitoring algorithms install a filter at each sensor node and suppress unnecessary sensor updates. However, they have some drawbacks such as the fact that the sensor nodes consume energy extremely to probe sensor reading or to update filters. Our basic idea is to collect readings sequentially by their values. First, sequence-aware data collection is investigated to make sensor nodes to determine their orders for data gathering phase. Next, sensor nodes transmit their sensor readings sequentially to the base station. When the base station collects k-readings, it broadcasts a simple message to stop data gathering phase. Therefore, SAT may minimize the communication cost for processing top-k queries. Moreover, we expand our approach to a cluster-based top-k monitoring to filter out false positives in hierarchical levels. In order to show the superiority of our top-k monitoring approach, we simulate its performance with the conventional filter-based top-k monitoring algorithm. In the results, our approach reduces communication overhead and prolongs the network lifetime largely.

Efficient Data Management Method for Massive RFID Data

In this paper, we propose an efficient data management scheme for path queries and containment queries which are occurred frequently. The proposed data management scheme considers a change of the containment of products during a transport and supports a path of changed products by representing a path of various containments. Also, the compression utilizing the structure of supply chain reduces the stored data volumes. As a result, our method outperforms the existing methods in terms of storage efficiency and query processing time.

An Efficient Evolutionary Algorithm for Optimal Arrangement of RFID Reader Antenna

Incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. Reader-to-reader interference occurs when a reader transmits a signal that interferes with the operation of another reader, thus preventing the second reader from communicating with tags in its interrogation zone. Interference detected by one reader and caused by another reader is referred to as a reader collision. In RFID systems, the reader collision problem is considered to be the bottleneck for the system throughput and reading efficiency. In this paper, we propose a novel RFID reader anti-collision algorithm based on evolutionary algorithm(EA). First, we analyze characteristics of RFID antennas and build database. Also, we propose EA encoding algorithm, fitness algorithm and genetic operators to deploy antennas efficiently. To show superiority of our proposed algorithm, we simulated our proposed algorithm. In the result, our proposed algorithm obtains 95.45% coverage rate and 10.29% interference rate after about 100 generations.

An Energy-Efficient In-Network Join Query Processing using Synopsis and Encoding in Sensor Network

Recently, many researchers are interested in using join queries to correlate sensor readings stored in different regions. In the conventional algorithm, the preliminary join coordinator collects the synopsis from sensor nodes and determines a set of sensor readings that are required for processing the join query. Then, the base station collects only a part of sensor readings instead of whole readings and performs the final join process. However, it has a problem that incurs communication overhead for processing the preliminary join. In this paper, we propose a novel energy-efficient in-network join scheme that solves such a problem. The proposed scheme determines a preliminary join coordinator located to minimize the communication cost for the preliminary join. The coordinator prunes data that do not contribute to the join result and performs the compression of sensor readings in the early stage of the join processing. Therefore, the base station just collects a part of compressed sensor readings with the decompression table and determines the join result from them. In the result, the proposed scheme reduces communication costs for the preliminary join processing and prolongs the network lifetime.

An Energy Efficient Data-Centric Probing Priority Determination Method for Mobile Sinks in Wireless Sensor Networks

Many methods have been researched to prolong sensor network lifetime using mobile technologies. In the mobile sink research, there are the track based methods and the anchor points based methods as representative operation methods for mobile sinks. However, the existing methods decrease Quality of Service (QoS) and lead the routing hotspot in the vicinity of the mobile sink. The reason is that they use static mobile paths that are not concerned about the network environments such as the query position and the data priority. In this paper, we propose the novel mobile sink operation method that solves the problems of the existing methods. In our method, the probing priority of the mobile sink is determined with the data priorities for increasing the QoS and the mobile features are used for reducing the routing hotspot. The experimental results show that the proposed method reduces query response time and improves network lifetime over the existing methods.

Design and Implementation of a Multiple Client Remote Management System using WMI

Recently, multi client PC technologies that several users can use one set of computer at the same time are being designed to use the surplus computer resource. In general, as the existing PC management system considers only a single client PC that only one user uses a computer, various kinds of complicated problems may be arisen. This paper designs and realizes a remote management system that can monitor and control the information used in the windows based OS multi-client using WMI technology. The proposed system herein uses WMI technology and newly defined client management protocol and provides the monitoring and control functions on individual resource use information of multi-client. As well, it provides a communication function between the server and the client, and locking setting and access control functions.