摘要
提出基于分段的按需可扩展地址分配算法,按照预设的地址量对16bit地址空间进行分段,当路由节点子地址空间不足时对其逐段扩展,使更多节点获得地址;同时改进现有树路由协议使之能够兼容扩展的地址。理论和仿真分析表明所提算法的地址分配成功率等性能优于DAAM和它的改进方案SLAR。
Segmentation-based on-demand scalable address assignment algorithm was proposed, which segmented the 16bit address space according to a value predefined by DAAM. When a router lacks addresses, it extended its address space to a new segment. Thus, more addresses could be attained and assigned to children. Meanwhile, the present tree routing protocol was improved to suit the extended addresses. Theoretical and simulation analysis show that our algorithm outperforms DAAM and one of its present improvements in terms of the success rate of address assignment, communication overhead, etc.
出处
《通信学报》
EI
CSCD
北大核心
2012年第5期131-137,共7页
Journal on Communications
基金
国家自然科学基金资助项目(60972068)
教育部留学回国人员科研启动基金资助项目(2010-1561)
重庆市自然科学基金资助项目(2009BB2085)
重庆市教委科研基金资助项目(KJ090524)~~
关键词
无线传感器网络
ZIGBEE标准
地址分配
算法
分段
wireless sensor networks
ZigBee specification
address assignment
algorithms
segmentation
