• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.10-17
• /
• 2010

Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.154-161
• /
• 2010

The properties of sensor node having a restricted energy in WSN have a difficult in various application fields to apply. Our paper proposed the cluster head selection which is an effective energy in order to manage in wireless sensor network. The proposed algorithm improves an energy efficient and is applied to various network environment considering energy capacity between cluster head and nodes and distance between cluster head and base station(sink node). By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH-C. Experimental results validate our scheme, showing a better performance than original LEACH-C in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.31-36
• /
• 2011

Ubiquitous network and wireless sensor networks is being applied in various fields. Located at target areas, node of wireless sensor network uses batteries as a power source. Batteries have a limited energy in sensor network applications. Also, before use, the battery must be charged and It is difficult to replace the battery. Therefore, energy harvesting technology is being researched and being developed for long life of sensor node. Especially, sola energy is being extensively researched. because that can have great amounts of energy than other environmental energy in a short time. In this study, we tested battery charging and recharging, operation of sensor node using Solar Cell. Also, monitoring data gathering and voltage Analysis showed energy harvesting time of Sola Cell battery for sensor node and operation of sensor node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.791-800
• /
• 2010

Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.913-916
• /
• 2010

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. TCRP selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.188-189
• /
• 2014

무선센서네트워크에서 센서 노드들은 정보를 수집 및 취합하기 위해 다양하게 사용되고 있다. 각 센서들은 베터리 전력을 사용하여 에너지 절약은 가장 중요한 이슈 중 하나다. 현재까지 에너지 소모가 가장 큰 장거리 통신 시 에너지 절약 및 분산제어가 용이한 클러스터링의 데이터 병합 관련 분야는 꾸준히 관심을 받아오고 있다. 최근 이를 기반으로 데이터 병합 시 생기는 딜레이를 최소화하고, 에너지 소비량 도 고려한 다양한 알고리즘들이 제안되었다. 하지만 토폴로지 형성 시 데이터 병합 딜레이와 에너지 효율을 동시에 최적화하는 상황에서 장거리 노드 간 링크 생성 문제는 여전히 해결되지 않고 있다. 본 논문은 이러한 문제점을 해결하기 위해 노드 간 링크를 재구축하여 트리의 구조유지하면서 링크들의 길이를 줄일 수 있는 트리 재구축 알고리즘을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.139-142
• /
• 2010

클러스터 기반의 무선 센서 네트워크는 데이터를 병합하여 전송함으로써 에너지를 효율적으로 사용할 수 있다. 하지만 데이터를 병합하는 클러스터 헤드에 집중된 부하로 인해 센서노드 간 에너지 불균형이 발생하게 된다. 에너지가 고갈되어 가는 센서노드는 클러스터 헤드 선출기간에 필요한 메시지 전송에 따른 에너지 소모가 부담이 된다. 본 논문에서는 센서노드의 에너지가 고갈되어 갈 때 클러스터 선출에 발생하는 에너지 소모를 감소시키기 위해 클러스터 헤드 스케줄링 기법(Cluster Head Scheduling Scheme:CHSS)을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.3
• /
• pp.8-13
• /
• 2012

In this paper, we investigate cooperative spectrum sensing scheme for sensor network-aided cognitive radio systems with energy harvesting capability. In the proposed model, each sensor node harvests ambient energy from environment such as solar, wind, mechanical vibration, or thermoelectric effect. We propose adaptive cooperative spectrum sensing scheme in which each sensor node adaptively carries out energy detection depending on the residual energy in its energy storage and then conveys the sensing result to the fusion center. From simulation results, we show that the proposed scheme minimizes the false alarm probability for given target detection probability by adjusting the number of samples for energy detector.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1057-1059
• /
• 2016

A construction method of energy-efficient data aggregation tree is proposed by considering a tradeoff between acquisition time and energy consumption in wireless sensor networks. This proposed method constructs the data aggregation tree to minimize the link cost between the connected nodes for reducing energy consumption, while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed aggregation tree can be generated with low complexity and achieves high energy efficiency compared to conventional methods.