• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.318-330
• /
• 2015

In wearable sensor systems (WSSs), sensor nodes are deployed around human body parts such as the arms, the legs, the stomach, and the back. These sensors have limited lifetimes because they are battery-operated. Thus, transmission power control (TPC) is needed to save the energy of sensor nodes. The TPC should control the transmission power level (TPL) of sensor nodes based on current channel conditions. However, previous TPC algorithms did not precisely estimate the channel conditions. Therefore, we propose a new TPC algorithm that uses an accelerometer to directly measure the current channel condition. Based on the directly measured channel condition, the proposed algorithm adaptively adjusts the transmission interval of control packets for updating TPL. The proposed algorithm is efficient because the power consumption of the accelerometer is much lower than that of control packet transmissions. To evaluate the effectiveness of our approach, we implemented the proposed algorithm in real sensor devices and compared its performance against diverse TPC algorithms. Through the experimental results, we proved that the proposed TPC algorithm outperformed other TPC algorithms in all channel environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.534-539
• /
• 2005

The key in wireless sensor networks, which consist of a number of sensor nodes, is an energy efficiency. Many routing protocols have been proposed for prolonging network lifetime and reducing traffic in wireless sensor networks. Wireless sensor networks usually use wireless ad-hoc network protocols for routing, but these protocols are not well-suited for wireless sensor networks due to many reasons. In this paper, RM-flooding protocol is proposed for reducing routing overhead occurred when packet flooding. The nodes using this routing protocol can consume the limited energy effectively, and exchange information with remote nodes usulg information receiving from multipath. So, RM-flooding prolongs the network's lifetime.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.373-376
• /
• 2008

Wireless sensor networks consist of thousands of sensor nodes that have low power, low footprint and low computational capacities. So the burning issues in the design and deployment of these sensor nodes in the practical application areas include the energy conservation and network lifetime. Efficient routing schemes can help reduce the energy consumption and thus increase the network lifetime. This paper deals with the comparative analysis of popular routing protocols such as LEACH, LEACH-C, MTE, and PEGASIS. The protocols are compared by using performance me tries such as system lifetime, the time for first node death, and total system energy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.917-920
• /
• 2007

In this paper, we designed the authentication system for home network service and applied it to actual sensor nodes. SNEP protocol of SPINS provides confidentiality of data and authentication. We achieved authentication key, encryption and decryption applied RCS encryption algorithm of SNEP. In addition, we used pair-wise key pre-distribution for prevention of authentication sniffing in wireless sensor network. The experiment environment consists of a base station receiving data and sensor nodes sending data. Each sensor nodes sends both the data and encrypted authentication key to the base station. The experiences had shown that the malfunction doesn't happen in communication among other groups. And we confirmed in tests that the system is secure when a sensor having malicious propose is added.

• Journal of Sensor Science and Technology
• /
• v.16 no.4
• /
• pp.277-285
• /
• 2007

In this paper, we outline the research issues that we are pursuing towards building of location aware environments for mainly ubiquitous healthcare applications. Such location aware application can provide what is happening in this space. To locate an object, such as patient or elderly person, the active ceiling-mounted reference beacons were placed throughout the building. Reference beacons periodically publish location information on RF and ultrasonic signals to allow application running on mobile or static nodes to study and determine their physical location. Once object-carried passive listener receives the information, it subsequently determines it's location from reference beacons. The cost of the system was reduced while the accuracy in our experiments was fairly good and fine grained between 7 and 12 cm for location awareness in indoor environments by using only the sensor nodes and wireless sensor network technology. Passive architecture used here provides the security of the user privacy while at the server the privacy was secured by providing the authentication using Geopriv approach. This information from sensor nodes is further forwarded to base station where further computation is performed to determine the current position of object.

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

In the ad-hoc wireless network environment, that the fixed sensor nodes and the sensor nodes to move are mixed, as the number of the sensor nodes with mobility are getting more, the costs to recover and maintain the whole network will increase more and more. This paper proposed the CDSR (Cost based Dynamic Source Routing) algorithm being motivated from the typical DSR algorithm, that is one of the reactive routing protocol. The cost function is defined through measuring the cost which any sensor node pays to participate in the whole network for communication. It is also showed in this paper that the proposed routing algorithm will increase the efficiency and life of whole sensor network through a series of experiments.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5238-5244
• /
• 2011

Recently, wireless sensor networks have become increasingly interesting areas over extensive application fields such as military, ecological, and health-related areas. Almost sensor networks have mission-critical tasks that requires very high security. Therefore, extensive work has been done for securing sensor networks from outside attackers, efficient cryptographic systems, secure key management and authorization, but little work has yet been done to protect these networks from inside threats. This paper proposed an method to select which nodes should activate their idle nodes as detectors to be able to watch all packets in the sensor network. Suggested method is modeled as optimization equation, and heuristic Greedy algorithm based simulation results are presented to verify my approach.

• The Journal of the Convergence on Culture Technology
• /
• v.7 no.2
• /
• pp.345-350
• /
• 2021

The maintenance of sensor networks, installed in a wide area has been an issue for a long time. In order to solve this problem, studies to supply energy to a sensor network using a robot has been carried out by several researchers. In this study, for a sensor network consisting of power nodes supplied with energy by multiple robots and sensor nodes around them, we propose a method of allocating a work area using a modified k-means algorithm so that the robots move the minimum distance. Through the simulation study using the energy transfer rate of the robot as a variable, it is shown that nodes of each allocated area can maintain survival, and the validity of the proposed modified k-means algorithm is verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.938-948
• /
• 2005

Localization in wireless sensor networks is to determine the positions of all nodes based on the Down positions of several nodes. Much previous work for localization use multilateration or triangulation based on measurement of angles or distances to the fixed nodes. In this paper, we propose a new centralized algorithm for localization using weights of adjacent nodes. The algorithm, having the advantage of simplicity, shows that the localization problem can be formulated to a linear matrix equalities. We mathematically show that the equalities have a unique solution. The unique solution indicates the locations of unknown nodes are capable of being uniquely determined. Three kinds of weights proposed for practical use are compared in simulation analysis.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.487-491
• /
• 2008

This paper proposes the Byzantine fault tolerant clock synchronization scheme for wireless sensor networks to cope with the clock synchronization disturbance attack of malicious nodes. In the proposed scheme, a node which is requiring clock synchronization receives 3m+1 clock synchronization messages not only from its parent nodes but also from its sibling nodes in order to tolerate malicious attacks even if up to m malicious nodes exist among them. The results show that the proposed scheme is 7 times more resilient to the clock synchronization disturbance attack of malicious nodes than existing schemes in terms of synchronization accuracy.