摘要
为了解决Ad hoc网络中的分布式一致性问题,在对其特性分析的基础上,提出了新的Ad hoc模型以及新的Ad hoc分布式一致性算法ADC(Ad hoc Distributed Consensus)。这种算法基于传统的令牌查询,使用广播在任意拓扑结构的网络中查找令牌,同时,该算法使用带有Lamport时戳的请求消息和动态队列。较之传统算法,它能够较好的适应Ad hoc网络中节点频繁出入的情况。仿真与分析结果表明:该算法具有较低的消息复杂度、较小的空间复杂度和较短的响应延迟。
In order to solve the problem of distributed consensus in Ad hoc networks, the properties of Ad hoc were analyzed and a novel Ad hoc system model was proposed. Then a novel Ad hoc Distributed Consensus algorithm was put forward as ADC. Based on traditional token-asking algorithms, ADC utilizes broadcast to search the token in arbitrary topology networks, and emploies the request message with Lamport＇s timestamps and dynamic queues. Compared with traditional algorithms, ADC adapts itself to the frequent arrival/departures of nodes in Ad hoc networks. Simulation and analysis results showed that the ADC algorithm has low message complexity, small space complexity and short response delay.
出处
《四川大学学报（工程科学版）》
EI
CAS
CSCD
北大核心
2006年第2期125-131,共7页
Journal of Sichuan University (Engineering Science Edition)
基金
四川省应用基础研究项目(04JY029-017-2)
科技型中小企业技术创新基金资助项目(04C26225110223)
