Research on RFID anti-collision hybrid algorithm based on discrete processing
A kind of binary tree search algorithms have distinct application limitations such as high number of requests in case that a fairly large number of tags are available.A hybrid anti-collision algorithm was proposed,combining binary tree search with discrete processing.Theoretic analysis show that,dif...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.08.002/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A kind of binary tree search algorithms have distinct application limitations such as high number of requests in case that a fairly large number of tags are available.A hybrid anti-collision algorithm was proposed,combining binary tree search with discrete processing.Theoretic analysis show that,different from available schemes,the algorithm essentially performs binary tree search not on a single tag,but on models which identify the property of discrete procession.The proposed algorithm fully takes the time of request into account,as well as power consumption and throughput of the system.Simulation result verifies that the algorithm achieves much better performances such as the time of request and throughput than the previous algorithms. |
|---|---|
| ISSN: | 1000-436X |