自适应二叉树电调天线设备扫描算法研究

doi:10.3969/j.issn.1000-0801.2011.05.012

Abstract

Abstract:

Firstly,an ALD scanning algorithm based on binary-tree,which uses a collision queue to resolve the collision occurred during the scanning process and generate new search code string,is put forward according to the feature of AISG communication.Then an adaptive binary-tree ALD scanning algorithm is proposed on the basis of the characteristics of the binary scanning tree.The algorithm can skip some of the collision nodes in the light of the prior scanning results and enhance scanning efficiency.The adaptive binary-tree scanning algorithm was adopted in our RET control system,and the practice shows that the algorithm has better adaptability and can scan various ALD devices from different vendors quickly and accurately.

Key words: RET control system, AISG protocol, ALD scanning, adaptive binary-tree, collision queue

Wensheng Li,Chunjian Deng,Yi Lv,Renze Luo. Adaptive Binary-Tree ALD Scanning Algorithm[J]. Telecommunications Science, 2011, 27(5): 48-53.

Figures/Tables 5

References 12

1	Antenna Interface Standards Group Standard NO.AISG V2.0. Control interface for antenna line devices, , 2006
2	3GPP TS 25.460 V6.2.0.UTRAN iuant interface:general aspects and principles, , 2005
3	3GPP TS 25.461 V6.5.0. UTRAN iuant interface:layer 1, , 2005
4	3GPP TS 25.462 V6.3.0. UTRAN iuant interface:signalling transport, , 2005
5	3GPP TS 25.463 V6.4.0. UTRAN iuant interface:remote electrical tilting （RET）antennas application part（RETAP） signalling, ,2005
6	3GPP TS 25.466 V7.1.0. UTRAN iuant interface:application part, ,2007
7	Jihoon Myung , Wonjun Lee . Adaptive binary splitting:a RFID tag collision arbitration protocol for tag identification. Mobile Networks and Applications, 2006(11):711～722
8	YongHwan Kim , SungSoo Kim , SeongJoon Lee , et al. An anti-collision algorithm without idle cycle using 4-ary tree in RFID system.In: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication Table of Contents, New York,NY,USA, 2006
9	Yonghwan Kim , Sungsoo Kim , Seongjoon Lee , et al. Improved 4-ary query tree algorithm for anti-collision in RFID system.In: 2009 International Conference on Advanced Information Networking and Applications, 2009
10	Massey J L . Collision-resolution algorithms and random-access communications. Multi-User CommunicationSystems, 1981
11	Mathys P , Flajolet P . Q-ary collision resolution algorithms in random access systems with free or blocked channel access. IEEE Transactions on Information Theory, 1985,31（2）:217～243
12	Jiho Ryu , Hojin Lee , Yongho Seok , et al. A hybrid query tree protocol for tag collision arbitration in RFID systems.In: IEEE International Conference on Communications, 2007

Metrics

Recommended 0

No Suggested Reading articles found!

步骤	匹配码串	掩码串	ALD回应	冲突队列元素
0				（ε,ε）
1	ε	ε	冲突	（0,1）、（1,1）
2	0	1	冲突	（1,1）、（00,11）、（10,11）
3	1	1	冲突	（00,11）、（10,11）、（01,11）、（11,11）
4	00	11	空闲	（10,11）、（01,11）、（11,11）
5	10	11	冲突	（01,11）、（11,11）、（010,111）、（110,111）
6	01	11	空闲	（11,11）、（010,111）、（110,111）
7	11	11	冲突	（010,111）、（110,111）、（011,111）、（111,111）
8	010	111	010（可读）	（110,111）、（011,111）、（111,111）
9	110	111	110（可读）	（011,111）、（111,111）
10	011	111	011（可读）	（111,111）
11	111	111	111（可读）	队列为空，扫描结束

步骤	匹配码串	掩码串	ALD回应	冲突队列
0				（ε,ε）
1	ε	ε	冲突	（0,1）、（1,1）
2	0	1	冲突	（1,1）、（00,11）、（10,11）
3	1	1	冲突	（00,11）、（10,11）、（01,11）、（11,11）
4	00	11	空闲	（01,11）、（11,11）、（010,111）、（110,111）
5	01	11	空闲	（010,111）、（110,111）、（011,111）、（111,111）
6	010	111	010（可读）	（110,111）、（011,111）、（111,111）
7	110	111	110（可读）	（011,111）、（111,111）
8	011	111	011（可读）	（111,111）
9	111	111	111（可读）	队列为空，扫描结束

Adaptive Binary-Tree ALD Scanning Algorithm

RichHTML

PDF下载

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 5

References 12

Related Articles 0

Metrics

Recommended 0