首页 | 官方网站   微博 | 高级检索  
     

一种可扩展的IEEE 802.11 Ad Hoc网络定时同步算法
引用本文:吴克军,于全,田艳霞. 一种可扩展的IEEE 802.11 Ad Hoc网络定时同步算法[J]. 北京邮电大学学报, 2006, 29(1): 104-107
作者姓名:吴克军  于全  田艳霞
作者单位:解放军理工大学,通信工程学院,南京,210007;总参第61研究所,北京,100039;总参通信部,军事代表局,北京,210007
摘    要:提出了一种将IEEE 802.11定时同步功能TSF和令牌轮询模式相结合的Ad hoc网络定时同步算法. 网络定时同步随着节点数量的变化在这2种模式之间切换,有效地解决了IEEE 802.11 Ad hoc网络定时同步功能TSF存在的可扩展性问题. 仿真表明,通过设置合适的门限值,在不同的Ad hoc网络规模下,算法具有很好的定时同步性能.

关 键 词:IEEE 802.11 Ad hoc网络  可扩展性  定时同步功能  令牌轮询
文章编号:1007-5321(2006)01-0104-04
收稿时间:2004-12-28
修稿时间:2004-12-28

A Scalable Network Timing Synchronization Algorithm in IEEE 802.11 Ad Hoc Networks
WU Ke-jun,YU Quan,TIAN Yan-xia. A Scalable Network Timing Synchronization Algorithm in IEEE 802.11 Ad Hoc Networks[J]. Journal of Beijing University of Posts and Telecommunications, 2006, 29(1): 104-107
Authors:WU Ke-jun  YU Quan  TIAN Yan-xia
Affiliation:1.Institute of Communication Engineering, People''s Liberation Army University of Science and Technology, Nanjing 210007, China
2.The 61st Research Institute of General Staff Headquarters, Beijing 100039, China
3.Military Representative Bureau of Communication Department of General Staff Headquarters, Beijing 100016, China
Abstract: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.
Keywords:IEEE 802.11 Ad hoc networks   scalability   time synchronization function   token polling
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号