• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.63-74
• /
• 2021

According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.2017-2020
• /
• 2003

오늘날의 무선 이동 통신의 발전은 상당한 발전을 이루고 있다. 이동 통신 분야의 한 분야가 Ad hoc 네트워크 분야일 것이다. Ad hoc 네트워크는 기존의 고정된 네트워크의 한계를 뛰어 넘는 네트워크이다. 본 논문에서는 Ad hoc 네트워크의 클러스터 기반에서의 인증에 대한 보안 프로토콜을 연구하였다. 클러스터 기반의 CBRP(Cluster Based Routing Protocol) 라우팅 프로토콜을 이용하여 클러스터끼리의 인증을 위한 CH(Cluster Head)에 대한 선출 과정에 대한 방법과 클러스터간의 인증을 위하여 CH(Cluster Head)간의 인증을 위한 방법을 제안하였다. 기존의 방법은 CH간의 신뢰성을 전제로 하여 작성하였다. 본 논문에서도 신뢰성을 위하여 MCH(Main Cluster Head)를 두어 CH간의 신뢰성을 보장함으로써 상호 클러스터간의 인증을 위한 프로토콜을 설계하였다. MCH에서의 CH에 대한 인증 프로토콜을 설계함으로써 클러스터간의 인증의 신뢰성을 높일 수 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.6
• /
• pp.1165-1170
• /
• 2022

In WSNs, a clustering algorithm groups sensor nodes on a unit called cluster and periodically selects a cluster head (CH) that acts as a communication relay on behalf of nodes in each cluster for the purpose of energy conservation and relay efficiency. Meanwhile, attack techniques also have emerged to intervene in the CH election process through compromised nodes (inside attackers) and have a fatal impact on network operation. However, existing countermeasures such as encryption key-based methods against outside attackers have a limitation to defend against such inside attackers. Therefore, we propose a statistical detection method that detects abnormal CH election behaviors occurs in a WSN cluster. We design two attack methods (Selfish and Greedy attacks) and our proposed defense method in WSNs with two clustering algorithms and conduct experiments to validate our proposed defense method works well against those attacks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.616-618
• /
• 2003

최근 급속하게 성장하고 있는 무선 이동 통신 분야중의 한 분야가 Ad hoc 네트워크 분야일 것이다. Ad hoc 네트워크는 기존의 고정된 네트워크의 한계를 뛰어 넘는 네트워크이다. 본 연구에서는 Ad hoc 네트워크의 클러스터 기반의 라우팅 프로토콜에서의 인증에 대한 프로토콜을 멀티 계층으로 설계하였다. CBRP(Cluster Based Routing Protocol)의 라우팅 프로토콜에서는 클러스터간의 인증을 위하여 CH(Cluster Head)간의 인증을 통하여 인증을 하게 된다. CH간의 신뢰성을 위하여 MCH(Main Cluster Head)를 두어 CH간의 신뢰성을 보장함으로써 상호 클러스터간의 인증을 위한 프로토콜을 설계하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.176-179
• /
• 2022

In this paper, we consider a sectorized wireless powered sensor network (WPSN), wherein sensor nodes are clustered based on sectors and transmit data to the cluster head (CH) using energy harvested from a hybrid access point. We construct a system model for this sectorized WPSN and find optimal coordinates of CH that maximize the achievable transmission rate of sensing data. To obtain the optimal CH with low overhead, we perform an asymptotic geometric analysis (GA). Simulation results show that the proposed GA-based CH selection method is close to the optimal performance exhibited by exhaustive search with a low feedback overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.67-77
• /
• 2007

In sensor networks, it is very important to refresh communication keys of sensors in a periodic or on-demand manner. To perform a dynamic key management efficiently, sensor networks usually employ cluster architecture and each CH (Cluster Head) is responsible for key management within its cluster. In cluster-based sensor networks, CHs are likely to be targets of capture attacks, and capture of CHs threatens the survival of network significantly. In this paper, we propose a periodical key refreshment scheme which counteracts against capture of CHs. First, the proposed scheme reduces the threat caused by compromise of CHs by forcing each CH to manage a small number of sensors and changing CH role nodes periodically. Second, the proposed scheme flings attackers into confusion by involving other nodes in a key establishment between BS (Base Station) and a CH. Our numerical analyses showed that the proposed scheme is more secure than other schemes and robust against compromise of CHs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.620-623
• /
• 2014

Network topology for communication between vehicles are quickly changing because vehicles have a special movement pattern, especially character which is quickly changed by velocity and situation of road. Because of these feature, it is not easy to apply reliable routing on VANET(Vehicular Ad-hoc Network). Clustering method is one of the alternatives which are suggested for overcoming weakness of routing algorithm. Clustering is the way to communicate and manage vehicles by binding them around cluster head. Therefore choosing certain cluster head among vehicles has a decisive effect on decreasing overhead in relevant clustering and determining stability and efficiency of the network. This paper introduces new cluster head selection algorithm using RSU(Road Side Unit) different from existing algorithms. We suggest a more stable and efficient algorithm which decides a priority of cluster head by calculating vehicles' velocity and distance through RSU than existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1237-1255
• /
• 2014

In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.7
• /
• pp.62-70
• /
• 2015

The energy of a sensor in a Wireless Sensor Network (WSN) puts a limit on the lifetime of the network. To prolong the lifetime, a clustering plan is used. Clustering technology gets its energy efficiency through reducing the number of communication occurrences between the sensors and the base station (BS). In the distributed clustering protocol, LEACH-like (Low Energy Adaptive Clustering Hierarchy - like), the number of sensor's cluster head (CH) roles is different depending on the sensor's residual energy, which prolongs the time at which half of nodes die (HNA) and network lifetime. The position of the CH in each cluster tends to be at the center of the side close to BS, which forces cluster members to consume more energy to send data to the CH. In this paper, a protocol, pseudo-LEACH, is proposed, in which a cluster with a CH placed at the center of the cluster is formed. The scheme used allows the network to consume less energy. As a result, the timing of the HNA is extended and the stable network period increases at about 10% as shown by the simulation using MATLAB.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.185-194
• /
• 2020

Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.