基于选举委员会的领导者选举算法  

Leader election algorithm based on election commission

作　　者：徐旭东 李英玉 XU Xudong;LI Yingyu(National Space Science Center,Chinese Academy of Sciences,Beijing 100190,China;University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院国家空间科学中心,北京100190 [2]中国科学院大学,北京100049

出　　处：《传感器与微系统》2022年第1期138-141,共4页Transducer and Microsystem Technologies

基　　金：中国科学院重点部署项目(ZDRW-KT-2016-02)。

摘　　要：由于Bully算法在选举领导者的过程中需要产生大量的消息和花费大量的时间,不适应低轨卫星网络高动态、大延迟的网络环境。针对上述问题,提出了基于选举委员会的低轨卫星网络领导者选举算法。在选举阶段,节点直接向选举委员会发送选举消息,选举委员会在验证领导者崩溃后,选出具有最高优先级的节点担任领导者。试验结果表明:改进算法有效地降低了消息量,减少了领导者选举时间,能更好地应用于低轨卫星网络。Because the Bully algorithm needs to generate a lot of messages and spend a large amount of time in the process of electing leaders,it is not suitable for high-dynamic and large-delay network environment of low-orbit satellite networks.Amining at the above problems,an election algorithm for low-orbit satellite network leaders based on election commission is proposed.In election phase,the nodes directly send election messages to the election commission.After the election commission verifies that the leader has crashed,it selects the node with the highest priority as the leader.The test results show that the improved algorithm effectively reduce size of messages and the leader election time,and can be better applied to low-orbit satellite networks.

关 键 词：低轨卫星网络 分布式系统 选举算法 领导者 选举委员 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]