EMQT：A Study on Enhanced M-ary Query Tree Algorithm for Sequential Tag IDs 


Vol. 38,  No. 6, pp. 435-445, Jun.  2013


PDF
  Abstract

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader’s field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.

  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]

양동민 and 신종민, "EMQT：A Study on Enhanced M-ary Query Tree Algorithm for Sequential Tag IDs," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 6, pp. 435-445, 2013. DOI: .

[ACM Style]

양동민 and 신종민. 2013. EMQT：A Study on Enhanced M-ary Query Tree Algorithm for Sequential Tag IDs. The Journal of Korean Institute of Communications and Information Sciences, 38, 6, (2013), 435-445. DOI: .

[KICS Style]

양동민 and 신종민, "EMQT：A Study on Enhanced M-ary Query Tree Algorithm for Sequential Tag IDs," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 6, pp. 435-445, 6. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880