• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.277-284
• /
• 2007

The routing algorithm many used in the wireless sensor network features the clustering method to reduce the amount of data transmission from the energy efficiency perspective. However, the clustering method results in high energy consumption at the cluster head node. Dynamic clustering is a method used to resolve such a problem by distributing energy consumption through the re-selection of the cluster head node. Still, dynamic clustering modifies the cluster structure every time the cluster head node is re-selected, which causes energy consumption. In other words, the dynamic clustering approaches examined in previous studies involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. In order to resolve the energy consumption problem associated with the repetitive set-up, this paper proposes the Round-Robin Cluster Header (RRCH) method that fixes the cluster and selects the head node in a round-robin method The RRCH approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.

• IE interfaces
• /
• v.23 no.2
• /
• pp.108-117
• /
• 2010

Wireless sensor network may be installed where it is hard to access or where one has to constantly gather data without any human's monitoring. Sensors which compose a sensor network are usually small with poor battery capacities and thus energy-efficient usage is very important because of difficulties in replacing or recharging the batteries to make the lifetime of the whole sensor network longer. LEACH protocol, a well-known hierarchical routing protocol, may resolve this problem by distributing the role of cluster header evenly to the sensor nodes in the whole area of network at each round. In this thesis, we introduce a variant of LEACH protocol which considers the distance between base station and sensors in the way that if a node is far from the base station then the probability that this node becomes a cluster header is low. Experiments to evaluate the energy efficiency and the ability to collect the information show that the proposed method in this paper has maintained much wider sensing area while keeping the energy efficiency same as LEACH.

• Annual Conference of KIPS
• /
• 2008.05a
• /
• pp.1116-1119
• /
• 2008

무선 센서 네트워크는 주변 정보를 감지할 수 있는 다수의 센서들로 구성된 네트워크로 다양한 분야에서 활용되고 있다. 과거에는 무선 센서 네트워크 환경에서 각 센서들 간의 비밀통신이 중요한 이슈였으며, 특히 이를 위한 키 관리 기법들이 주요 연구방향이었다. 하지만 잘 분배되고 관리된 키라 할지라도, 공격자에 의해 특정한 센서 노드(node)가 수집되면, 노출된 노드(compromised node)가 가지고 있는 키가 공격자에게 들어나게 된다. 노출된 공유키(shared key)를 통해 노출되지 않은 정상 노드(non-compromised node) 사이의 대칭키(pairwise key)를 얻을 수 있으며 결국 공격자는 네트워크에 심각한 영향을 줄 수 있는 메시지 삽입 및 수정 공격을 감행할 수 있다. 본 논문에서는 이와 같은 공격을 탐지하고 오용된 키(misused key)를 폐기하기 위한 방법으로 DAC(detection at cluster header) 기법을 제안한다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.313-320
• /
• 2008

The dynamic clustering technique has some problems regarding energy consumption. In the cluster configuration aspect the cluster structure must be modified every time the head nodes are re-selected resulting in high energy consumption. Also, there is excessive energy consumption when a cluster head node receives identical data from adjacent cluster sources nodes. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects duster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. Furthermore, the issue of redundant data occurring at the cluster head node is dealt with by broadcasting metadata of the initially received data to prevent reception by a sensor node with identical data. A simulation experiment was performed to verify the validity of the proposed approach. The results of the simulation experiments were compared with the performances of two of the must widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 29.3% and 21.2% more efficient than LEACH and HEED, respectively.

• Journal of Sensor Science and Technology
• /
• v.19 no.5
• /
• pp.342-348
• /
• 2010

The wireless sensor networks have been extensively researched. One of the issues in wireless sensor networks is a developing energy-efficient clustering protocol. Clustering algorithm provides an effective way to extend the lifetime of a wireless sensor networks. In this paper, we proposed an energy efficient clustering scheme by adjusting group size. In sensor network, the power consumption in data transmission between sensor nodes is strongly influenced by the distance of two nodes. And cluster size, that is the number of cluster member nodes, is also effected on energy consumption. Therefore we proposed the clustering scheme for high energy efficiency of entire sensor network by controlling cluster size according to the distance between cluster header and sink.

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

This paper proposes an algorithm to improve total network lifetime for Wireless Sensor Network (WSN) application such as environmental condition monitoring systems based on LEACH protocol. Firstly, the algorithm had equal number of nodes allocated to each cluster at cluster set-up phase where it abided by LEACH protocol. Secondly, at cluster set-up phase, each node was determined the order to be cluster header of the cluster which it had joined. After then, the role of a cluster head delivers to the next node according to determined order when the cluster head has received certain number of packets. With above method energy consumption of each node made equal and overall network lifetime was increased. Simulation results shows that overall network lifetime of proposed algorithm was increased two times than that of LEACH and total energy consumption was one forth of that of LEACH protocol.

• ETRI Journal
• /
• v.39 no.2
• /
• pp.275-283
• /
• 2017

A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy-efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing-related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well-known real network topologies and achieved a more energy- efficient performance than that achieved in previous studies.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.552-557
• /
• 2004

Mobile Ad Hoc Network (MANET) is a network architecture, which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, previously developed routing algorithms in wired networks cannot be used. And many new algorithms have been undergone. This study proposes the secondary leader approach to the cluster based routing protocol(CBRP). In case, the primary leader becomes abnormal status so that the primary leader cannot participate the communications between network entities, the secondary leader immediately replaces the primary header without selecting process of the new primary leader. The performances of proposed algorithm ACBRP(Advanced Cluster. Based Routing Protocol;CBRP using secondary leader) are compared with CBRP and results are presented in order to show the effectiveness of the algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.993-999
• /
• 2011

In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.640-648
• /
• 2017

Sensors have limited resources in sensor networks, so efficient use of energy is important. In order to use the energy of the sensor node efficiently, researches applying mobile sink to the sensor network have been actively carried out. The sink node moves the sensor network, collects data from each sensor node, which spread the energy concentrated around the sink node, thereby extending the entire life cycle of the network. But, when the sink node moves, it requires a reset of the data transmission path, which causes a lot of control messages and delays. In this paper, we propose a CMS(Cluster-based Mobile Sink) method to support the movement of mobile sink in a cluster sensor environment. The proposed scheme minimizes an amount of control messages without resetting the routing paths of entire sensor networks by supporting the sink mobility path using the neighbor cluster list. And, it simplifies the routing path setup process by setting a single hop path between clusters without a gateway. The experiment results show that the proposed scheme has superior energy efficiency in processing and network structure, compared with existing clustering and mesh routing protocols.