• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1511-1518
• /
• 2008

Wireless sensor network is a network that consists of small wireless sensor nodes. Sensor nodes transfer the sensed data about the objects or environment to the sink through wireless channel. The energy dissipation by wireless transmission is the primary factor of energy dissipation in the sensor node. To utilize the limitted resource at the sensor node, it is required to reduce the number of wireless transmission. In the paper, we proposes a new energy efficient method, NRMC, to reduce the energy dissipation by using the compression technique - DPCM, Wavlet, Quantization, RLC. With NTRC, the life time of sensor network could be increased.

• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.303-316
• /
• 2011

Data aggregation is important in wireless sensor networks. However, it also introduces many security problems, one of which is that a compromised node may inject false data or drop a message during data aggregation. Most existing solutions rely on encryption, which however requires high computation and communication cost. But they can only detect the occurrence of an attack without finding the attacking node. This makes sensor nodes waste their energy in sending false data if attacks occur repeatedly. Even an existing work can identify the location of a false data injection attack but it has a limitation that at most 50% of total sensor nodes can participate in data transmission. Therefore, a novel approach is required such that it can identify an attacker and also increase the number of nodes which participate in data transmission. In this paper, we propose a monitoring-based secure data aggregation protocol to prevent against a compromised aggregator which injects false data or drops a message. The proposed protocol consists of aggregation tree construction and secure data aggregation. In secure data aggregation, we use integration of abnormal data detection with monitoring and a minimal cryptographic technique. The simulation results show the proposed protocol increases the number of participating nodes in data transmission to 95% of the total nodes. The proposed protocol also can identify the location of a compromised node which injects false data or drops a message. A communication overhead for tracing back a location of a compromised node is O(n) where n is the total number of nodes and the cost is the same or better than other existing solutions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.77-87
• /
• 2018

Many researches have been focused on localization in WSNs. However, the solutions for localization in static WSN are hard to apply to the mobile WSN. The solutions for mobile WSN localization have the assumption that there are a significant number of anchor nodes in the networks. In the resource limited situation, these solutions are difficult in applying to the static and mobile mixed WSN. Without using the anchor nodes, a localization service cannot be provided in efficient, accurate and reliable way for mixed wireless sensor networks which have a combination of static nodes and mobile nodes. Also, accuracy is an important consideration for localization in the mixed wireless sensor networks. In this paper, we presented a method to satisfy the requests for the accuracy of the localization without anchor nodes in the wireless sensor networks. Hop coordinates measurements are used as an accurate method for anchor free localization. Compared to the other methods with the same data in the same category, this technique has better accuracy than other methods. Also, we applied a minimum spanning tree algorithm to satisfy the requests for the efficiency such as low communication and computational cost of the localization without anchor nodes in WSNs. The Java simulation results show the correction of the suggested approach in a qualitative way and help to understand the performance in different placements.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.761-762
• /
• 2013

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.1-8
• /
• 2008

Recently, there is developing various ubiquitous application services using sensor networks based on TinyOS represented the operating system of sensor node. These sensor networks perform the collection and the transmission of sensing data from sensor node to get the context information. In this paper, we proposes the sensor node control algorithm which converts a sensor node to sleep, active, power off mode according to monitoring result of the voltage state of sensor node. Also, we designs and implement the sensor control module on server, sink, sensor node of sensor networks using this algorithm. It designs a sensor voltage control module of sensor node, data receive and display module of USN server using a java language and TinyOS. And, it checks the voltage state of sensor node, and it changes one of the sleep or power off modes in case of high voltage loss. Accordingly, we effectively use the power of sensor nodes as changing control modes of sensor nodes.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.21-33
• /
• 2008

