摘要
提出动态地址分配算法,通过新的地址偏移计算方法,解决了ZigBee网络地址分配深度动态拓展的问题;并采用向兄弟节点借地址的策略,解决了父节点地址枯竭时的地址分配问题,且可保持对树状路由的支持。通过在NS2上进行仿真测试,证明新算法在入网成功率、通信开销等指标上均有明显的优势。
A Dynamic Address Configuration( DAC) algorithm was proposed, which adopted a new address calculation formula to solve the dynamic depth expansion problem of ZigBee network, and used the scheme of borrowing address from the brother nodes to solve the address assignment problem in the case of address depletion of the parent nodes. In addition, it supported tree routing just like the original algorithm. The simulation and test on Network Simulator 2( NS2) proves that the new algorithm is good at the indicators of networking success rate, and communication cost.
出处
《计算机应用》
CSCD
北大核心
2014年第A02期11-15,共5页
journal of Computer Applications
基金
国家自然科学基金资助项目(61172025)
广东省科技厅科技计划项目(2010B090400153)
广东省自然科学基金资助项目(S2011010001492)