Next Article in Journal
A Truthful Incentive Mechanism for Online Recruitment in Mobile Crowd Sensing System
Previous Article in Journal
A 3D Faraday Shield for Interdigitated Dielectrometry Sensors and Its Effect on Capacitance
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Tag-to-Tag Interference Suppression Technique Based on Time Division for RFID

1
Department of Advanced Parts and Material Engineering, Chosun University, Gwangju 501-759, Korea
2
Department of Electronic Engineering, Chosun University, Gwangju 501-759, Korea
*
Author to whom correspondence should be addressed.
Sensors 2017, 17(1), 78; https://doi.org/10.3390/s17010078
Submission received: 24 August 2016 / Accepted: 25 November 2016 / Published: 1 January 2017
(This article belongs to the Section Sensor Networks)

Abstract

:
Radio-frequency identification (RFID) is a tracking technology that enables immediate automatic object identification and rapid data sharing for a wide variety of modern applications using radio waves for data transmission from a tag to a reader. RFID is already well established in technical areas, and many companies have developed corresponding standards and measurement techniques. In the construction industry, effective monitoring of materials and equipment is an important task, and RFID helps to improve monitoring and controlling capabilities, in addition to enabling automation for construction projects. However, on construction sites, there are many tagged objects and multiple RFID tags that may interfere with each other’s communications. This reduces the reliability and efficiency of the RFID system. In this paper, we propose an anti-collision algorithm for communication between multiple tags and a reader. In order to suppress interference signals from multiple neighboring tags, the proposed algorithm employs the time-division (TD) technique, where tags in the interrogation zone are assigned a specific time slot so that at every instance in time, a reader communicates with tags using the specific time slot. We present representative computer simulation examples to illustrate the performance of the proposed anti-collision technique for multiple RFID tags.

1. Introduction

Recent advancements in digital electronics, signal processing, and wireless communications have given rise to low-cost and low-power automatic wireless sensor systems, which allow non-contact and non-line-of-sight reading of data using electromagnetic signals. Radio-frequency identification (RFID) is an important building block for the Internet of Things (IoT), which helps to connect the status of a physical object to the Internet by capturing meaningful data in order to trace and share information [1,2]. It has become a key technology that spans a wide range of applications such as asset management, supply chains, and construction. An RFID system consists of a reader (interrogator), a tag (transponder), and middleware software that helps with data processing from the tag to the reader using RF signals [3,4]. Tags are classified as passive, semi-passive, and active depending on their functionality. Since a passive tag is not equipped with a power source, it requires energy from the reader in order to send back the re-modulated signal containing its ID information [4,5]. RFID communication based on backscatter tag signals depends on various factors including the power of the signal, the radar cross section (RCS) of the tag, and propagation loss.
For example, the RFID tags used in the construction industry for materials management suffers a lot from interference signals originating from neighboring tags, which ultimately results in the tag-to-tag collision problem. In order to minimize data collisions caused by neighboring tags, in this paper, we propose an anti-collision algorithm based on the time-division (TD) technique. In the TD technique, each tag’s response is differentiated by a specific time interval that corresponds to that particular tag for the transmission of data to the reader within the same reader-coverage area. Therefore, a data frame is divided into several timeslots, each of which is assigned to individual tags, and the reader can read all of the tags in chronological order [6]. Furthermore, the data frame considered in this paper includes the preamble frame, which helps with the channel estimation, signal-to-noise ratio (SNR) estimation, synchronization, etc. When transmitting data from a tag to the reader, the tag sends the preamble data before transmitting its main ID information to broadcast the destination of the tag information. After the reader receives the preamble data, it records TD slots for the data transmission corresponding to tags. In RFID applications, the TD method is required to group tags using the same time slot such that they only transmit within a specific time interval. In this paper, we compare the performance of the proposed TD method to the conventional method without the consideration of interference suppression and anti-collision technology and the CDMA technique based on the gold-code sequence, which spreads the tag backscatter signals to separate the signals of each individual tag. To verify the performance of our system, we perform our simulation in various reader interrogation zones.
The rest of the paper is organized as follows. Section 2 describes the RFID collision problems, and discusses and analyzes some previous works related to the collision problem. In Section 3, we present details of the received signal model employed in this study. In Section 4, we introduce the proposed TD solution for the anti-collision problem for a single reader, while in Section 5, we present a performance analysis of the proposed method in terms of bit error rate (BER) and frame error rate (FER). Finally, in Section 6, we conclude the paper.

2. RFID Collision Problem

In this section, we discuss types of RFID collisions and related previous works.

2.1. Types of RFID Collision

The occurrence of interference due to tag signals is a common issue in RFID systems. Simultaneous transmission from multiple tags leads to collision as the readers and the tags normally use the same channel. Collisions are classified as reader-to-reader, reader-to-tag, and tag-to-tag collisions [7,8].

2.1.1. Reader-Reader Collision

A reader-to-reader collision occurs when neighboring readers simultaneously interrogate a specific tag in the same frequency band. Furthermore, it may occur when the tag is within the readable range of one reader and the interference range of the other reader; the signal from the latter reader may interfere with the return signal from the tag. Reader-to-reader collision is discussed in more detail in Colorwave [9,10,11,12].

2.1.2. Reader-to-Tag Collision

A reader-to-tag collision (tag interference) occurs when a tag receives multiple concurrent queries from different readers. This problem can be solved by assigning different channels to nearby readers [13].

2.1.3. Tag-to-Tag Collision

A tag-to-tag collision occurs when multiple signals simultaneously arrive at the reader, preventing the reliable detection of all tags within its interrogation zone. This scenario is illustrated in Figure 1, where tags (T1, T2, T3 and T4) simultaneously send signals to a single reader, preventing the reader from correctly recognizing a particular tag. Without an anti-collision protocol, the data from these tags would not only collide at the reader, hence degrading their identification, but will also lead to wasted bandwidth and energy [14].

