摘要
对IISLE算法进行了分析,IISLE算法的时间复杂度为O(n),针对无线网络环境的高断接概率,改进了IISLE算法,提出了一种适用于无线网络的改进自稳定领导者选举算法(ISLEABWN).该算法结合移动主机断接概率模型,修改了IISLE算法的树扩展机制.仿真实验结果发现:改进的算法在无线网络环境下具有良好的性能.
This paper analyses IISLE algorithm,and finds out that IISLE algorithm time complexity is O（ n）. According to the high disconnection probability of wireless network environment,this paper improves IISLE algorithms,and gives an improved self-stabilizing leader election algorithm based on wireless network（ ISLEABWN）. Combined with the mobile host disconnection probability model,ISLEABWN algorithm modifies the tree expanding mechanism. The emulation experiment results show that the improved algorithm has good performance in wireless network environment.
出处
《中南民族大学学报（自然科学版）》
CAS
北大核心
2015年第1期108-110,共3页
Journal of South-Central University for Nationalities：Natural Science Edition
基金
国家民委科研基金资助项目(CMZY13010)
关键词
自稳定领导者选举算法
无线网络
概率模型
self-stabilizing leader election algorithm
wireless network
probability model
