• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.224-227
• /
• 2012

In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.167-176
• /
• 2009

Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. So, we propose the modified cluster selection protocol method that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady-state phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.289-296
• /
• 2001

The Election protocol can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. Mobile systems are more prone to failures than conventional distributed system. Solving election in such an environment requires from a set of mobile hosts to choose a mobile host or a fixed host based on the their priority despite failures of both mobile computing and/or fixed hosts. In this paper, we describe a solution to the election problem from mobile computing systems. This solution is based on the Garcia Molina\\`s Bully algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.831-834
• /
• 2011

LEACH(One of the leading algorithms in the field of WSN) for the life of the system, even by the number of all nodes to ensure that the cluster header. However, each round does not guarantee a certain number of cluster header. So sometimes cluster header is elected of small number or not elected. If cluster header number is to small, takes a heavy load on cluster header. And empty cluster is occur depending on the location of the cluster header. The algorithm proposed in this paper, the area of interest is divided into sectors. And randomly, cluster header be elected one the in each sector. When clustering the sensor nodes will belong to the nearest cluster header. So clustering is independent of the sector. This algorithm is guarantee a certain number of cluster header in each round. And has prevent occurrence of empty cluster.

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

• The Monthly Technology and Standards
• /
• s.117
• /
• pp.4-7
• /
• 2011

우리나라가 국제표준화기구(ISO) 기술관리이사회(TMB)에 재진출했다. 3년 임기가 만료되는 선출직 다섯 자리를 놓고 열한 개 국가가 경합을 벌인 가운데, 중국, 브라질, 인도네시아, 남아프리카공화국과 함께 이사국으로 선출된 것이다. ISO TMB 재진출의 가장 중요한 의의는 모든 국가와 국민들의 이익에 보탬이 되도록 기존 표준 선진국들의 표준화활동을 감시하고 견제하는 것이다.

• KOREAN POULTRY JOURNAL
• /
• v.45 no.6
• /
• pp.96-97
• /
• 2013

계란자조금관리위원회(위원장 안영기)는 지난 6일 대전에서 2013년 제2차 대의원회의를 개최하고 임원진 선출을 마쳤다. 이날 제3대 계란자조금관리위원장에 안영기 현 위원장이 만장일치 재추대 됐으며 대의원회 의장, 부의장, 감사, 관리위원을 선출했다. 한편, 관리위원장과 대의원회 의장, 부의장, 감사는 각각 2년의 임기를 수행하며 관리위원은 4년간의 임기를 수행하게 된다.

• 프린팅코리아
• /
• v.14 no.3
• /
• pp.53-53
• /
• 2014

한국제책공업협동조합은 지난 2월 21일 일산 킨텍스 306호 세미나실에서 제41차 정기총회를 개최했다. 이번 정기총회에서는 김재복 20대 이사장이 지난 2013년말부로 자리를 물러남에 따라 신임 이사장 선출이 이뤄 졌으며, 이상훈 아이앤북 대표가 제21대 이사장으로 선출됐다.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.254-262
• /
• 1994

Most of traditional approaches to leader election have been based on a node ID number. As performances were not considered in these approaches, they were not very practical. So there has been a study on leader election strategies based on performances. This paper proposes new preference based on performances. While link failures occur during the election period, the elected leader's performance may not be the expected one. We simulate these effects of link failures on the robustness at election stragies. In particular, we tried in this study to find the best of the distributed election strategies based on the bidirectional preference from the standpoint of the robustness through simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.169-175
• /
• 2002

This paper is about the hardness of the Election problem in asynchronous distributed systems in which processes can crash but links are reliable. The hardness of the problem is defined with respect to the difficulty to solve it despite failures. It is shown that problems encountered in the system are classified as three classes of problems: F (fault-tolerant), NF (Not fault-tolerant) and NFC(NF-completeness). Among those, the class NFC is the hardest problems to solve. In this paper, we prove that the Election problem is the most difficult problem which belongs to the class NFC.