Fast Anti-Collision Algorithm in Ubiquitous ID System 


Vol. 29,  No. 8, pp. 942-949, Aug.  2004


PDF
  Abstract

This paper proposes and analyzes the anti-collision algorithm in Ubiquitous ID system We mathematically compares the performance of the proposed algorithm with that of binary search algorithm, slotted binary tree aigorithm using time slot, and blt-by-blt binaiy tree algorithm proposed by Auto-ID center We also validated analytic iesults using OPNET simulation Ba.s.ed on the analytic results, comparing the proposed algorithm with blt-by-blt algorithm which is the best of existing algorithms, the performancc of proposed algorithm is about 5% higher which the number at tags is 20, and 100% higher when the number of tags is 200

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Cha and J. Kim, "Fast Anti-Collision Algorithm in Ubiquitous ID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 8, pp. 942-949, 2004. DOI: .

[ACM Style]

Jae-Ryong Cha and Jae-Hyun Kim. 2004. Fast Anti-Collision Algorithm in Ubiquitous ID System. The Journal of Korean Institute of Communications and Information Sciences, 29, 8, (2004), 942-949. DOI: .

[KICS Style]

Jae-Ryong Cha and Jae-Hyun Kim, "Fast Anti-Collision Algorithm in Ubiquitous ID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 8, pp. 942-949, 8. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880