• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.123-129
• /
• 2009

It is important to locate nodes in the research of wireless sensor network. In this paper, we propose a method that estimates the positions of nodes by using adjacent node information and signal strength in wireless sensor network. With this method, we can find positions of nodes easily because we use Information that nodes have. And we can make a map for all the nodes because we can measure a relative position for an node whose position is not known based on anchor nodes whose positions are already known. In addition, we can confirm whether nodes are placed appropriately. We confirmed that we can locate positions of unknown nodes with small error through verifying the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.141-148
• /
• 2009

Wireless Sensor Networks (WSN) can be applied to various industry fields and environment analysis fields with the progress of various sensor technologies. Also WSN help automatically monitoring of sensor nodes installed at wide area. Especially, the tiny sensor nodes recently developed for the environment analysis require much more electronic power. The reasons are the measurable fields are departmentalized and the more detailed measuring fields are created by the development of various materials and applications. Furthermore, the sensor nodes operated by small batteries for the fields require low cost and low power consumption in wireless networks technology. The power efficiency is the most important factor for the WSN life time. Because the sensor nodes are installed at wide area and hard to recover. This paper proposes the WSN algorithm is applied sensor node that has low power consumption and efficiency measurement.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.924-934
• /
• 2011

Sensor networks play an important role in making the dream of ubiquitous computing a reality. With a variety of applications, sensor networks have the potential to influence everyone's life in the near future. However, there are a number of issues in deployment and exploitation of these networks that must be dealt with for sensor network applications to realize such potential. Localization of the sensor nodes, which is the subject of this paper, is one of the basic problems that must be solved for sensor networks to be effectively used. This paper proposes a probabilistic support vector machine (SVM)-based method to gain a fairly accurate localization of sensor nodes. As opposed to many existing methods, our method assumes almost no extra equipment on the sensor nodes. Our experiments demonstrate that the probabilistic SVM method (PSVM) provides a significant improvement over existing localization methods, particularly in sparse networks and rough environments. In addition, a post processing step for PSVM, called attractive/repulsive potential field localization, is proposed, which provides even more improvement on the accuracy of the sensor node locations.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.126-131
• /
• 2008

Wireless Sensor Network(WSNs) consists of small sensor nodes with sensing, computation, and wireless communication capabilities. It has new information collection scheme and monitoring solution for a variety of applications. Faults occurring to sensor nodes are common due to the limited resources and the harsh environment where the sensor nodes are deployed. In order to ensure the network quality of service it is necessary for the WSN to be able to detect the faulty sensors and take necessary actions for the reconstruction of the lost sensor data caused by fault as earlier as possible. In this paper, we propose an recursive PCA-based fault detection and lost data reconstruction algorithm for sensor networks. Also, the performance of proposed scheme was verified with simulation studies.

• Journal of the Korea Society for Simulation
• /
• v.17 no.1
• /
• pp.9-16
• /
• 2008

The sink mobility can request frequent routing change in sensor networks. By active mobility a sink can gather needed information easily so that the network availability will be higher. However, instead static sink system, the connection between sensor nodes and a mobile sink can be changed continuously. That is, the rerouting should be implemented caused by the routing alteration. It is two connection setups for the mobile sink system: the connection from sink to sensor nodes and the connection from sensor nodes to sink. However, sensor nodes actually have many functional limitations. Hence, the low cost scheme will be needed for the connection setup from sensor nodes to the mobile sink. In this paper, we propose an agent scheme to the connection setup from sensor nodes to the mobile sink. The agent scheme provides the reliable setup scheme to the connection by using an agent sector.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1781-1786
• /
• 2005

In sensor network systems, all the nodes are interconnected and the positional information of each sensor is essential. To measure the temperature, position detection and communication functions are required. Many sensor nodes are distributed to a measurement field, and these sensors have three main functions: they measure the distance to the other nodes, the data of which are used to determine the position of each node; they communicate with other nodes; and they measure the temperature of each node. A novel range measurement method using the difference between light and sound propagation speed is proposed. The experimental results show the temperature distribution as measured with the aid of the determined positions. The positions of every node were calculated with a PC program. Eight nodes were manufactured and their fundamental functions were tested. The results of the range measurement method, which takes relatively accurate measurements, contribute significantly to the accuracy of the position determination. Future studies will focus on 3-D position determination and on the architecture of appropriate sensors and actuators.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.2
• /
• pp.29-37
• /
• 2008

Clustering allows hierarchical structures to be built on the nodes and enables more efficient use of scarce resources, such as frequency spectrum, bandwidth, and energy in wireless sensor networks (WSNs). This paper proposes a hierarchical clustering algorithm called EEHC which is more energy efficient than existing algorithms for WSNs, It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. The role of cluster heads or region nodes is rotated among nodes to achieve load balancing and extend the lifetime of every individual sensor node. To do this, EEHC clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes, according to clustering policies from administrators. To prove the performance improvement of EEHC, the ns-2 simulator was used. The results show that it can reduce the energy and bandwidth consumption for organizing and managing WSNs comparing it with existing algorithms.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3793-3814
• /
• 2021

Most secure solutions like cryptography are software based and they are designed to mainly deal with the outside attacks for traditional networks, but such soft security is hard to be implemented in wireless sensor networks to counter the inside attacks from internal malicious nodes. To address this issue, reputation has been introduced to tackle the inside malicious nodes. Reputation is essentially a stimulating mechanism for nodes' cooperation and is employed to detect node misbehaviors and improve the trust-worthiness between individual nodes. Among the reputation models, binomial distribution based reputation has many advantages such as light weight and ease of implementation in resource-constraint sensor nodes, and accordingly researchers have proposed many insightful related methods. However, some of them either directly use the modelling results, apply the models through simple modifications, or only use the required components while ignoring the others as an integral part of the whole model, this topic still lacks a comprehensive and systematical review. Thus the motivation of this study is to provide a thorough survey concerning each detailed functional components of binomial distribution based reputation for wireless sensor networks. In addition, based on the survey results, we also argue some open research problems and suggest the directions that are worth future efforts. We believe that this study is helpful to better understanding the reputation modeling mechanism and its components for wireless sensor networks, and can further attract more related future studies.

• ETRI Journal
• /
• v.46 no.4
• /
• pp.604-618
• /
• 2024

In wireless sensor network (WSN) monitoring systems, redundant data from sluggish environmental changes and overlapping sensing ranges can increase the volume of data sent by nodes, degrade the efficiency of information collection, and lead to the death of sensor nodes. To reduce the energy consumption of sensor nodes and prolong the life of WSNs, this study proposes a dual layer intracluster data fusion scheme based on ring buffer. To reduce redundant data and temporary anomalous data while guaranteeing the temporal coherence of data, the source nodes employ a binarized similarity function and sliding quartile detection based on the ring buffer. Based on the improved support degree function of weighted Pearson distance, the cluster head node performs a weighted fusion on the data received from the source nodes. Experimental results reveal that the scheme proposed in this study has clear advantages in three aspects: the number of remaining nodes, residual energy, and the number of packets transmitted. The data fusion of the proposed scheme is confined to the data fusion of the same attribute environment parameters.