2.2. Related Works on Collision Problem

RFID is an accurate object identification system that is used commercially to detect and manage information pertaining to various items. However, the large-scale acceptance of RFID for industrial applications is lower than expected, and this is primarily due to several issues including environmental factors, multipath fading [15], as well as the tag-collision problem. The tag-collision problem generally occurs due to a lack of proper co-ordination between the reader and tags. The backscattering response from the tag to the reader can collide with a neighboring tag, which ultimately obscures the reader from properly reading tag IDs.
In this paper, we focus on the problem of a single reader in an environment with multiple tags. Further, we focus on the practical application of RFID technology to the construction industry. Typically, on a construction site, there are a large number of tagged objects. Thus, it is extremely important to simultaneously improve the object identification performance and minimize operating costs. A variety of multiple access technologies have been used in recently developed RFID systems such as space-division multiple access (SDMA), frequency-domain multiple access (FDMA), time-division multiple access (TDMA), and code-division multiple access (CDMA), which is known as spread-spectrum [16,17,18].
SDMA reuses certain resources (channel capacity) in spatial slots. SDMA protocols separate the channel using electronically controlled directional antennas or multiple readers to identify tags. However, drawbacks of this approach include the high implementation cost, the need to design a complicated antenna system, and its limitation to only a few specialized applications. On the other hand, FDMA uses different frequency ranges for data transmission to and from the transponders, which result in a high cost to implement the reader. This requires a complex receiver at the reader end because a dedicated receiver must be provided for each reception channel. Although CDMA exhibits good performance for multiple tags, it requires that their data be multiplied by a pseudo-random noise (PN) sequence before transmission. On the contrary, the TDMA anti-collision algorithm allocates several timeslots in each frame to solve the collision problem. The TDMA anti-collision technique is the most popular RFID reader-to-reader anti-collision scheme, and it is used in the Colorwave algorithm [19,20], where each reader chooses a random time slot to transmit data. The TDMA anti-collision method chronologically divides the total available channel capacity among participants. Its procedures are classified as synchronous reader-driven and asynchronous tag-driven. In the reader-driven procedure, at a particular time interval, an individual tag is first selected from a group of tags using specific algorithms, and then a data communication link is made between the selected tag and reader. On the other hand, with the tag-driven procedure, the tag announces itself to the reader by transmitting its IDs in the presence of a reader. The former and latter procedures are also called reader-talk-first (RTF) and tag-talk-first (TTF), respectively. TTF is relatively slow and inflexible compared to RTF [16,21,22].
For anti-collision algorithms in the RFID system, Abramson’s Logic of Hiring Access (ALOHA) protocol and binary tree algorithms, which are based on deterministic and probabilistic approaches, are widely used. Most of the standards employed for ultra-high frequency (UHF) RFID systems refer to binary tree searches for anti-collision algorithms as deterministic schemes because each roof-to-leaf path denotes a unique tag ID, and it is possible to simultaneously retrieve all IDs after all branches are completely searched. On the other hand, the ALOHA anti-collision algorithm is usually referred to as a probabilistic scheme, where each tag ID will have a probability of successful retrieval [23].
Tree-based anti-collision algorithms use a virtual tree to read all tag data within the read range of the reader by iteratively querying a subset of tags at different levels, and tag IDs are distributed based on their prefixes. The root is the set of tags to be identified, intermediate nodes represent the group of colliding tags, and the leaves represent individual tag responses [24]. They are further classified as tree splitting (TS), query tree (QT), binary search (BS), and bitwise arbitration (BTA) [17]. In the TS protocol, multiple responding tags are grouped using a random number generator. On the other hand, the QT protocol stores the tree information at the reader. The reader broadcasts a query with a bit-string prefix, which is then matched with the tag ID’s prefix, after which the tag with the matched prefix responds to the query with its ID to the reader. This process continues until only one tag responds [25]. This overcomes the problem of generating a random number using TS, and decreases the cost and computational complexity. In BS, the communication starts by the reader transmitting the serial number of tags. The serial number is then compared against their ID. In this protocol, communication is possible if tags with an ID equal to or lower than the serial number respond to the reader. Unlike the above protocols, BTA operates by requesting tags to respond bit-by-bit from the most significant bits to the least significant bit of their ID [17].
The ALOHA protocol is a probabilistic approach, where a signal responds within a random time slot in a frame to identify tags. Of the different ALOHA-based protocols, the frame-slotted ALOHA (FSA) and dynamic frame-slotted ALOHA (DFSA) are most commonly used in RFID systems because they can reduce the collision probability between tags. In FSA, the reader determines the frame size and the actual duration of the slot, and tags use random slots from among the entire set of slots (the total number of slots and the frame size are fixed). Therefore, in a reader interrogation zone, for a small number of tags, there is the problem of wastage because of the empty slots, and for a large number of tags, there is a collision problem. This drawback of FSA is partially solved by the DFSA. In DFSA, the reader will add the number of slots in one frame when there a large number of slots have collided. Similarly, the reader will decrease the number of slots in one frame size when there are many empty slots [26]. In DFSA, the size of the next frame is adjusted after estimating the number of remaining tags at the end of each frame without performing any operation for the ideal slots and collided time slots within the current frame. Therefore, the request time by the reader during these time slots are wasted. Consequently, if we try to reduce the request time, the probability of tag collisions may be increased [27].

3. Received Signal Model

