Scholarlink

This chapter designs a method for detecting missing multi-tagged events detection from the perspective of hashing seed. Our key idea is to search appropriate seeds such that the reader only needs to probe a subset of tags, each selected from different items rather than the entire tag set for the missing item detection. By employing the computation-communication trade-offs, we develop two protocols named \( \text {M}^2 \text {ID} \) and \( \text {M}^2 \text {ID}+ \) , where the latter protocol improves time efficiency by classifying tags before segmentation compared to the former. With the derived optimum parameters, our protocols can achieve up to 4x performance gain in terms of time efficiency compared to state-of-the-art solutions.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Fast and Reliable Access Protocol for Multi-Tagged RFID Systems

  • 章节

  • 发表日期：

    2026年

查看全文
  • Rongrong Zhang,
  • Hao Liu

摘要

This chapter designs a method for detecting missing multi-tagged events detection from the perspective of hashing seed. Our key idea is to search appropriate seeds such that the reader only needs to probe a subset of tags, each selected from different items rather than the entire tag set for the missing item detection. By employing the computation-communication trade-offs, we develop two protocols named \( \text {M}^2 \text {ID} \) and \( \text {M}^2 \text {ID}+ \) , where the latter protocol improves time efficiency by classifying tags before segmentation compared to the former. With the derived optimum parameters, our protocols can achieve up to 4x performance gain in terms of time efficiency compared to state-of-the-art solutions.