Efficient leader election in complete networks

被引：11
|
作者：
Villadangos, J [1 ]
Córdoba, A [1 ]
Fariña, F [1 ]
Prieto, M [1 ]
机构：
[1] Univ Publ Navarra, Dept Matemat & Informat, Pamplona 31006, Spain
来源：
13TH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS | 2005年
关键词：
leader election; complete networks; distributed algorithms; I/O automata;
D O I：
10.1109/EMPDP.2005.21
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Leader election is a fundamental problem in distributed computing and it has been studied assuming various computation models and network topologies. This paper analyzes the algorithms for leader election in complete networks using asynchronous communication channels. We present a novel algorithm that reduces the information necessary to select a leader compared with other leader election algorithms for complete networks. In this paper, the algorithm works without sense of direction. And, it does not require to know the number of nodes in the system. Our proposal requires O(n) messages and O(n) time, where n is the number of nodes in the system, to elect a leader.
引用
收藏
页码：136 / 143
页数：8
相关论文
共 50 条
  • [1] Leader election in complete networks
    Singh, G
    [J]. SIAM JOURNAL ON COMPUTING, 1997, 26 (03) : 772 - 785
  • [2] Leader Election in Extremely Unreliable Rings and Complete Networks
    Dobrev, Stefan
    Kralovic, Rastislav
    Pardubska, Dana
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, 12TH INTERNATIONAL CONFERENCE, OPODIS 2008, 2008, 5401 : 512 - +
  • [3] A modified O(n) leader election algorithm for complete networks
    Castillo, Maria
    Farina, Federico
    Cordoba, Alberto
    Villadangos, Jesus
    [J]. 15TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2007, : 189 - +
  • [4] An efficient leader election algorithm for mobile ad hoc networks
    Parvathipuram, P
    Kumar, V
    Yang, GC
    [J]. DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, PROCEEDINGS, 2004, 3347 : 32 - 41
  • [5] Leader Election in Opportunistic Networks
    Dragan, Radu
    Ciobanu, Radu-Ioan
    Dobre, Ciprian
    [J]. 2017 16TH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING (ISPDC-2017), 2017, : 157 - 164
  • [6] Leader election in synchronous networks
    Ivanyi, Antal
    [J]. ACTA UNIVERSITATIS SAPIENTIAE-MATHEMATICA, 2013, 5 (01) : 54 - 82
  • [7] LEADMesh: Design and analysis of an efficient leader election protocol for wireless mesh networks
    Almulla, M.
    Abrougui, K.
    Boukerche, A.
    [J]. SIMULATION MODELLING PRACTICE AND THEORY, 2013, 36 : 22 - 32
  • [8] Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
    Sayeed, HM
    AbuAmara, M
    AbuAmara, H
    [J]. DISTRIBUTED COMPUTING, 1995, 9 (03) : 147 - 156
  • [9] A New Dominating Tree Routing Algorithm for Efficient Leader Election in IoT Networks
    Bounceur, Ahcene
    Bezoui, Madani
    Lounis, Massinissa
    Euler, Reinhardt
    Teodorov, Ciprian
    [J]. 2018 15TH IEEE ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC), 2018,
  • [10] An Energy-Efficient Leader Election Mechanism for Wireless Body Area Networks
    Zhang, Rongrong
    Moungla, Hassine
    Mehaoua, Ahmed
    [J]. 2014 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2014), 2014, : 2411 - 2416
12345