1. 西南财经大学经济信息工程学院,四川,成都,610074
2. 电子科技大学8010研究室,四川,成都,610054
3. 西南财经大学经济信息工程学院四川成都,610074
4. 电子科技大学8010研究室四川成都,610054
纸质出版:2007
移动端阅览
王征, 刘心松, 李美安. ADLE:一种Ad hoc网络分布式领导者选取算法[J]. 电子学报, 2007,35(11):2232-2235.
WANG Zheng, LIU Xin-song, LI Mei-an. ADLE:A Distributed Leader Election Algorithm of Ad hoc Networks[J]. Acta Electronica Sinica, 2007, 35(11): 2232-2235.
Ad hoc网络的动态拓扑结构和节点自组织给分布式算法的实现带来了诸多困难.Ad hoc网络分布式领导者选举算法:ADL.该算法基于广播机制
采用逻辑时戳保证消息的时序性
避免了节点饿死.同时
它通过缩小算法执行范围降低了消息复杂度
而且不需要节点了解系统中所有节点的信息
因而能够适应Ad hoc网络的动态拓扑结构和节点频繁出入.分析与仿真结果表明该算法具有较低的消息复杂度、小响应延迟和公平性.
Ad hoc networks posses dynamic topologies and self-organized nodes
which stunts the implement of distributed mutual exclusion algorithms.Aiming at the comparatively laggard level of the distributed mutual exclusion algorithms for Ad hoc networks
an adaptive algorithm for Ad hoc networks was presented as ADLE algorithm.Based on broadcast communication
the novel algorithm guaranteed the time sequence and prevents nodes from starvation by the logical timestamps.Furthermore
it decreased the message complexity and the delay complexity through restricting the algorithm executing ranges.And the nodes did not initially need knowledge of all the others in ADLE algorithm
which adapted it to the dynamic topology structures and the frequent node arrival/departure in Ad hoc networks.Analysis and simulation results show that it has lower message complexity
shorter response delay and better fairness than the traditional algorithms.
0
浏览量
857
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621