检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张超[1] 庄奕琪[1] 李振荣[1] 靳钊[1] 刘伟峰[1]
机构地区:[1]西安电子科技大学微电子学院,陕西西安710071
出 处:《西安电子科技大学学报》2011年第2期54-60,共7页Journal of Xidian University
基 金:国家自然科学基金资助项目(60676053)
摘 要:为了改善基于蓝牙的无线个人区域网(WPAN)的吞吐量建立了其网络模型,并使用混沌算法对其改进,以进一步提升吞吐量性能.建立了WPAN网络模型和数据碰撞模型,以数据碰撞造成数据重发为基础,推导得到WPAN数据吞吐量公式,证明了WPAN中蓝牙微微网的数量和所采用跳频序列汉明互相关性决定了其吞吐量;设计了新的基于Chebyshev映射的混沌跳频算法,相对于蓝牙跳频算法其具有更好的汉明互相关性能,能提高WPAN的数据吞吐量.进行计算机仿真,并使用ARM1510片上系统(SoC)平台+nRF2401射频芯片组成WPAN对新算法进行实际测试.仿真和测试结果表明,新的混沌算法能将WPAN的最大吞吐量提升几乎1倍,或者说在同等吞吐量条件下,WPAN中可容纳的微微网数量增加了1倍.To improve the Bluetooth-based WPAN(Wireless Personal Area Network) throughput,the system models were built,and the chaotic algorithm was designed to improve the WPAN throughput.The system models includes the WPAN network model and the data collision model.The data collision crushes the data packet and makes the data resending,and then the function of WPAN data throughput is deduced with the aforementioned conclusion.It can be proved that the number of piconets and the hamming correlation ability of the FH(Frequency Hopping) algorithm decide the WPAN throughput.The new chaotic FH algorithm based on the Chebyshev map was built.It has a better hamming correlation ability than the Bluetooth FH algorithm and can improve the WPAN throughput.The computational simulation and actual test were done.The test used the ARM1510 SoC(System on Chip)+nRF2401 radio chip to build the WPAN.Simulation and test results prove that the new chaotic FH algorithm can increase the WPAN maximum throughput about twice,in other words it can improve the number of piconets in the WPAN about twice with the same throughput.
分 类 号:TN914.4[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63