终端协同过程的中心节点自举算法研究

摘要

针对中心节点自举过程中时钟非同步及通信约束问题，对异步自举算法和一致性自举算法进行了研究。首先证明了异步自举算法选举所产生中心节点的唯一性。接着讨论了自举愿望较弱的节点被选为中心节点的条件。最后考虑通信约束问题，提出了一致性收敛的条件，并讨论了收敛时间的上界。仿真结果验证了双节点之间异步自举算法产生中心节点的唯一性和多Agent一致性自举算法的收敛性。%In accordance with the issues in central node bootstrap, i. e. , clock non-synchronization and communication constraints, the asynchronous bootstrap algorithm and consistency bootstrap algorithm are researched. The uniqueness of the central node that elected by asynchronous bootstrap algorithm is proved firstly. Then the condition under which the terminal with less desire of to be elected as the central node is discussed. Considering the communication constraints, the prerequisite of consistency convergence is proposed, and the upper boundary of the convergence time is discussed finally. The results of simulation verify the uniqueness of the central node produced by asynchronous bootstrap algorithm between two nodes, and the convergence of multi-Agent consistency bootstrap algorithm.