LRST: searching tree anti-collision algorithm with low-redundancy
Academic paper|更新时间:2024-06-05
|
LRST: searching tree anti-collision algorithm with low-redundancy
Journal on CommunicationsVol. 35, Issue 6, Pages: 110-115(2014)
作者机构:
1. 重庆邮电大学 移动通信技术重点实验室,重庆400065
2. 北京科技大学 先进网络技术与新业务研究所,北京100083
作者简介:
基金信息:
The National Basic Research Program of China (973 Program)(2012CB315905);The National Natural Science Foundation of China(61171111);The National Natural Science Foundation of China(61102063);The Program for Changjiang Scholars and Innovative Research Team in University(IRT1299);The Special Fund of Chongqing Key Laboratory
Qiong HUANG, Jiang-tao LING, Min ZHANG, et al. LRST: searching tree anti-collision algorithm with low-redundancy[J]. Journal on Communications, 2014, 35(6): 110-115.
DOI:
Qiong HUANG, Jiang-tao LING, Min ZHANG, et al. LRST: searching tree anti-collision algorithm with low-redundancy[J]. Journal on Communications, 2014, 35(6): 110-115. DOI: 10.3969/j.issn.1000-436x.2014.06.014.
LRST: searching tree anti-collision algorithm with low-redundancy