The received signal, r ( k ) , at a sample index k can be modeled as
r ( k ) = x 1 ( k ) + x 2 ( k ) + x 3 ( k ) + + x L ( k ) + n ( k ) ,
which can be summarized as
r ( k ) = l = 1 L x l ( k ) + n ( k )  
where l represents the lth tag, L is the total number of tags transmitting the signal to the reader, x l ( k ) is the transmitted signal of the lth tag, and n ( k ) is the additive white Gaussian noise (AWGN) with independent and identically distributed components with zero mean and variance σ 2 .
Using Friis’ free-space equation, the relationship between the signal strength and distance, and between the received power at the antenna of the tag, P t a g , and the transmitted power from the reader, P r is given by
P t a g = P r G r G t a g ( λ 4 π d ) 2
where G r and G t a g are the transmitter and receiver antenna gains, respectively, λ is the wavelength (m), and d is the distance between the transmitter and the receiver antennas [28,29]. Equation (3) can be expressed in decibel form as
P t a g [ d B ] = P r [ d B ] + G r [ d B ] + G t a g [ d B ]   10 l o g 10 ( 4 π d λ ) 2
which describes the amount of power available to the RFID tag for operation. Note that in this paper, [ d B ] refers to the decibel scale of the specific value. Since the power of the radio-frequency signal decreases when it propagates into space, there is a difference between the power delivered from the transmitting antenna and the power obtained at the receiving antenna, and this is known as the path loss [30,31]. In Equation (4), 10 l o g 10 ( 4 π d λ ) 2 is the free-space path loss factor, and is defined as   P l o s s [ d B ] .
The decreasing trend of the signal in terms of the log-distance path loss is mathematically modeled as [32]
P l o s s ( d B ) = P l o s s ( r 0 ) +   10 n l o g ( d r 0 )
where r 0 is a reference distance, P l o s s ( r 0 ) is the free-space path loss at a distance r 0 , n is a value that depends on the surroundings and building type (a more hostile environment results in a higher value of n ), and the path loss; accordingly, it is higher for the same distance when compared to an environment with a lower value of n [33,34,35].

4. Anti-Collision for RFID Based on TD

In this section, we propose an efficient and simple anti-collision RFID system that is specifically for smart green construction technology. The goal of this construction technique is to reduce the construction cost and to enhance the speed of construction by reusing and recycling the materials used in a previous building. In order to improve the traditional construction technology, the smart green construction generally employs a construction management system that is based on a sensing technique such as RFID. In this case, RFID provides the vital roles for managing a variety of construction materials, monitoring the status of new or reused materials, and classifying the generation of each construction materials. On the construction site, the tracking and storing of materials’ information using RFID remain challenging because a large number of materials are used in narrow spaces. In this case, we need to employ a low-cost RFID system utilizing a simple protocol, unlike the ALOHA system or gold-code based system, and it should have a good anti-collision performance. In addition, the RFID tag does not need to adaptively allocate time slots in a data frame, as is the case with ALOHA, because construction materials may not move for a relatively long time.
In this paper, we propose a simple and efficient RFID system that is based on the TD method. The proposed RFID tag transmits data using the specific time slot, and this time slot is fixed. Before tags are attached to construction materials, the tags are grouped according to their time slots (note that the number of groups may be determined according to the size of the building or the amount of construction materials). When we attach tags with specific time slots to the construction materials, they should be managed to avoid that tags that are in the same group are located in a neighbor. For example, if the tag of the first group is attached to a specific construction material, tags belonging to other groups should be attached to the neighboring materials. This process of managing the locations of RFID tags is simple because construction materials are generally on the same site for relatively long periods of time until the building is demolished and the materials reused in another building. Although we focus on an application of the proposed RFID system on the construction site in this paper, it might be applied to other areas, where objects are placed in the same site for relatively long periods, such as the storage, library, and industrial sites with various devices installed.
The proposed anti-collision RFID algorithm focuses on the case involving a single handheld reader and multiple tags. In addition to efficiently reducing the probability of collisions due to other tags by assigning tags to previously allocated time slots to transmit data, it also employs a simple RFID protocol for one-way communication. This simple RFID protocol may reduce the implement cost, because the RFID tag transmits data using the fixed specific time slot, without the complicated mathematical operation process, unlike the anti-collision RFID system based on the gold-code or ALOHA. Note that the gold-code anti-collision RFID tag requires a significant amount of numerical operations including the multiplication and addition, and the ALOHA technique requires an adaptive resource process for allocating time slots within a data frame.

4.1. RFID Signal Power Model Considering Interference Signals

In RFID systems, once the tag is powered up by the transmitted power from the reader, the selected tag starts to respond to the reader. Since the modulated signal scattered from the RFID tag suffers from noise and interference signals that originate from other tags, the received signal at the RFID reader, which is given by Equations (1) and (2), consists of the modulated backscattered signal of interest, noise, and interference signals [36,37]. At the reader, the amount of power available to the receiver antenna for it to operate is given by
P R r e c e i v e r [ d B ] = P r [ d B ] + G r [ d B ] + G R receiver [ d B ] + 10 l o g 10 ( σ 4 π )   20 l o g 10 ( 4 π λ )   40 l o g 10 ( d ) ,
where P R r e c e i v e r [ d B ] is the power received by the receiver antenna of the reader, G R r e c e i v e r is the gain of the receiver antenna at the reader (which is equal to the transmitter antenna gain at the reader), and σ is the RCS of the RF tag, which is important for the system-level efficiency and reliability [35,36]. The RFID tag’s cross-section area can be written as [38,39]
σ a n t e n n a = | τ | 2 G t a g 2 λ 2 4 π
where τ is the impedance-matching coefficient between the tag chip and its antenna. Substituting the value of σ a n t e n n a into Equation (6), the modulated power from the RF tag to the reader becomes:
P R r e c e i v e r [ d B ] = P r [ d B ] + 2 G r [ d B ] + 2 G t a g [ d B ] + 20 l o g 10 ( τ )   40 l o g 10 ( 4 π λ ) 40 l o g 10 ( d ) .
Equation (8) can be expressed in a general form as
P R r e c e i v e r = P r G r 2 G t a g 2 τ 2 λ 4 ( 4 d π ) 4
Equations (8) and (9) show that the total energy consumption of passive RFID systems depends on the power transmitted from the reader to the tag. Since those equations show that the effective distance r between the tag and the reader can be adjusted by maintaining the power supplied at the reader antenna, the total backscattering power of the passive RFID tag and interrogation range depends on the transmission power level of the reader. In our computer simulations, we used the above-mentioned RFID signal power models.

