• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.413-424
• /
• 2009

Wireless sensor network is based on an event driven system. Sensor nodes collect the events in surrounding environment and the sensing data are relayed into a sink node. In particular, when events are detected, the data sensing periods are likely to be shorter to get the more correct information. However, this operation causes the traffic congestion on the sensor nodes located in a routing path. Since the traffic congestion generates the data queue overflows in sensor nodes, the important information about events could be missed. In addition, since the battery energy of sensor nodes exhausts quickly for treating the traffic congestion, the entire lifetime of wireless sensor networks would be abbreviated. In this paper, a new congestion control method is proposed on the basis of genetic algorithm. To apply genetic algorithm, the data traffic rate of each sensor node is utilized as a chromosome structure. The fitness function of genetic algorithm is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets, the proposed method selects the optimal data forwarding sensor nodes for relieving the traffic congestion. In experiments, when compared with other methods to handle the traffic congestion, the proposed method shows the efficient data transmissions due to much less queue overflows and supports the fair data transmission between all sensor nodes as possible. This result not only enhances the reliability of data transmission but also distributes the energy consumptions across the network. It contributes directly to the extension of total lifetime of wireless sensor networks.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.204-216
• /
• 2010

Since Sensor nodes around a fixed sink have huge concentrated network traffic, the battery consumption of them is increased extremely. Therefore the lifetime of sensor networks is limited because of huge battery consumption. To address this problem, a mobile sink has been studied for load distribution among sensor nodes. Since a mobile sink changes its location in sensor networks continuously, the mobile sink has time limits to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, a fair and stable data collection method between a mobile sink and sensor nodes is necessary in this environment. When some sensor nodes are not able to send data to the mobile sink, a real-time application in sensor networks cannot be provided. In this paper, the new scheduling method, FQMS (Fair Queuing for Mobile Sink), is proposed for fair and stable data collection for mobile sinks in sensor networks. The FQMS guarantees balanced data collecting between sensor nodes for a mobile sink. In out experiments, the FQMS receives more packets from sensor nodes than legacy scheduling methods and provides fair data collection, because moving speed of a mobile sink, distance between a mobile sink and sensor nodes and the number of sensor nodes are considered.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.372-382
• /
• 2005

Aggregation such as computing an average value of data measured in each sensor commonly occurs in many applications of sensor networks. Since sensor networks consist of low-cost nodes with limited battery power, reducing energy consumption must be considered in order to achieve a long network lifetime. Reducing the amount of messages exchanged is the most important for saving energy. Earlier work has demonstrated the effectiveness of in-network data aggregation and data filtering for minimizing the amount of messages in sensor networks. In this paper, we propose an adaptive error adjustment scheme that is simpler, more effective and efficient than previous work. The proposed scheme is based on self-adjustment in each sensor node. We show through various experiments that our scheme reduces the network traffic significantly, and performs better than existing methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.2
• /
• pp.99-104
• /
• 2013

Replacement of sensor nodes for monitoring a wide range area such as mountains and forests needs a lot of time and cost. Using new and renewable energy around them can maximize the lifetime of wireless sensor networks, in which solar energy is infinite energy source that is available in 365 days. To design these sensor networks, solar energy model is essential and to estimate and analyze the overall photovoltaic energy. Using this, we can figure out important data such as the size and performance of solar panel needed. However, existing researches for solar energy harvesting consider parts of many factors to influence the quantity of solar energy gathered. In this paper, we suggest advanced solar energy harvesting model considering angular loss (solar cell panel), overheat loss (solar cell), rechargeable battery heat and cooling for each monthly properties. From our experimental results according to outdoor temperature, panel angle and the surface temperature of solar panel, we show these impact factors are correctly configured.

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

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.495-502
• /
• 2013

In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.535-542
• /
• 2009

Wireless Sensor Network (WSN) is a wireless network consisting of spatially distributed autonomous devices, using sensors to cooperatively monitor physical or environmental conditions. WSNs face the critical challenge of sustaining long-term operation on limited battery energy. Coverage maintenance has been proposed as a promising approach to prolong network lifetime. Mobile sensors equipped with communication devices can be leveraged to overcome the coverage problem. In this paper, we propose a stepwise movement scheme using perimeter coverage property for the coverage maintenance problem. In our scheme, each sensor monitors neighboring dead nodes, determines vulnerable node (i.e. dead node which makes uncovered area), computes the center of uncovered area HC, and makes a coordinated stepwise movement to compensate the uncovered area. In our experimental results, our scheme shows at least 50 % decrease in the total moving distance which determines the energy efficiency of mobile sensor.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.499-504
• /
• 2010

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.

• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.122-127
• /
• 2017

The data link layer operates reliable internode communication in the OSI reference model. Generally, the forward error correction (FEC) method is used in the data link layer of the wireless sensor network (WSN) environment that has a high frequency of errors. However, the FEC method consumes a significant amount of energy due to its high error correction rate, which negatively affects the networks' lifespan. In contrast with battery-based technology, energy is regularly recharged in the solar-powered WSN to meet higher energy needs than required for basic operation of existing nodes. By efficiently utilizing this surplus energy, the proposed energy-aware FEC method can reduce the data loss rate with no decrement of the network lifetime. The method employs a trade-off relationship between the energy and data loss rate by adjusting the parity length in the FEC method to the energy state in each node. The performance of the proposed scheme was verified through a simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.8
• /
• pp.2999-3004
• /
• 2010

In comparison with some other light sources, LED has merits such as long lifetime, pollution free, and high energy efficiency. Lately, due to development of LED with high brightness and capacity, LED, which has been applied in display system only, has applied in the field of lighting system. As power LED for lighting system can be burned out by heat problem, the driving current of power LED has to be controlled below the designed value. In this paper, power LED photovoltaic lighting system, which has the current limitting function, has been described. After photovoltaic power is generated from PV panel. it is charged into a battery. And then, after the charged power is converted to DC24[V] through a boost DC-DC converter, it is supplied to power LED at night. It has been validated by designing and testing of 72[W] power LED lighting system, which includes a PV charger, a boost DC-DC converter and a current limiter for driving power LED.