• 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.

• 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.9 no.12
• /
• pp.1542-1551
• /
• 2006

In the Grid Database, some replicas will have more requests from the clients than others. A fast consistency algorithm has been presented to satisfy the high demand nodes in a shorter period of time. But it has poor performance in multiple regions of high demand for forming the island of locally consistent replicas. Then, a leader election method is proposed, whereas it needs much additional cost for periodic leader election, information storage, and message passing, Also, false leader can be created. In this paper, we propose a tree-based algorithm for replica update propagation. Leader replicas with high demand are considered as the roots of trees which are interconnected. All the other replicas are sorted and considered as nodes of the trees. Once an update occurs at any replica, it need be transmitted to the leader replicas first. Every node that receives the update propagates it to its children in the tree. The update propagation is optimized by cost reduction for fixed propagation schedule. And it is also flexible for the dynamic model in which the demand conditions change with time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.527-530
• /
• 2010

WSN is composed of a lot of small sensors with the limited hardware resources. 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.56-58
• /
• 2000

분산 프로세스 그룹 내의 프로세스들 중에서 조정자를 결정하는 것을 선출(election)한다고 하며 분산 시스템이 가동되면서 최초로 정해져야 할 경우, 또는 조정자 프로세스에 장애가 생겨서 새로운 조정자가 필요할 경우에 선출 알고리즘이 수행된다. 본 연구팀은 고속 조정자 선출 알고리즘을 제안한 바 있는데, 이 알고리즘의 검증 시험, 성능 평가를 수행하기 위해서 COVERS라는 시뮬레이션 툴을 사용하여 분산 네트워크 환경을 구성한 뒤 이 위에 다수 프로세스에 선출 알고리즘을 구현하고 각종 장애 상황을 발생시켜 시험하였다. 본 논문에서는 범용 시뮬레이션 툴인 COVERS를 간단히 설명하고, 이 위에 모델링한 분산 네트워크 환경, 그리고 선출 알고리즘 구현에 대해서 설명하고, 성능 분석결과를 제시한다.

• International Journal of Contents
• /
• v.8 no.4
• /
• pp.1-6
• /
• 2012

Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In this paper, we propose the new algorithm which is modified from Garg's algorithm[1] thus works properly in a fault-tolerant system. In our algorithm, after electing the token generator, the elected process generates a new token based on the information of the myreqlist which is kept by every process and the reqdone which is received during election. Consequently, proposed algorithm tolerates any number of process failures and also does even when only one process is alive.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.587-598
• /
• 2016

In predicting an outcome of election using a variety of methods ahead of the election, non-response is one of the major issues. Therefore, to address the non-response issue, a variety of methods of non-response imputation may be employed, but the result of forecasting tend to vary according to methods. In this study, in order to improve electoral forecasts, we studied a model based method of non-response imputation attempting to apply the Monte Carlo Expectation Maximization (MCEM) algorithm, introduced by Wei and Tanner (1990). The MCEM algorithm using maximum likelihood estimates (MLEs) is applied to solve the boundary solution problem under the non-ignorable non-response mechanism. We performed the simulation studies to compare estimation performance among MCEM, maximum likelihood estimation, and Bayesian estimation method. The results of simulation studies showed that MCEM method can be a reasonable candidate for non-response model estimation. We also applied MCEM method to the Korean presidential election exit poll data of 2012 and investigated prediction performance using modified within precinct error (MWPE) criterion (Bautista et al., 2007).

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.388-390
• /
• 2002

블루투스(Bluetooth) 스캐터넷(Scatternet)은 2개 이상의 피코넷(Piconet)을 연결함으로 구성되는 애드혹(ad hoc)네트웍이다. 피코넷은 하나의 마스터(Master)노드와 다수의 슬레이브(Slave)노드로 구성되는데 이때 마스터 노드는 슬레이브노드에 비해서 더 큰 파워를 소모하게 된다. 따라서 파워를 고려하러 블루투스 피코넷의 마스터를 선출한다면 피코넷의 수명을 늘릴 수 있을 뿐 아니라 전체 스캐터넷의 수명을 늘릴 수 있게 된다. 따라서 본 논문에서는 파워를 고려한 피코넷 마스터 선출 알고리즘을 제안하고 더 나아가서 망이 한번 구성된 이후에도 파워를 고려해서 마스터를 재선출할 것을 제안한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4543-4552
• /
• 2010

A leader is a special process who roles as the coordinator within multiple processes of a group. In a distributed system, leader election is the procedure of electing a coordinator. This is a very important issue for building fault-tolerant distributed systems. When two normal mobile ad hoc networks are merged, there are two leaders. This violates the safety property, so a mechanism to detect and handle are required. In mobile ad hoc distributed computing system, we propose a leader competition protocol and to prove the temporal logic to it. This solution is based on the group membership detection algorithm.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.17-32
• /
• 2023

Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.