4.2. RFID Anti-Collision Scheme Based on TD

In order to suppress the interference signals from surrounding multiple RFID tags, we propose an anti-collision method based on the TD technique that allocates the tag information on the specific time slot. During reader-to-tag communication, the reader transmits a carrier signal with transmit power   P r to a set of arbitrary multiple tags within their interrogation zone. If the power received by the reader is greater than the minimum power received from the tag, which is known as the reader sensitivity, data transmission may be possible from the tag to the reader. All of the tags in the coverage area of the reader then become activated and transmit their identification information to the reader with a power of   P R r e c e i v e r whenever the energy received by the reader is higher than an activation threshold. If the measured   P R r e c e i v e r value is higher than the activation threshold, the transmitting signal is effective for transmitting its payload. On the contrary, if the measured value is lower than the activation threshold, the transmitting signal does not effectively transmit its payload and the data transmission may fail. In the proposed RFID system, while the particular tag using the specific time slot transmits data to the reader, other tags using other time slots do not transmit any data, but maintain their sequence order. Since tags transmit data according to their turn, in the reader, interference signals from other tags are efficiently suppressed and the communication reliability is enhanced compared to conventional RFID system which has the low performance of reading capability for multiple tags, because they do not have the interference suppression or anti-collision technique.
Figure 2 shows an example of the transmitted signals at the tags and the received signal at the reader based on binary phase shift keying (BPSK), which uses a constant carrier signal amplitude with an independent data modulation technique and helps to provide stable power transfer in wireless communication [40,41,42]. In the figure, to explain the proposed system, we assume that each tag employs a unique time slot. Although in a real system, some tags can be allocated into the same time slots, interference signals from other tags are effectively suppressed compared to conventional RFID systems. We discuss the interference suppression performance for the proposed RFID system based on TD by performing computer simulations.

4.3. Data Architecture for RFID Anti-Collision Based on TD

In this subsection, we propose an efficient data architecture that is based on TD to prevent RFID collisions. Here, we allocate specific time slots in the RFID data frame, and a fixed number of data bits for the preamble data and the payload. Within a particular time interval, the reader recognizes data bits from a particular tag, which consists of preamble data followed by the payload. In order to prevent collisions between tags in the same reader interrogation zone, a specific time interval is reserved for the specific tags.
The functions of the preamble and payload are summarized as follows:

4.3.1. Preamble

In a noisy and interference environment that may prevent us from accurately detecting the desired signal, the preamble helps to prevent performance degradation of the signal detection [43]. Thus, preamble data are used for the channel estimation, SNR estimation, synchronization, etc. At the receiver of the reader, the efficient channel and SNR estimations should be obtained to enable the accurate detection of the transmitted data from the RFID tags and the estimation of the number of tags in the interrogation zone, respectively. In addition, perfect synchronization is required for the proposed RFID approach because the tag transmits data using a specific time slot. In this paper, we assume that the channel estimation, SNR estimation, and synchronization are performed at the receiver of the reader.
Assuming that there are four tags that each employs unique time slots, Figure 3 shows the data architecture for the proposed anti-collision RFID system. In this system, preamble data in the lth tag are transmitted using the lth time slots in the figure before transmitting the payload.

4.3.2. Payload

In this RFID system, when the reader sends the wake-up signal to the tags (for simplicity, we did not include the wake-up signal in the data architecture), tags sequentially transmit the preamble and payload using the specific time slot shown in Figure 3. The payload of this RFID system includes tag information such as the identification (ID) number, electronic product code (EPC) number, and other important information [44,45].
Using the proposed data architecture, when a specific tag transmits the data to a reader, no other tags transmit any data, as shown in Figure 3. Therefore, there is no interference signal when simultaneously communicating between multiple tags and a reader. While the TD-based anti-collision architecture for RFID in Figure 3 considers four tags and a reader, it may be extended for more tags. As mentioned previously, in the case where some tags can be allocated into the same time slots in a real system, interference from other tags are effectively suppressed, compared to the case with a conventional RFID system without the anti-collision technique.

5. Computer Simulations

In this section, we present the computer simulation results obtained to illustrate the performance of the proposed RFID system compared to that of the conventional system without the anti-collision technique and anti-collision RFID systems that are based on the gold-code sequence [46,47]. For the simulation, we considered three data frame sizes, 96 bits, which is the minimum length required for the International Standards Organization (ISO) standard [48], 144 bits, which is the recommended frame length in the ISO standard, and 512 bits, which is the maximum frame length used in typical passive RFID systems in the ISO standard. In addition, we assume that the length of the preamble is 16 bits, which is the length generally used in RFID systems [28,48]. For the simulation involving the gold-code RFID system, we assume that the length of the gold code is seven.
These simulations focus on determining the suppression performance for interference signals from circumjacent tags within the corresponding reader interrogation zone. As mentioned in the previous section, for this simulation, we assume that the channel estimation, SNR estimation, and synchronization are perfectly performed at the receiver of the reader.

5.1. Four Tags with Unique Time Slots

