• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.995-1003
• /
• 2005

Since the sensor network nodes have a small size and limited battery power, there have been many studies for reducing their energy consumption. Each sensor node can show different energy usage according to the frequency of event sensing and data transmission, and thus they have different lifetime. So, some nodes may run out of energy that causes disconnection of paths and reduction of network lifetime. In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy-consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and somewhat uniform energy consumption by nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.101-108
• /
• 2010

Many works on energy-efficient cluster event detection schemes have been done considering the energy restriction of sensor networks. The existing cluster event detection schemes transmit only the boundary information of detected cluster event nodes to the base station. However, If the range of the cluster event is widened and the distribution density of sensor nodes is high, the existing cluster event detection schemes need high transmission costs due to the increase of sensor nodes located in the event boundary. In this paper, we propose an energy-efficient cluster event detection scheme using the minimum boundary polygons (MBP) that can compress and summarize the information of event boundary nodes. The proposed scheme represents the boundary information of cluster events using the MBP creation technique in the large scale of sensor network environments. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the performance evaluation. Simulation results show that our scheme maintains about 92% accuracy and decreases about 80% in energy consumption to detect the cluster event over the existing schemes on average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.41-49
• /
• 2009

A crucial issue in deploying wireless sensor networks is to perform a sensing task in an area of interest in an energy-efficient manner since sensor nodes have limited energy Power. The most practical solution to solve this problem is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy In this paper, we present a simple wake-up scheduling protocol, which can maintain sensing coverage required by applications and yet increase network lifetime by turning off some redundant nodes. In order to do this, we use the concept of a weighted average distance. A node decides whether it is active or inactive based on the weighted average distance. The proposed protocol allows sensor nodes to sleep dynamically while satisfying the required sensing coverage.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2340-2349
• /
• 2009

In this paper we proposed a hopping routing scheme to resolve the hot spot problem for periodic monitoring services in wireless sensor networks. Our hopping routing scheme constructs load balanced routing path, where an amount of energy consumption of all nodes in the sensor networks is predictable. Load balanced routing paths can be obtained from horizontal hopping transmission scheme which balances the load of the sensor nodes in the same area, and also from vertical hopping transmission scheme which balances the load of the sensor nodes in the other area. The direct transmission count numbers as load balancing parameter for vertical hopping transmission are derived using the energy consumption model of the sensor nodes. The experimental results show that the proposed hopping scheme resolves the hot spot problem effectively. The efficiency of hopping routing scheme is also shown by comparison with other routing scheme such as multi-hop, direct transmission and clustering.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1519-1527
• /
• 2007

In order to combat the security threats that sensor networks are exposed to, a cryptography protocol is implemented at sensor nodes for point-to-point encryption between nodes. Given that nodes have limited resources, symmetric cryptography that is proven to be efficient for low power devices is implemented. Data protection is integrated into a sensor's packet by the means of symmetric encryption with the Dragon stream cipher and incorporating the newly designed Dragon-MAC Message Authentication Code. The proposed algorithm was designed to employ some of the data already computed by the underlying Dragon stream cipher for the purpose of minimizing the computational cost of the operations required by the MAC algorithm. In view that Dragon is a word based stream cipher with a fast key stream generation, it is very suitable for a constrained environment. Our protocol regarded the entity authentication and message authentication through the implementation of authenticated encryption scheme in wireless sensor nodes.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.133-138
• /
• 2009

When sensor networks are deployed in open environments, an adversary may compromise some sensor nodes and use them to inject false sensing reports. False report attack can lead to not only false alarms but also the depletion of limited energy resources in battery powered networks. The Interleaved hop-by-hop authentication (IHA) scheme detects such false reports through interleaved authentication. In IHA, when a report is forwarded to the base station, all nodes on the path must spend energies on receiving, authenticating, and transmitting it. An dversary can spend energies in nodes by using the methods as a relaying attack which uses macro. The Adversary aim to drain the finite amount of energies in sensor nodes without sending false reports to BS, the result paralyzing sensor network. In this paper, we propose a countermeasure using fuzzy logic from the Denial of Service(DoS) attack and show an efficiency of energy through the simulataion result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.505-507
• /
• 2021

In a Wireless Sensor Network (WSN), the wireless data transmission environment plays an important role in system performance. In the proposed mobility model moving distance of sensor nodes has a great influences on communication performance. Transmission/receiving distance (d), path loss (L), sensitivity, Bit Error Rate (BER), Signal-to-Noise Ratio (SNR) are considerations when designing a wireless communication system. MANET is a form of network in which only wireless terminals communicate with each other independently and move without any assistance of an existing infrastructure network. This paper is research on the optimized power usage method which is study on the effect of the moving distance of mobile nodes on the overall energy efficiency of the system in WSN. The purpose of this study is to extend the life of the entire network by proposing the mobile distance of sensor nodes within the communication available range.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2091-2098
• /
• 2006

In this paper, it proposes a protocol of resource adaptive data dissemination for sensor nodes in a wireless sensor network. In general, each sensor node used in a wireless sensor network delivers the required information to the final destination by conducting cooperative works such as sensing, processing, and communicating each other using the battery power of a independent sensor node. So, a protocol used for transferring the acquired information to users through the wireless sensor network can minimize the power consumption of energy resource given to a sensor node. Especially, it is very important to minimize the total amount of power consumption with a method for handling the problems on implosion. data delivery overlapping, and excessive message transfer caused by message broadcasting. In this paper, for the maintaining of the shortest path between sensor nodes, maximizing of the life time of a sensor node and minimizing of communication cost, it presents a method for selecting the representative transfer node for an event arising area based on the negotiation scheme and maintaining optimal transfer path using hop and energy information. Finally, for the performance evaluation, we compare the proposed protocol to existing directed diffusion and SPIN protocol. And, with the simulation results, we show that the proposed protocol enhances the performance on the power consumption rate when the number of overall sensor nodes in a sensor network or neighbor sensor nodes in an event area are increased and on the number of messages disseminated from a sensor node.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.59-67
• /
• 2009

This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

• The Journal of Korea Robotics Society
• /
• v.2 no.1
• /
• pp.71-79
• /
• 2007

We propose and develop Home Security robot system based on Sensor Network (HSSN) configured by sensor nodes including radio frequency (RF), ultrasonic, temperature, light and sound sensors. Our system can acknowledge security alarm events that are acquired by sensor nodes and relayed in the hop-by-hop transmission way. There are sensor network, Home Security Mobile Robot (HSMR) and Home Server(HS) in this system. In the experimental results of this system, we presented that our system has more enhanced performance of response to emergency context and more speedy and accurate path planning to target position for arriving an alarm zone with obstacle avoidance and acquiring the context-aware information.