• Journal of information and communication convergence engineering
• /
• v.20 no.4
• /
• pp.259-264
• /
• 2022

In wireless sensor networks, sensor nodes are often deployed in large numbers in places that are difficult for humans to access. However, the energy of the sensor node is limited. Therefore, one of the most important considerations when designing routing protocols in wireless sensor networks is minimizing the energy consumption of each sensor node. When the energy of a wireless sensor node is exhausted, the node can no longer be used. Various protocols are being designed to minimize energy consumption and maintain long-term network life. Therefore, we proposed KOCED, an optimal cluster K-means algorithm that considers the distances between cluster centers, nodes, and residual energies. I would like to perform a performance evaluation on the KOCED protocol. This is a study for energy efficiency and validation. The purpose of this study is to present performance evaluation factors by comparing the K-means algorithm and the K-medoids algorithm, one of the recently introduced machine learning techniques, with the KOCED protocol.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.41-48
• /
• 2010

Numerous researches are being made on applications based on ubiquitous sensor networks and super light, low power sensors. With the development of society, the aged population is expanding and living alone elders are one of important social issues in today's society. This paper implements the living alone elderly people protection system using ubiquitous sensor networks. By collecting and monitoring information on living alone elders using sensor nodes and sink nodes in web environment, we can perform more integrated management. The implemented living alone elderly people protection system can monitor living alone elders' situation and take actions promptly in emergency.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.279-282
• /
• 2007

Typically a wireless sensor network consists of a number of nodes that sense surrounding environment and collaboratively work to process and route the sensing data to a sink or gateway node. We propose an architecture with support of multiple routers in IPv6-based Low-power Wireless Personal Area Network (6LoWPAN). Our architecture provides traffic load balancing and increases network lifetime as well as self-healing mechanism so that in case of a router failure the network still can remain operational. Each router sends its own Router Advertisement message to nodes and all the nodes receiving the messages can select which router is the best router with the minimum hop-count and link information. We have implemented the architecture and assert our architecture helps in traffic load balancing and reducing data transmission delay for 6LoWPAN.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.104-108
• /
• 2014

The field of body sensor networks has attracted interest of many researchers due to its potential to revolutionize medicine. These sensors are usually implanted inside the human body and communicate among themselves. In the process of receiving, processing, or transmitting data, these devices produce heat. This heat damages the tissues surrounding the devices in the case of prolonged exposure. In this paper, to reduce this damages, we have improved and evaluated two protocols-the least temperature routing protocol and adaptive least temperature routing protocol-by implementing clustering as well as a leadership rotation algorithm. We used Castalia to simulate a basic body area network cluster composed of 6 nodes. A throughput application was used to simulate all the nodes sending data to one sink node. Simulations results shows that improved communication protocol with leadership rotation algorithm significantly reduce the energy consumption as compared to a scheme without leadership rotation algorithm.

• ETRI Journal
• /
• v.41 no.6
• /
• pp.739-749
• /
• 2019

Security and accuracy are two issues in the localization of wireless sensor networks (WSNs) that are difficult to balance in hostile indoor environments. Massive numbers of malicious positioning requests may cause the functional failure of an entire WSN. To eliminate the misjudgments caused by malicious nodes, we propose a compressive-sensing-based multiregional secure localization (CSMR_SL) algorithm to reduce the impact of malicious users on secure positioning by considering the resource-constrained nature of WSNs. In CSMR_SL, a multiregion offline mechanism is introduced to identify malicious nodes and a preprocessing procedure is adopted to weight and balance the contributions of anchor nodes. Simulation results show that CSMR_SL may significantly improve robustness against attacks and reduce the influence of indoor environments while maintaining sufficient accuracy levels.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1113-1116
• /
• 2020

In the EH-WSN(Energy Harvesting Wireless Sensor Network), the routing protocol must consider the power condition of nodes such as residual power and energy harvesting rate. Many EH-WSN studies have emphasized the power aspect and make the urgency of sensed data less important. However, in applications such as environmental monitoring, stability and latency become more important issues than power efficiency for urgent data. In this paper, we designed a routing protocol that can set path according to data urgency. To this end, relay nodes are determined considering the urgency of date. Nodes with poor power do not participate in routing when normal data is generated, so that urgent data can be transmitted reliably with low latency. The performance of the proposed routing protocol is analyzed by computer simulation.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1288-1290
• /
• 2007

Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.199-212
• /
• 2008

Software simulation has been widely used for the design and application development of a large-scale wireless sensor network. The degree of details of the simulation must be high to verify the behavior of the network and to estimate its execution time and power consumption of an application program as accurately as possible. But, as the degree of details becomes higher, the simulation time increases. Moreover, as the number of sensor nodes increases, the time tends to be extremely long. We propose an optimal-synchronous parallel discrete-event simulation method to shorten the time in a large-scale sensor network simulation. In this method, sensor nodes are partitioned into subsets, and each PC that is interconnected with others through a network is in charge of simulating one of the subsets. Results of experiments using the parallel simulator developed in this study show that, in the case of the large number of sensor nodes, the speedup tends to approach the square of the number of PCs participating in the simulation. In such a case, the ratio of the overhead due to parallel simulation to the total simulation time is so small that it can be ignored. Therefore, as long as PCs are available, the number of sensor nodes to be simulated is not limited. In addition, our parallel simulation environment can be constructed easily at the low cost because PCs interconnected through LAN are used without change.

• Spatial Information Research
• /
• v.19 no.5
• /
• pp.63-74
• /
• 2011

Recently, there has been much interest in the spatial query which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. The centralized approach which performs the spatial query at a server after acquiring all sensor readings, though simple, it incurs high wireless transmission cost in accessing all sensor nodes. In order to remove the high wireless transmission cost, various in-network spatial indexing schemes have been proposed. They have focused on reducing the transmission cost by performing distributed spatial filtering on sensor nodes. However, these in-network spatial indexing schemes have a problem which cannot optimize both the spatial filtering and the wireless routing among sensor nodes, because these schemes have been developed by simply applying the existing spatial indexing schemes into the in-network environment. Therefore, we propose a new distributed spatial indexing scheme of the GR-tree. The GR-tree which form s a MBR-based tree structure, can reduce the wireless transmission cost by optimizing both the efficient spatial filtering and the wireless routing. Finally, we compare the existing spatial indexing scheme through extensive experiments and clarify our approach's distinguished features.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.59-68
• /
• 2004

Thanks to the development of microelectromechanical systems(MEMS), wireless communication technology and microsensor technology, it was Possible to manufacture a very small and low costdata acquisition node with sensing function, processing function, wireless communication function and battery. Thus sensor networks begin to be prevailed. The sensor network is a spontaneous system which sets up automatically routing paths and transmits asignificant data to the destination. Sensor nodes requires low-power operation because most of them use a battery as operating power. Sensor nodes transmit a sensing data to the destination. Moreover, they play a router. In fact, because the later consumes more energy than the former, the low-power routing is very important. Sensor networks don't have a routing standard unlike general wireless Ad-hoc networks. So This paper proposes a low-power routing method for anting to sensor networks. It is based on AODV and adapts a method to drop probably RREQ depending on remaining power. We examined it through simulations. From simulation results, we could confirm to reduce power consumption about $10-20\%$ and distribute equally power consumption among nodes.