• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.31-40
• /
• 2012

u-GIS DSMSs have been researched to deal with various sensor data from GeoSensors in ubiquitous environment. Also, they has been more important for high availability. The data from GeoSensors have some characteristics that increase explosively. This characteristic could lead memory overflow and data loss. To solve the problem, various load shedding methods have been researched. Traditional methods drop the overloaded tuples according to a particular criteria in a single server. Tuple deletion sensitive queries such as aggregation is hard to satisfy accuracy. In this paper a dual processing load shedding method is suggested to improve the accuracy of aggregation in clustering environment. In this method two nodes use replicated stream data for high availability. They process a stream in two nodes by using a characteristic they share stream data. Stream data are synchronized between them with a window as a unit. Then, processed results are merged. We gain improved query accuracy without data loss.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.39-45
• /
• 2012

In this paper, a distributed 2-hop routing algorithm is proposed. The main purpose of the proposed algorithm is to reduce the overall power consumption of each sensor node so that the lifetime of WSN(wireless sensor network) is prolonged. At the beginning of each round, the base station transmits a synchronization signal that contains information on the priority table that is used to decide whether each sensor node is elected as a cluster head or not. The priority table is constructed so that sensor nodes closer to half energy distance from the base station get the higher priority. 2-hop routing is done as follows. Cluster heads inside half energy distance from the base station communicate with the base station directly. Those outside half energy distance have to decide whether they choose 2-hop routing or 1-hop routing. To do this, each cluster head outside half energy distance calculates the energy consumption needed to communicate with the base station via 1-level cluster head or directly. If less energy is needed when passing through the 1-level cluster head, 2-hop routing is chosen and if not, 1-hop routing is chosen. After routing is done each sensor nodes start sensing data.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.95-106
• /
• 2011

Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks. Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries. However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time. In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation(BPA). BPA divides a query region into several cells according to the distribution of sensor nodes and builds a Quad-tree, and then processes aggregate queries in parallel for each cell region according to routing. And it sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results. Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket. In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data. Finally, in this paper, we prove its superiority through various experiments using sensor data.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.27-35
• /
• 2007

When sensor networks are deployed in open environments, all the sensor nodes are vulnerable to physical threat. An attacker can physically capture a sensor node and obtain the security information including the keys used for data authentication. An attacker can easily inject false reports into the sensor network through the compromised node. False report can lead to not only false alarms but also the depletion of limited energy resource in battery powered sensor networks. To overcome this threat, Fan Ye et al. proposed that statistical on-route filtering scheme(SEF) can do verify the false report during the forwarding process. In this scheme, the choice of a security threshold value is important since it trades off detection power and energy, where security threshold value is the number of message authentication code for verification of false report. In this paper, we propose a fuzzy rule-based system for security threshold determination that can conserve energy, while it provides sufficient detection power in the SEF based sensor networks. The fuzzy logic determines a security threshold by considering the probability of a node having non-compromised keys, the number of compromised partitions, and the remaining energy of nodes. The fuzzy based threshold value can conserve energy, while it provides sufficient detection power.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.252-258
• /
• 2013

As WSN is energy constraint so energy efficiency of nodes is important. Because avoiding long distance communication, clustering operating in rounds is an efficient algorithm for prolonging the lifetime of WSN and its performance depends on duration of a round. A short round time leads to frequent re-clustering while a long round time increases energy consume of cluster heads more. So existing clustering schemes determine proper round time, based on the parameters of initial WSN. But it is not appropriate to apply the round time according to initial value throughout the whole network time because WSN is very dynamic networks nodes can be added or vanished. In this paper we propose a new algorithm which calculates the round time relying on the alive node number to adapt the dynamic WSN. Simulation results validate the proposed algorithm has better performance in terms of energy consumption of nodes and loss rate of data.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.966-975
• /
• 2017

In Internet of Things (IoT), the aim of the nodes (called 'Things') is to exchange information with each other, whereby they gather and share information with each other through self decision-making. Therefore, we cannot apply existing aggregation algorithms of Wireless sensor networks that aim to transmit information to only a sink node or a central server, directly to the IoT environment. In addition, since existing algorithms aggregate information from all sensor nodes, problems can arise including an increasing number of transmissions and increasing transmission delay and energy consumption. In this paper, we propose the clustering and property based data exchange method for energy efficient information sharing. First, the proposed method assigns the properties of each node, including the sensing data and unique resource. The property determines whether the node can respond to the query requested from the other node. Second, a cluster network is constructed considering the location and energy consumption. Finally, the nodes communicate with each other efficiently using the properties. For the performance evaluation, TOSSIM was used to measure the network lifetime and average energy consumption.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.647-658
• /
• 2010

Many localization schemes estimate the locations of radio nodes based on the physical locations of anchors and the connectivity from the anchors. Since they only consider the knowledge of the anchors without else other nodes, they are likely to have enormous error in location estimate unless the range information from the anchors is accurate or there are sufficiently many anchors. In this paper, we propose a novel localization algorithm with the location knowledge of anchors and even one-hop neighbors to localize unknown nodes in the uniform distance from all the one-hop neighbors without the range information. The node in the uniform distance to its all neighbors reduces the location error relative to the neighbors. It further alleviates the location error between its actual and estimated locations. We evaluate our algorithm through extensive simulations under a variety of node densities and anchor placement methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.160-171
• /
• 2011

The one of the core technologies for ubiquitous computing is WSN. WSN detects the information from the environment around them based on the information perceived from the human and all things and manages the information by connecting to the network in realtime. In this environment, the existing research provides the mechanism that most of sensor nodes in the target area can set the transmission path using RGF. However, unrelated to the target area will be responsible for the energy consumption of nodes that are the problem. In this paper, we propose EEDCP protocol. It is designed to collect data from the specific region on sinks in WSN. EEDCP is the protocol that sets the transmission path for collection data inside the target area in WSN. And this paper is shown that the proposed scheme is more efficient in the energy efficiency and the occurrence rate of isolated nodes by comparison with the previous studies through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.144-153
• /
• 2010

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.