• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.27-36
• /
• 2010

The paper proposes RFB(Record Filtering using Bit-vector) join algorithm, an in-network strategy that uses bit-vector to drastically reduce the size of data and hence the communication cost. In addition, by eliminating data not involved in join result prior to actual join, communication cost can be minimized since not all data need to be moved to the join nodes. The simulation result shows that the proposed RFB algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join(SNJ) algorithm.

• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.69-76
• /
• 2013

A lot of researches have been done to improve the energy efficiency of Wireless Sensor Networks. But all the current researches are based on the idea of direct communication between cluster head and sink node. Previous results assume that node can intelligently regulate signal energy according to the distance between nodes. It is difficult to implement algorithms based on this assumption. We present a multi-level routing algorithm from the sink node to all other nodes which have fixed radio wave radius. We also show the energy saving efficiency and the implementation in real WSN using the simulation result.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.738-743
• /
• 2012

This paper describes analysis of long-term experiments on a monitoring system to assess the daily activities of the elderly who live alone. The developed system is composed of an in-house sensing system and a server system. The in-house sensing system installed in their own houses is a typical wireless sensor network system including three kinds of wireless sensors. The server system has a database server and an assessment server. We have installed the system into an elderly house, collected data during over two years continuously, then analyze the data. From the analysis, we could measure the energy consumption profile of three kinds of sensor nodes. The experiment shows all kinds of nodes can operate over one year with two AA-size alkaline batteries. Using a measure of reliability of the monitoring system called 'deadzone', the system has showed the failure operation for 842 hours (4.66 %) during over 18,000 hours total operation period.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.953-959
• /
• 2012

There are a number of idle nodes in sensor networks, these can act as detector nodes for anomaly detection in the network. For detecting node selection problem modeled as optimization equation, the conventional method using centralized genetic algorithm was evaluated. In this paper, a method to improve the convergence of the optimal value, while improving energy efficiency as a method of considering the characteristics of the network topology using parallel genetic algorithm is proposed. Through simulation, the proposed method compared with the conventional approaches to the convergence of the optimal value was improved and was found to be energy efficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2243-2250
• /
• 2014

In wireless sensor networks(WSNs), geographical routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Especially, indoor environments contain various obstacles such as concrete wall, furniture which cause non-line-of-sight(NLOS) conditions. To solve the problem, we propose location error compensation algorithm by using two difference topology constructions. First topology is based on mobile node's location which is obtained from anchor nodes. Second topology is based on mutual distance from neighbor nodes. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.330-338
• /
• 2009

Various applications based on the location information of things are developed as entering by the ubiquitous computing age. Wireless sensor networks are suitable to indoor location-based service because of the important features such as low-power consumption, low-cost, easy deployment, etc. To recognize the distance between nodes, the indoor location-based system transmits both ultrasound signal and radio signal periodically. However, increment of the number of deployed sensor nodes make lots of collision and interference among the signals and it can degrade the accuracy of location-based system. In this paper, we propose a beacon management mechanism to increase the probability of transmission chance to the nearest beacon from the listener. It can minimize collision and interference and reduce the error probability due to the characteristics of ultrasound.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3880-3899
• /
• 2019

Distributive desynchronization algorithms based on pulse-coupled oscillator (PCO) models have been proposed for achieving collision-free wireless transmissions. These algorithms do not depend on a global clock or infrastructure overheads. Moreover, they gradually converge to fair time-division multiple access (TDMA) scheduling by broadcasting a periodic pulse signal (called a 'firing') and adjusting the next firing time based on firings from other nodes. The time required to achieve constant spacing between phase neighbors is estimated in a closed form or via stochastic modeling. However, because these algorithms cannot guarantee the completion of desynchronization in a short and bounded timeframe, they are not practical. Motivated by the limitations of these methods, we propose a practical solution called PD-DESYNC that provides a short and deterministic convergence time using a flag firing to indicate the beginning of a cycle. We demonstrate that the proposed method guarantees the completion of desynchronization within three cycles, regardless of the number of nodes. Through extensive simulations and experiments, we confirm that PD-DESYNC not only outperforms other algorithms in terms of convergence time but also is a practical solution.

• ETRI Journal
• /
• v.43 no.2
• /
• pp.221-231
• /
• 2021

To resolve energy depletion issues in massive Internet of Things sensor networks, we developed a set of distributed energy beamforming methods with one-bit feedback and clustering for multi-node wireless energy transfer, where multiple singleantenna distributed energy transmitters (Txs) transfer their energy to multiple nodes wirelessly. Unlike previous works focusing on distributed information beamforming using a single energy receiver (Rx) node, we developed a distributed energy beamforming method for multiple Rx nodes. Additionally, we propose two clustering methods in which each Tx node chooses a suitable Rx node. Furthermore, we propose a fast distributed beamforming method based on Tx sub-clustering. Through computer simulations, we demonstrate that the proposed distributed beamforming method makes it possible to transfer wireless energy to massive numbers of sensors effectively and rapidly with small implementation complexity. We also analyze the energy harvesting outage probability of the proposed beamforming method, which provides insights into the design of wireless energy transfer networks with distributed beamforming.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.156-165
• /
• 2023

IEEE 802.15.4e-TSCH is recognized as a wireless industrial sensor network standard used in IoT systems. To ensure both power savings and reliable communications, the TSCH standard uses techniques including channel hopping and bandwidth reserve. In TSCH mode, scheduling is crucial because it allows sensor nodes to select when data should be delivered or received. Because a wide range of applications may necessitate energy economy and transmission dependability, we present a distributed approach that uses a cluster tree topology to forecast scheduling requirements for the following slotframe, concentrating on the Poisson model. The proposed Optimized Minimal Scheduling Function (OMSF) is interested in the details of the scheduling time intervals, something that was not supported by the Minimal Scheduling Function (MSF) proposed by the 6TSCH group. Our contribution helps to deduce the number of cells needed in the following slotframe by reducing the number of negotiation operations between the pairs of nodes in each cluster to settle on a schedule. As a result, the cluster tree network's error rate, traffic load, latency, and queue size have all decreased.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.447-449
• /
• 2021

Various wireless sensor network protocols have been proposed to maintain the network for a long time by minimizing energy consumption. Using the K-means clustering algorithm takes longer to cluster than traditional hierarchical algorithms because the center point must be moved repeatedly until the final cluster is established. For K-means clustering-based protocols, only the residual energy of nodes or nodes near the center point of the cluster is considered when the cluster head is elected. In this paper, we propose a new wireless sensor network protocol based on K-means clustering to improve the energy efficiency while improving the aforementioned problems.