• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1893-1894
• /
• 2008

Advances in hardware and wireless network technologies have placed us at the doorstep of a new era where small wireless devices will provide access to information anytime, anywhere as well as actively participate in creating smart environments. In this paper, we propose location-aware clustering method in wireless sensor networks. Previous clustering algorithm assumes that all nodes know its own location by GPS. But, it is unrealistic because of GPS module cost and large energy consumption. So, we operate localization ahead of cluster set-up phase. And Considering node density and geographic information, Cluster Heads are elected uniformly. Moreover, communication between CHs is prolonged network lifetime.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.441-457
• /
• 2014

Observed from the recent performance evaluation of clustering schemes in wireless sensor networks, we found that most of them did not consider various sensor characteristics and its application environment. Without considering these, the performance evaluation results are difficult to be trusted because these networks are application-specific. In this paper, for the fair evaluation, we measured several clustering scheme's performance variations in accordance with sensor data pattern, number of sensors per node, density of points of interest (data density) and sensor coverage. According to the experiment result, we can conclude that clustering methods are easily influenced by POI variation. Network lifetime and data accuracy are also slightly influenced by sensor coverage and number of sensors. Therefore, in the case of the clustering scheme that did not consider various conditions, fair evaluation cannot be expected.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.55-65
• /
• 2009

The objective of this paper is to propose an ant colony optimization (ACO) for clustering design in wireless sensor network problem. This proposed ACO approach is designed to deal with the dynamics of the sensor nodes which can be adaptable to topological changes to any network graph in a time. Long communication distances between sensors and a sink in a sensor network can greatly consume the energy of sensors and reduce the lifetime of a network. We can greatly minimize the total communication distance while minimizing the number of cluster heads using proposed ACO. Simulation results show that our proposed method is very efficient to find the best solutions comparing to the optimal solution using CPLEX in 100, 200, and 400 node sensor networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.391-394
• /
• 2006

무선 센서 네트워크에서 각 센서 노드는 에너지의 한계를 가지기 때문에, 에너지 소비문제는 매우 중요한 이슈이다. 조밀한 환경의 센서 네트워크에서 모든 노드들이 센싱에 참여한다면, 센싱영역의 중복영역이 커지게 되고, 이로 인해 불필요한 에너지를 소비하게 된다. 본 논문에서는 connectivity 와 coverage 를 보장할 수 있고, 효율적으로 활성화 노드를 선택할 수 있는 기법을 제안하여, 불필요한 센서 노드들의 에너지소비를 막아 전체적인 네트워크의 lifetime 을 연장시키고자 한다.

• Journal of Astronomy and Space Sciences
• /
• v.14 no.1
• /
• pp.158-165
• /
• 1997

The Sun interference event predictions for the KOMPSAT TT&C station were performed to analyze the frequency of the event and the impact on the TT&C link. The KOMPSAT orbit was propagated including only J2 geopotential term for maintaining the Sun-synchronism and no other perturbations were included. Local time of ascending node of the KOMPSAT satellite was set to 10h50m00s. The TT&C station was assumed to locate in Taejon and have 9 meter antenna for S-band link. One year of simulation from 1999/07/01 were performed out of 3 year of mission lifetime of KOMPSAT satellite. Total four times of Sun interference events were occurred during 1 year of simulation and those lasted about 50 seconds altogether. The C/N degradation of the TT&C system was calculated about 4dB. The Sun interference event of 50 seconds of year are 0.0076 percents of the S-band contact time when the 30 minute of contact time is assumed in a day.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.157-158
• /
• 2006

무선 센서 네트워크에서 각 센서 노드는 에너지의 한계를 가지기 때문에, 에너지 소비문제는 매우 중요한 이슈이다. 조밀한 환경의 센서 네트워크에서 모든 노드들이 센싱에 참여한다면, 센싱영역의 중복영역이 커지게 되고, 이로 인해 불필요한 에너지를 소비하게 된다. 본 논문에서는 WSN 에서 connectivity 와 coverage 를 보장할 수 있는 효율적인 활성화 노드를 선택하는 기법을 제안하여, 불필요한 센서노드들의 에너지소비를 막고 전체적인 네트워크의 lifetime 을 연장시키고자 한다

• Annual Conference of KIPS
• /
• 2002.11b
• /
• pp.1317-1320
• /
• 2002

We present in this paper a new version of AODV that incorporates with "Minimizing Maximum node cost" by formulating that metric as a cost function of residual energy of nodes. An additional parameter is added to the cost function to consider the routing performance along with power-efficiency. The motivation of adding that new parameter is originated from the trace off between power-saving behaviors and routing performance.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.39-45
• /
• 2010

As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.49-56
• /
• 2015

As WSN is energy constraint so energy efficiency of nodes is important. Because avoiding long distance communication, clustering operating in rounds is an efficient algorithm for prolonging the lifetime of WSN and its performance depends on duration of a round. A short round time leads to frequent re-clustering while a long round time increases energy consume of cluster heads more. So existing clustering schemes determine proper round time, based on the parameters of initial WSN. But it is not appropriate to apply the round time according to initial value throughout the whole network time because WSN is very dynamic networks nodes can be added or vanished. In this paper we propose a new algorithm which calculates the round time relying on the alive node number to adapt the dynamic WSN. Simulation results validate the proposed algorithm has better performance in terms of energy consumption of nodes and loss rate of data.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.63-68
• /
• 2015

In this paper, we propose a new energy efficient scheme which can prolong the life of sensor networks, it should be able to reduce the number of sensing. We use the concept of safe zone for manage the appropriate range of properties. We measure the distance between the sensed temperature value and the center of the zone, and calculate the next sensing interval based on this distance. We name our proposed scheme "VIS". To assess the performance of the proposed scheme the actual temperature data was collected using the sensor node. The algorithm was implemented through the programming and was evaluated in a variety of settings. Experimental results show that the proposed algorithm is to significantly reduce the number of sensing in terms of energy efficiency while having the ability to know the state of the sensor nodes periodically. Our VIS algorithm can be useful in applications which will require the ability of control to the temperature within a proper range.