The wireless sensor nodes near to the fixed sink node suffer from the quickly exhausted battery energy. To address this problem, the mobile sink node has been applied to distribute the energy consumption into all wireless sensor nodes. However, since the mobile sink node moves, the data collection scheduling scheme is necessary for the sink node to receive the data from all sensor nodes as fair as possible. The application fields of wireless sensor network need the real-time processing. If the uneven data collection occurs in the wireless sensor network, the real-time processing for the urgent events can not be satisfied. In this paper, a new method is proposed to support the lair data collection between all sensor nodes. The proposed method performs the scheduling algorithm based on the resident time of the sink node staying in a radius of communication range and the amount of data transferred already. In this paper, the proposed method and existing data collection scheduling schemes are evaluated in wireless sensor network with the mobile sink node. The result shows that the proposed method provides the best fairness among all data collection schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.206-214
• /
• 2016

Recently, radio frequency energy transfer (RFET) attracts more and more interests for powering sensor nodes in the wireless sensor network (WSN). In the conventional WSN, reducing energy consumption of sensor nodes is of primary importance. On the contrary, in the WSN with RFET, reducing energy consumption is not an important issue. However, in the WSN with RFET, the energy harvesting rate of each sensor node depends on its location, which causes the unbalanced available energy among sensor nodes. Hence, to improve the performance of the WSN with RFET, it is important to develop network protocols considering this property. In this paper, we study this issue with jointly considering routing, scheduling, and power control in the WSN with RFET. In addition, we study this issue with considering two different objectives: 'Max-min' with which we tries to maximize the performance of a sensor node having the minimum performance and 'Max-min fairness' with which we tries to achieve max-min fairness among sensor nodes. We show that our solutions can improve network performance significantly and we also discuss the differences between 'Max-min' and 'Max-min fairness'.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5149-5167
• /
• 2017

Reducing energy consumption in a wireless video sensor network (WVSN) is a crucial problem because of the high video data volume and severe energy constraints of battery-powered WVSN nodes. In this paper, we present an adaptive dynamic resizing approach for a SRAM communication buffer in a WVSN node in order to reduce the energy consumption and thereby, to maximize the lifetime of the WVSN nodes. To reduce the power consumption of the communication part, which is typically the most energy-consuming component in the WVSN nodes, the radio needs to remain turned off during the data buffer-filling period as well as idle period. As the radio ON/OFF transition incurs extra energy consumption, we need to reduce the ON/OFF transition frequency, which requires a large-sized buffer. However, a large-sized SRAM buffer results in more energy consumption because SRAM power consumption is proportional to the memory size. We can dynamically adjust any active buffer memory size by utilizing a power-gating technique to reflect the optimal control on the buffer size. This paper aims at finding the optimal buffer size, based on the trade-off between the respective energy consumption ratios of the communication buffer and the radio part, respectively. We derive a formula showing the relationship between control variables, including active buffer size and total energy consumption, to mathematically determine the optimal buffer size for any given conditions to minimize total energy consumption. Simulation results show that the overall energy reduction, using our approach, is up to 40.48% (26.96% on average) compared to the conventional wireless communication scheme. In addition, the lifetime of the WVSN node has been extended by 22.17% on average, compared to the existing approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.832-844
• /
• 2008

Distributed localization algorithms are necessary for large-scale wireless sensor network applications. In this paper, we introduce an efficient node distribution based localization algorithm that emphasizes simple refinement and low system load for low-cost and low-rate wireless sensors. Each node adaptively chooses neighbor nodes for sensors, update its position estimate by minimizing a local cost function and then passes this update to the neighbor nodes. The update process considers a distribution of nodes for large-scale networks which have same density in a unit area for optimizing the system performance. Neighbor nodes are selected within a range which provides the smallest received signal strength error based on the real experiments. MATLAB simulation showed that the proposed algorithm is more accurate than trilateration and les complex than multidimensional scaling. The implementation on MicaZ using TinyOS-2.x confirmed the practicality of the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.197-203
• /
• 2011

In this paper, a new cluster configuration process is proposed. The energy consumption of sensor nodes is reduced by configuring the initial setup process only once with keeping the initial cluster. Selecting the highest power consumed node of the member nodes within the cluster to the header of next round can distribute power consumption of all nodes in the cluster evenly. With this proposed way, the lifetime of the USN is increased by the reduced energy consumption of all nodes in the cluster. Also, evenly distributed power consumptions of sensors are designed to improve the energy hole problem. The effectiveness of the proposed algorithms is confirmed through simulations.