Open AccessModified tree‐based identification protocols for solving hidden‐tag problem in RFID systems over fading channels
Author(s) -
Nguyen Chuyen T.,
Bui Anh Tuan H.,
Nguyen VanDinh,
Pham Anh T.
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.1289
Subject(s) - computer science , identification (biology) , tree (set theory) , radio frequency identification , wireless , capture effect , binary tree , process (computing) , fading , computer network , binary number , real time computing , algorithm , channel (broadcasting) , throughput , computer security , telecommunications , mathematics , biology , operating system , arithmetic , mathematical analysis , botany
Hidden‐tag problem is one of the most important issues in the implementation of radio‐frequency identification (RFID) systems. Due to effects of imperfect wireless channels, RFID tags can be hidden during the identification process by either another tag or an unsuccessful detection. The former is known as the capture effect (CE) while the latter is the detection error (DE). This study newly proposes two modified tree‐based identification protocols, namely tweaked binary tree (TBT) and tweaked query tree (TQT), which are able to tackle the hidden‐tag problem caused by both the CE and DE. The performance of the proposed TBT and TQT protocols, in terms of the average number of slots required to detect a tag, and the tag‐loss rate, is evaluated in comparison with that of previously proposed ones. Computer simulations and numerical results confirm the effectiveness of the proposed protocols.