摘要
Ad hoc网络的动态拓扑结构和节点自组织给分布式算法的实现带来了诸多困难.Ad hoc网络分布式领导者选取算法:ADL.该算法基于广播机制,采用逻辑时戳保证消息的时序性,避免了节点饿死.同时,它通过缩小算法执行范围降低了消息复杂度,而且不需要节点了解系统中所有节点的信息,因而能够适应Ad hoc网络的动态拓扑结构和节点频繁出入.分析与仿真结果表明该算法具有较低的消息复杂度、小响应延迟和公平性.
Ad hoc networks posses dynamic topologies and serf-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.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2007年第11期2232-2235,共4页
Acta Electronica Sinica
作者简介
王征 男，1979年生，2007年毕业于电子科技大学，博士，现为西南财经大学经济信息工程学院教师．主要研究方向为分布式算法等．E-mail：wangzheng151400@163．com
刘心松 男，1940年生，教授，博士生导师．主要研究方向为分布式并行等．
李美安 男，1973年生，博士生．主要研究方向为宽带网络．