In this subsection, to illustrate the interference suppression performance of the proposed system, we present simulation results based on four tags with unique time slots in a reader interrogation zone. For this simulation, we considered four RFID tags located at different distances within the reader interrogation zone. Moreover, we employed passive RFID tags (T1, T2, T3 and T4) with a frequency of 900 MHz and a fixed transmitted power for a distance of 2 m with a minimum loss in each bit. After we present the results for only the four tags considered without any other tags, we present other results for the same four tags as well as many other circumjacent tags within the reader interrogation zone.
Figure 4 shows the variation of the BER with different SNR values. There are twelve curves because the four tags are at different distances (1.8–2.4 m), for three different systems, namely the proposed system, a conventional system, and an anti-collision RFID system that is based on the gold-code sequence. In Figure 4, we observe that the BER curves for the proposed system are much lower than those of the conventional system, and are slightly lower than those of the gold-code system, which means that the performance of the proposed system is better than that of both the conventional and gold-code systems. We also observe that the conventional system does not work properly when there exist interference signals from other tags, and when the distance between a tag and the reader is not close enough. Although the gold-code system has an anti-collision performance that is similar to that of the proposed system, it requires a complicated protocol, which results in an increased cost. If we increase the length of the gold code, the anti-collision performance is improved, but the computational complexity is higher, which results in a long tag-response time.
Figure 5 illustrates the case where the conventional system works properly in an interference environment. The distances between tags and the reader are 0.6, 1, 2 and 2.5 m, respectively. Moreover, we observe that only the tag at a distance of 0.6 m works properly, but other tags do not work because their BER is too high for all SNRs; this is due to the interference signals from other tags. On the other hand, the proposed system works properly for all tags in a similar case.
Next, to illustrate the interference suppression performance of the proposed RFID system compared to the conventional system, we present the simulated results for the variation in the FER as the SNR is varied in cases involving various frame lengths. Figure 6, Figure 7 and Figure 8 show FER curves for data frame lengths of 96, 114 and 512 bits, respectively, employing four tags with distances of 1.8, 2, 2.2 and 2.4 m. In addition, Figure 9, Figure 10 and Figure 11 show FER curves for the same frame lengths as in previous figures, but they employ four tags with distances of 1.5, 1.8, 2.1, and 2.5 m. In these figures, it appears that there is a single FER curve for the conventional system because the FER values for all tags are close to 0.5, which means that the reader cannot distinguish the tag identification information from the received data due to the presence of interference signals. On the other hand, in all cases, the reader that employs the proposed system correctly distinguishes the identification information for each tag. Note that in all figures, the FER for the proposed RFID system increases as the length of the data frame is increased.

5.2. Many Tags with Random Time Slots

Finally, in order to illustrate the interference-suppression performance of the proposed RFID system compared to the conventional system and an anti-collision RFID system based on the gold-code sequence, we present simulation results based on the use of a large number of tags with random time slots in a reader interrogation zone.
Figure 12 shows BER curves (at a distance of 0.8 m) for different SNR values with the proposed RFID system, the conventional system without the anti-collision technique in the presence of 250 interference tags (30 tags at distances ranging from 1.5 m to 4 m, 80 tags at distances ranging from 4 m to 7 m, and 140 tags at distances ranging from 7 m to 10 m) in an interrogation zone. In Figure 12, we observe that the proposed RFID system has a much better performance than the conventional system, because the BER curve of the proposed system is much lower than that of the conventional system.
In Figure 13, we consider four tags of interest, which have different distances (0.5, 0.6, 0.7 and 0.8 m) and unique time slots in the presence of 510 interference tags (60 tags at distances ranging from 1.5 m to 4 m, 150 tags at distances ranging from 4 m to 7 m, and 300 tags at distances ranging from 7 m to 10 m) in an interrogation zone. Similarly, in Figure 14, we consider four tags of interest, which have different distances (0.5, 0.7 and 0.8 m) and unique time slots, in the presence of 270 interference tags (30 tags at distances ranging from 1.5 m to 4 m, 90 tags at distances ranging from 4 m to 7 m, and 150 tags at distances ranging from 7 m to 10 m) in an interrogation zone. In Figure 13 and Figure 14, we compare the performance of the proposed RFID system to the conventional system and an anti-collision RFID system based on the gold-code sequence. From both figures, we observe that the proposed RFID system works properly in the interference environment for all cases and it has better performance than that of the gold-code anti-collision RFID system, while the conventional system without the anti-collision technique has high BERs for all SNRs in all cases. The SNR analyses for results of Figure 13 and Figure 14 are shown in Table 1 and Table 2, respectively. For these analyses, we consider the data reliability rates at 90%, 95%, 97%, and 99% at different distances and we indicate the minimum SNRs for achieving the considered data reliability rates in Table 1 and Table 2 for Figure 13 and Figure 14, respectively, for the proposed RFID systems, the gold-code anti-collision RFID system, and the conventional system. From both Tables, we observe that the required minimum SNRs for achieving all reliability rates for the proposed RFID system are lower than them of the gold-code anti-collision RFID system in both cases, while the conventional system does not make the considered data reliability rates for all SNRs in both cases.

6. Conclusions

In order to minimize the number of tag-to-tag collisions for RFID systems, we propose an anti-collision technique and data structure that employ the TD technique. In the proposed system, since only specific tags transmit the data to the reader in a specific time slot, interference signals from other tags are effectively suppressed. Therefore, when we simultaneously employ multiple tags and a single reader on an industrial site such as a construction site, the proposed RFID architecture improves the data reliability and performance, enabling the identification of information for specific objects or materials. We illustrated the interference suppression performance of the proposed RFID system by performing computer simulations, and compared the results with a conventional system without the anti-collision technique and an anti-collision RFID system that is based on the gold-code sequence. In the future, we will explore in greater detail some practical applications of the proposed RFID system.

Acknowledgments

This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No. NRF-2015R1D1A1A01058827). This study was supported by research fund from Chosun University, 2016.

Author Contributions

