Best Papers
 Bounds on Expected Cognition Completion Time in RFID Networks Employing Static Naive MAC Scheme 


Vol. 50,  No. 1, pp. 31-47, Jan.  2025
10.7840/kics.2025.50.1.31


PDF Full-Text
  Abstract

Consider an RFID network that consists of single reader and multiple tags residing in the vicinity of the reader. In the RFID network, a collision can occur among the packets which are almost simultaneously sent by two or more tags. For numerous tags to be able to successfully deliver their packets to the reader while arbitrating the collision among some packets, suppose that the RFID network employs a static naive MAC scheme rooted in framed slotted ALOHA. Without prior information about nearby tags, a single-reader multiple-tag RFID is often deployed to cognize neighboring tags, i.e., to gather the identification numbers of the tags attached on various items. Definitely, it is of necessity to cognize all the tags in a limited time. Thus, it is of utmost importance to investigate the cognition completion time, i.e., the time elapsed until the reader cognizes all the tags. In this paper, we first construct a Markov chain to represent the cognition completion time as a hitting time of the Markov chain. As an alternative to the exact value of the expected cognition completion time, which is hardly obtainable in a tractable form, we then develop a lower bound by building a fast-converging Markov chain with first-order stochastically dominating random variables and attain an upper bound by constructing slow-converging Markov chains with first-order stochastically dominated random variables. Numerical examples reveal that the exact value of the expected cognition completion time is tightly bounded above by the upper bound in case a relatively small number of slots comprise each response interval. Further, the examples corroborate that the lower and upper bounds exhibit a parametric characteristic of convexity as similarly as the exact value of the expected cognition completion time does.

  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.


  Related Articles
  Cite this article

[IEEE Style]

C. Choi, "Bounds on Expected Cognition Completion Time in RFID Networks Employing Static Naive MAC Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 1, pp. 31-47, 2025. DOI: 10.7840/kics.2025.50.1.31.

[ACM Style]

CheonWon Choi. 2025. Bounds on Expected Cognition Completion Time in RFID Networks Employing Static Naive MAC Scheme. The Journal of Korean Institute of Communications and Information Sciences, 50, 1, (2025), 31-47. DOI: 10.7840/kics.2025.50.1.31.

[KICS Style]

CheonWon Choi, "Bounds on Expected Cognition Completion Time in RFID Networks Employing Static Naive MAC Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 1, pp. 31-47, 1. 2025. (https://doi.org/10.7840/kics.2025.50.1.31)
Vol. 50, No. 1 Index

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880