摘要
提出了一种将IEEE 802.11定时同步功能TSF和令牌轮询模式相结合的Ad hoc网络定时同步算法.网络定时同步随着节点数量的变化在这2种模式之间切换,有效地解决了IEEE 802.11 Ad hoc网络定时同步功能TSF存在的可扩展性问题.仿真表明,通过设置合适的门限值,在不同的Ad hoc网络规模下,算法具有很好的定时同步性能.
Combined timing synchronization function (TSF) and token polling model, a new Ad hoc networks timing synchronization algorithm was proposed. The proposed algorithm can be switched smoothly between TSF and token polling model according to the number of nodes in Ad hoc networks. The problem of scalability in IEEE 802.11 TSF can be effectively resolved by this algorithm. Simulation results show that the proposed algorithm can achieve the predominant performance of timing synchronization in variable scale Ad hoc networks when the threshold is set appropriately.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2006年第1期104-107,共4页
Journal of Beijing University of Posts and Telecommunications