Grishma Khadka and Suk-seung Hwang conceived the idea for the proposed system and data architecture. Grishma developed the scenarios used for the computer simulation and performed the simulations. All of the authors were involved in the analysis of the proposed architecture, equations, and theoretical approach.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Choi, J.; Lee, C. An MILP-based cross-layer optimization for a multi-reader arbitration in the UHF RFID system. Sensors 2011, 11, 2347–2368. [Google Scholar] [CrossRef] [PubMed]
  2. Zhang, D.G.; Li, G.; Pan, Z.H.; Liang, Y.P. A new anti-collision algorithm for RFID tag. Int. J. Commun. Syst. 2014, 27, 3312–3322. [Google Scholar] [CrossRef]
  3. Karmakar, N.C. Handbook of Smart Antennas for RFID Systems; Wiley Online Library: New York, NY, USA, 2010. [Google Scholar]
  4. Bolic, M.; Simplot-Ryl, D.; Stojmenovic, I. RFID Systems: Research Trends and Challenges; John Wiley & Sons: Hoboken, NJ, USA, 2010. [Google Scholar]
  5. Khadka, G.; Hwang, S.S. An anti-collision RFID system based on time division in construction workplace. Korea Inst. Electron. Commun. Sci. 2012, 6, 157–161. [Google Scholar]
  6. Shin, K.C.; Park, S.B.; Jo, G.S. Enhanced TDMA based anti-collision algorithm with a dynamic frame size adjustment strategy for mobile RFID readers. Sensors 2009, 9, 845–858. [Google Scholar] [CrossRef] [PubMed]
  7. Jain, S.; Das, S.R. Collision avoidance in a dense RFID network. In Proceedings of the 1st International Workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization, Los Angeles, CA, USA, 29 September 2006; ACM: New York, NY, USA, 2006; pp. 49–56. [Google Scholar]
  8. Joshi, G.P.; Kim, S.W. Survey, nomenclature and comparison of reader anti-collision protocols in RFID. IETE Tech. Rev. 2008, 25, 234–243. [Google Scholar] [CrossRef]
  9. Waldrop, J.; Engels, D.W.; Sarma, S.E. Colorwave: An anticollision algorithm for the reader collision problem. In Proceedings of the IEEE International Conference on Communications, Anchorage, AK, USA, 11–15 May 2003; pp. 1206–1210.
  10. Engels, D.W.; Sarma, S.E. The reader collision problem. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Hammament, Tunisia, 6–9 October 2002; pp. 641–646.
  11. Ho, J.; Engels, D.W.; Sarma, S.E. HiQ: A hierarchical Q-learning algorithm to solve the reader collision problem. In Proceedings of the International Symposium on Applications and the Internet Workshops, SAINT Workshops 2006, Phoenix, AZ, USA, 23–27 January 2006; Auto-ID Labs, Massachusetts Institute of Technology: Cambridge, MA, USA, 2006. [Google Scholar]
  12. Birari, S.M.; Iyer, S. Mitigating the reader collision problem in RFID networks with mobile readers. In Proceedings of the Jointly Held with the 2005 IEEE 7th Malaysia International Conference and 13th IEEE International Conference on Communication Networks, Kuching, Malaysia, 16–18 November 2005.
  13. Bhochhibhoya, R. Mobile Tag Reading in a Multi-Reader RFID Environment; ProQuest: Ann Arbor, MI, USA, 2008. [Google Scholar]
  14. Kim, S.-Y.; Park, H.-K.; Lee, J.-K.; Ra, Y.-C. A study on control method to reduce collisions and interferences between multiple RFID readers and RFID tag. In Proceedings of the IEEE International Conference on New Trends in Information and Service Science, Beijing, China, 30 June–2 July 2009.
  15. Liu, X.; Shannon, J.; Voun, H.; Truijens, M.; Chi, H.-L.; Wang, X. Spatial and temporal analysis on the distribution of active radio-frequency identification (RFID) tracking accuracy with the kriging method. Sensors 2014, 14, 20451–20467. [Google Scholar] [CrossRef] [PubMed]
  16. Finkenzeller, K. Introduction. In RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 3rd ed.; John Wiley & Sons: Chichester, UK, 2010. [Google Scholar]
  17. Klair, D.K.; Chin, K.W.; Raad, R. A survey and tutorial of RFID anti-collision protocols. IEEE Commun. Surv. Tutor. 2010, 12, 400–421. [Google Scholar] [CrossRef]
  18. Pola, W. Determination of 3-dimentional interrogation zone in anti-collision RFID systems with inductive coupling by using Monte Carlo method. Available online: http://przyrbwn.icm.edu.pl/APP/PDF/121/a121z4p303.pdf (accessed on 30 November 2016).
  19. Eom, J.B.; Yim, S.B.; Lee, T.J. An efficient reader anti-collision algorithm in dense RFID networks with mobile RFID readers. IEEE Trans. Ind. Electron. 2009, 56, 2326–2336. [Google Scholar]
  20. Birari, S.M.; Iyer, S. PULSE: A MAC Protocol for RFID Networks; Springer: Berlin/Heidelberg, Germany, 2005; pp. 1036–1046. [Google Scholar]
  21. Shih, D.-H.; Sun, P.-L.; Yen, D.C.; Huang, S.-M. Taxonomy and survey of RFID anti-collision protocols. Comput. Commun. 2006, 29, 2150–2166. [Google Scholar] [CrossRef]
  22. Zhang, W.; Guo, Y.; Tang, X.; Cui, G.; Wu, L.; Mei, Y. An efficient adaptive anticollision algorithm based on 4-ary pruning query tree. Int. J. Distrib. Sens. Netw. 2013, 2013, 848746. [Google Scholar] [CrossRef]
  23. Liu, H.-C. The Approaches in Solving Passive RFID Tag Collision Problems; INTECH Open Access Publisher: Rijeka, Croatia, 2010. [Google Scholar]
  24. La Porta, T.F.; Maselli, G.; Petrioli, C. Anti-collisions protocols for single-reader RFID systems: Temporal analysis and optimization. IEEE Trans. Mob. Comput. 2011, 10, 267–279. [Google Scholar] [CrossRef]
  25. Yang, L.; Han, J.; Qi, Y.; Wang, C.; Liu, Y.; Cheng, Y.; Zhong, X. Revisting tag collision problem in RFID systems. In Proceedings of the 2010 IEEE 39th International Conference on Parallel Processing (ICPP), San Diego, CA, USA, 13–16 September 2010; pp. 178–187.
  26. Cheng, T.; Jin, L. Analysis and simulation of RFID anti-collision algorithms. In Proceedings of the IEEE 9th International Conference on Advanced Communication Technology, Gangwon-Do, Korea, 12–14 February 2007; pp. 697–701.
  27. He, Y.; Wang, X. An Aloha-based improved anti-collision algorithm for RFID systems. IEEE Wirel. Commun. 2013, 20, 152–158. [Google Scholar]
  28. Su, W.; Alchazidis, N.; Ha, T.T. Multiple RFID tags access algorithm. IEEE Trans. Mob. Comput. 2010, 9, 174–187. [Google Scholar]
  29. Lazaro, A.; Girbau, D.; Villarino, R. Effects of interferences in UHF RFID systems. Prog. Electromagn. Res. 2009, 98, 425–443. [Google Scholar] [CrossRef]
  30. Chen, R. Ubiquitous Positioning and Mobile Location-Based Services in Smart Phones; IGI Global: Hershey, PA, USA, 2012. [Google Scholar]
  31. Dobkin, D.M. The RF in RFID: Passive UHF RFID in Practice; Newnes: Burlington, VT, USA, 2012. [Google Scholar]
  32. Rappaport, T.S. Wireless Communication—Principal and Practice, 2nd ed.; Prentice Hall: Upper Saddle River, NJ, USA, 1996. [Google Scholar]
  33. Leong, K.S.; Ng, M.L.; Cole, P.H. The reader collision problem in RFID systems. In Proceedings of the IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Beijing, China, 8–12 August 2005; pp. 658–661.
  34. Nikitin, P.V.; Rao, K.; Lazar, S. An overview of near field UHF RFID. In Proceedings of the IEEE International Conference on RFID, Grapevine, TX, USA, 26–28 March 2007; pp. 167–174.
  35. Sani, A.; Rajab, M.; Foster, R.; Hao, Y. Antennas and propagation of implanted RFIDs for pervasive healthcare applications. Proc. IEEE 2010, 98, 1648–1655. [Google Scholar] [CrossRef] [Green Version]
  36. Griffin, J.D.; Durgin, G.D. Gains for RF tags using multiple antennas. IEEE Trans. Antennas Propag. 2008, 56, 563–570. [Google Scholar] [CrossRef]
  37. Griffin, J.D.; Joshua, D.; Durgin, G.D.; Haldi, A.; Kippelen, B. RF tag antenna performance on various materials using radio link budgets. IEEE Antennas Wirel. Propag. Lett. 2006, 5, 247–250. [Google Scholar] [CrossRef]
  38. Bhattacharyya, R.; Floerkemeier, C.; Sarma, S. Towards tag antenna based sensing—An RFID displacement sensor. In Proceedings of the IEEE International Conference on RFID, Orlando, FL, USA, 27–28 April 2009; pp. 95–102.
  39. Nikitin, P.V.; Rao, K.V.S. Measurement of backscattering from RFID tags. In Proceedings of the Antennas Measurement Techniques Assocation Symposium, Newport, RI, USA, 30 October–4 November 2005.
  40. Amin, N.; Jye, N.W.; Othman, M. A BPSK backscatter modulator design for RFID passive tags. In Proceedings of the IEEE International Workshop on Radio-Frequency Integration Technology (RFIT 007), Singapore, 9–11 December 2007; pp. 262–265.
  41. Sonkusale, S.; Luo, Z. A complete data and power telemetry system utilizing BPSK and LSK signaling for biomedical implants. In Proceedings of the IEEE 30th Annual International Conference of the Engineering in Medicine and Biology Society (EMBS 2008), Vancouver, BC, Canada, 20–25 August 2008; pp. 3216–3219.
  42. Elamary, G.A.; Chester, E. Converting binary data To NRZ signal for RFID and biomedical applications. In Proceedings of the World Congress on Engineering, London, UK, 2–4 July 2014.
  43. Engels, D.W. On Ghost Reads in RFID Systems; Massachusetts Institute of Technology (MIT): Cambridge, MA, USA, 2005; pp. 1–15. [Google Scholar]
  44. EPCglobal. EPC Radio-Frequency Identity Protocols Class-1 Generation-2 UHF RFID Protocol for Communications at 860 MHz–960 MHz. Available online: http://www.gs1.org/sites/default/files/docs/epc/uhfc1g2_1_1_0-standard-20071017.pdf (accessed on 28 November 2016).
  45. EPCglobal. EPC Radio-Frequency Identity Protocols Generation-2 UHF RFID. Available online: http://www.gs1.org/sites/default/files/docs/epc/uhfc1g2_2_0_0_standard_20131101.pdf (accessed 28 November 2016).
  46. Mutti, C.; Floerkemeier, C. CDMA-based RFID systems in dense scenarios: Concepts and challenges. In Proceedings of the 2008 IEEE International Conference on RFID, Las Vegas, NV, USA, 16–17 April 2008; pp. 215–222.
  47. Mazurek, G. Design of RFID system with DS-CDMA transmission. In Proceedings of the IEEE International Conference on Automation Science and Engineering (CASE 2008), Arlington, VA, USA, 23–26 August 2008; pp. 703–708.
  48. Information Technology-Radio Frequency Identification for Item Management. Available online: http://www.youwokeji.com.cn/down/18000-6.pdf (accessed on 28 November 2016).
