نتایج جستجو برای: reader to tag collision
تعداد نتایج: 10630264 فیلتر نتایج به سال:
Radio Frequency Identification (RFID) now-a-days, widely using technology in the field of auto-identification of objects. The system consists of two basic blockstag and a reader. The tag is attached to the object to be identified and it transmits the identification number and other information to the reader. The reader after receiving the identification number or any other information processed...
Recently, the use of RFID(Radio Frequency Identification) for object identification is used more often, but the tag collision problem by the use of a radio frequency still exists. Therefore, in this paper, we analyzed tag identification time to minimize tag collisions and improve tag identification time by applying various tag anti-collision algorithms in the suggested method. As a result, we d...
Radio frequency identification (RFID) system is a wireless automatic identification mechanism. Now, it is widely applied in supply chain management, supermarket checkout process, public transportation, animal identification, the localization and tracking of objects and people, and toll ways. The tag collisions in RFID system is an unavoidable problem. The number of collision in previous tag ant...
An EPC Class 1 Gen 2 (C1G2) RFID system is composed of a reader and one or several passive tags. Passive tags obtain the required energy from the radio frequency field emitted by the reader. The forward data link (reader to tag) is embedded in this radio frequency field. The backward data link (tag to reader) is achieved by means of backscattering. The RFID tag consists of several analog circui...
Tag collision is one of the most important issues in RFID systems and many tag anti-collision protocols were proposed in literature. But some kind of these protocols like Tree-based protocols (specifically Query tree) which its performance depends on tag id length and construction, have some issues like id distribution. In this paper we discuss about Query tree protocol which may influenced by ...
Embedding a Radio Frequency Identification (RFID) tag into individual items enables the unique identification of such items over the wireless medium, without the need for a line-of-sight path. One of the main challenges for the successful commercialization of the RFID technology is the efficient, yet private, identification of low-cost tags in the presence of adversaries attempting to illegally...
Dynamic Frame Slotted ALOHA (DFSA) is a de facto algorithm in the EPC Global Class-1 Generation-2 protocol for Radio Frequency Identification (RFID) tag collision problem. DFSA fails when UHF RFID deployment becomes dense like Internet of Things (IoT). Existing works do not provide readers prior estimates. Most algorithms assume slot means two collision. But IoT applications, much more than tag...
We present Colorwave, a medium access control (MAC) protocol designed for wireless sensor networks such as Radio Frequency Identification (RFID) reader networks. A network of readers will collaborate for a common application such as item-level monitoring in supply chain management. Readers may be deployed in an ad hoc manner, and readers must not interfere with one another’s reader-to-tag commu...
The communication protocol used is a key issue in order to make the most of the advantages of active RFID technologies. In this paper we introduce a carrier sense medium access data communication protocol that dynamically adjusts its back-off algorithm to best suit the actual application at hand. Based on a simulation study of the effect on tag energy cost, read-out delay, and message throughpu...
The Reader Collision Problem (RCP) is a bottle-neck decreasing the reading efficiency in multiplereader RFID systems. This paper proposed a novel anti-collision protocol – DRA (Distributed Reservation-based Anti-collision) protocol to solve the RCP in multiple-reader RFID systems. Temporal Cluster Headers (TCHs) are dynamically selected among the potentially interfered readers in DRA protocol. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید