摘要
针对节点数较多的紫外光固定拓扑网络,设计了一种基于时分多址接入(Time Division m Multiple Access,TDMA)技术的紫外光帧结构,结合紫外光大气传输特性提出了一种紫外光定向邻居发现算法。仿真对比了该算法和传统算法的性能,并对该算法不同退避延时下的节点发现效率进行了理论分析和仿真验证。
A ultraviolet （UV） frame structure based on time division multiple access （TDMA） is designed aim- ing at UV fixed topology network with many nodes, and a UV directional neighbour discovery algorithm is proposed by UV atmospheric transmission characteristics. The performances of the new algorithm and traditional algorithm are compared by simulations, then under different backoff delays, neighbour discovery efficiency of the proposed algorithm is theoretically analyzed.
出处
《光通信技术》
北大核心
2015年第5期40-43,共4页
Optical Communication Technology
基金
国家自然科学基金(61002034)资助
重庆市自然科学基金(cstc2012jj A40033
cstc2014jcyj A40050)资助
关键词
光通信
紫外光
节点冲突
时分多址接入(TDMA)
邻居发现
optical communication, ultraviolet （UV）, node conflict, time division multiple access（TDMA）, neighbour discovery
