Journal of Computer and Communications

Volume 6, Issue 11 (November 2018)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.12  Citations  

Dynamically Enlarge and Shrink Power Coverage to Speed Up Tag Identification in an RFID System

HTML  XML Download Download as PDF (Size: 1712KB)  PP. 247-263  
DOI: 10.4236/jcc.2018.611023    595 Downloads   1,172 Views  

ABSTRACT

In this paper, we present a power adjustment scheme to dynamically enlarge and shrink power coverage to speed up tag identification in an RFID system. By dividing a TDMA frame into time slots, the proposed power adjustment scheme can adaptively increase or decrease the transmission power of a reader. Specifically, due to the contention for a TDMA slot from numerous tags, three states of a slot could exist; they are respectively referred to as successful, collided, and idle states. An adjustment factor based on the three states is designed to dynamically adjust the transmission power of a reader. The design of the adjustment factor considers two different aspects. When the number of idle state far exceeds the number of collided state, the first aspect will enlarge the power such that more tags within the coverage can be concurrently identified. On the other hand, when the number of idle state is much smaller than the number of collided state, the second aspect will shrink the power such that the number of tags within the coverage is significantly reduced. The proposed power adjustment scheme is simulated using NS-3. In the simulation, we design three different topologies which place tags in three distributions, uniform, random, and hotspot. From the simulation results, we demonstrate that the proposed power adjustment scheme can speed up the tag identification and save energy consumption, particularly when a large number of tags are placed in hotspot distribution.

Share and Cite:

Sheu, T. and Zhu, J. (2018) Dynamically Enlarge and Shrink Power Coverage to Speed Up Tag Identification in an RFID System. Journal of Computer and Communications, 6, 247-263. doi: 10.4236/jcc.2018.611023.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.