Figure 1. Tag-to-tag collision.
Figure 1. Tag-to-tag collision.
Sensors 17 00078 g001
Figure 2. Example of transmitted signals at tags and received signal at the reader in the proposed BPSK-based RFID system.
Figure 2. Example of transmitted signals at tags and received signal at the reader in the proposed BPSK-based RFID system.
Sensors 17 00078 g002
Figure 3. Data architecture for proposed anti-collision RFID system.
Figure 3. Data architecture for proposed anti-collision RFID system.
Sensors 17 00078 g003
Figure 4. Bit Error Rate (BER) curves of the proposed system, conventional system without anti-collision technique, and anti-collision system based on the gold-code sequence.
Figure 4. Bit Error Rate (BER) curves of the proposed system, conventional system without anti-collision technique, and anti-collision system based on the gold-code sequence.
Sensors 17 00078 g004
Figure 5. BER curves of the conventional system for four tags with different distances.
Figure 5. BER curves of the conventional system for four tags with different distances.
Sensors 17 00078 g005
Figure 6. FER curves of the proposed and conventional systems with a frame length of 96 bits (distances of 1.8, 2, 2.2 and 2.4 m).
Figure 6. FER curves of the proposed and conventional systems with a frame length of 96 bits (distances of 1.8, 2, 2.2 and 2.4 m).
Sensors 17 00078 g006
Figure 7. FER curves of the proposed and conventional systems with a frame length of 144 bits (distances of 1.8, 2, 2.2 and 2.4 m).
Figure 7. FER curves of the proposed and conventional systems with a frame length of 144 bits (distances of 1.8, 2, 2.2 and 2.4 m).
Sensors 17 00078 g007
Figure 8. FER curves of the proposed and conventional systems with a frame length of 512 bits (distances of 1.8, 2, 2.2 and 2.4 m).
Figure 8. FER curves of the proposed and conventional systems with a frame length of 512 bits (distances of 1.8, 2, 2.2 and 2.4 m).
Sensors 17 00078 g008
Figure 9. FER curves of the proposed and conventional systems with a frame length of 96 bits (distances of 1.5, 1.8, 2.1 and 2.5 m).
Figure 9. FER curves of the proposed and conventional systems with a frame length of 96 bits (distances of 1.5, 1.8, 2.1 and 2.5 m).
Sensors 17 00078 g009
Figure 10. FER curves of the proposed and conventional systems with a frame length of 144 bits (distances of 1.5, 1.8, 2.1 and 2.5 m).
Figure 10. FER curves of the proposed and conventional systems with a frame length of 144 bits (distances of 1.5, 1.8, 2.1 and 2.5 m).
Sensors 17 00078 g010
Figure 11. FER curves of the proposed and conventional systems with a frame length of 512 bits (distances of 1.5, 1.8, 2.1 and 2.5 m).
Figure 11. FER curves of the proposed and conventional systems with a frame length of 512 bits (distances of 1.5, 1.8, 2.1 and 2.5 m).
Sensors 17 00078 g011
Figure 12. BER curves of the proposed and conventional systems at a distance of 0.8 m in the presence of 250 interference tags.
Figure 12. BER curves of the proposed and conventional systems at a distance of 0.8 m in the presence of 250 interference tags.
Sensors 17 00078 g012
Figure 13. BER curves of the proposed system, conventional system without anti-collision technique, and anti-collision system based on the gold-code sequence, for four tags of interest with different distances in the presence of 510 interference tags.
Figure 13. BER curves of the proposed system, conventional system without anti-collision technique, and anti-collision system based on the gold-code sequence, for four tags of interest with different distances in the presence of 510 interference tags.
Sensors 17 00078 g013
Figure 14. BER curves of the proposed system, conventional system without anti-collision technique, and anti-collision system based on gold-code systems, for four tags of interest with different distances in the presence of 270 interference tags.
Figure 14. BER curves of the proposed system, conventional system without anti-collision technique, and anti-collision system based on gold-code systems, for four tags of interest with different distances in the presence of 270 interference tags.
Sensors 17 00078 g014
Table 1. SNR analysis at different distances in the presence of 510 interference tags.
Table 1. SNR analysis at different distances in the presence of 510 interference tags.
Data Reliability RateMinimum SNR (dB) for TD Method at Distance (m)Minimum SNR (dB) for Gold Code Method at Distance (m)Minimum SNR (dB) for Conventional Method at Distance (m)
0.5 m0.6 m0.7 m0.8 m0.5 m0.6 m0.7 m0.8 m0.5 m0.6 m0.7 m0.8 m
90%<0<04.018.8<0<04.419.3N/AN/AN/AN/A
95%<0<06.021.0<0<06.521.7N/AN/AN/AN/A
97%<00.17.122.3<00.77.922.8N/AN/AN/AN/A
99%<02.09.024.0<02.49.624.5N/AN/AN/AN/A
Table 2. SNR analysis at different distances in the presence of 270 interference tags.
Table 2. SNR analysis at different distances in the presence of 270 interference tags.
Data Reliability RateMinimum SNR (dB) for TD Method at Distances (m)Minimum SNR (dB) for Gold Code Method at Distances (m)Minimum SNR (dB) for Conventional Method at Distances (m)
0.5 m0.6 m0.7 m0.8 m0.5 m0.6 m0.7 m0.8 m0.5 m0.6 m0.7 m0.8 m
90%<0<00.68.0<0<01.18.6N/AN/AN/AN/A
95%<0<02.810.2<0<03.410.9N/AN/AN/AN/A
97%<0<03.911.2<0<04.512N/AN/AN/AN/A
99%<00.45.913.1<00.96.413.9N/AN/AN/AN/A

Share and Cite

MDPI and ACS Style

Khadka, G.; Hwang, S.-S. Tag-to-Tag Interference Suppression Technique Based on Time Division for RFID. Sensors 2017, 17, 78. https://doi.org/10.3390/s17010078

AMA Style

Khadka G, Hwang S-S. Tag-to-Tag Interference Suppression Technique Based on Time Division for RFID. Sensors. 2017; 17(1):78. https://doi.org/10.3390/s17010078

Chicago/Turabian Style

Khadka, Grishma, and Suk-Seung Hwang. 2017. "Tag-to-Tag Interference Suppression Technique Based on Time Division for RFID" Sensors 17, no. 1: 78. https://doi.org/10.3390/s17010078

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop