• Journal of the Korea Convergence Society
• /
• v.11 no.6
• /
• pp.227-235
• /
• 2020

This study expanded the superiority of random leader selection procedure on group decision-making task to actual group performance task, and examined the interaction effects of leader selection procedure(LSP) and collective efficacy(CE) on group performance. 2(LSP: formal/random)×2(CE: low/high) between subject design was used. The result revealed the significant main effect of LSP, which showed that groups with random leader performed better than those with formally selected leader. Further, significant interaction effect of LSP and CE revealed that when group's CE was high, group with random leader performed better than group with formally selected leader, and the difference between two groups was not significant when group's CE was low. These results suggested that LSP should not impair shared social identity of the group in order to maintain the positive effect of CE on group performance. The necessity for expanding these results to work team was discussed.

• The Mathematical Education
• /
• v.33 no.1
• /
• pp.75-82
• /
• 1994

리더를 선출하는 기존의 선거 전략은 노드의 성능을 고려하지 않아서 양질의 리더를 선출할 수 없다. 이러한 문제점을 해결하기 위하여 성능을 고려하여 리더를 선출하는 방안에 대한 연구가 진행 되고 있다. 본 논문에서는 성능을 양방향 지연값을 선호도로 할 때, 선거전략중 다수결 선거 전략을 확률론적으로 분석하였다.

• The Journal of the Korea Contents Association
• /
• v.14 no.7
• /
• pp.242-252
• /
• 2014

This research examined whether there are differences in group decision making between senior leader groups and junior leader groups. Results revealed that senior leaders contributed more during the discussion than junior leaders, and groups with senior leaders performed better than the groups with junior leaders. In post-discussion activities group members noted that senior leaders were able to represent their groups better, and showed better leadership during discussion. On the other hand, the leader's age impacted differently depending on leader selection methods. For senior leaders, leaders randomly assigned were perceived to be more beneficial to groups. However for junior leaders, leaders systematically selected were perceived to represent their groups better and exhibit better leadership. The interaction between leader's age and leader selection seems to arise from a difference of leader's power bases.

• 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 Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm 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, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.35-40
• /
• 2003

In this paper, I raise an issue regarding the relationships between the Election problem and the Consensus problem in asynchronous systems with unreliable failure detectors. First, I describe our system model, and then define Leader Election. After then, I show that the Election problem is harder to resolve than the Consensus problem. Each correct process eventually gets into the state in which it considers only one process to be a leader. Therefore a Perfect Failure Detector is the weakest failure detector which is sufficient to solve the Election. In order to show that the Election problem is harder to resolve than the Consensus problem, I utilize the Reduction protocol in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1027-1037
• /
• 1994

While the value of unidirectional delay was used as the preference of a node in the previous research on the performance of the leader, this paper proposes the value of bidirectional delay as a preference of a node and analyzies election strategies in the case of the various number of candidates through simulation. We made a comparative study to evaluate the quality of leaders chosen by the bidirectional preference and unidirectional preference in terms of relative error and from the standpoint of the probability of choosing the optimal leader.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.25-27
• /
• 2004

시스템이 대형화가 되어가고 네트워크 환경이 발전함에 따라 분산 환경이 점점 더 증대되어 가고 있다. 이러한 분산 환경에서 사용되는 리더 선출 알고리즘(Leader Election Algorithm)은 다양하게 제시되었고 본 논문에서는 Garcia-Molina가 제시한 Bully 알고리즘을 프로세스 알제브라 언어인 CSP로 명세하고 FDR 모델체킹 도구를 이용해 해당 요구사항을 만족하는지 검증하였다.

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

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.53-62
• /
• 2008

The Election paradigm 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 ad hoc computing environment. Mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems. This solution is based on the Group Membership Detection algorithm.