A Simulation Annealing based Anti-Collision
Protocol for RFID Tag Identification
Adarsh Kumar1, Mukta Goyal2, K Rajalakshmi3
Computer Sc. Engg. and Info. Tech. Department
Jaypee Institute of Information Technology
Noida, India
adarsh.kumar@jiit.ac.in1, mukta.goyal@jiit.ac.in2,
k.rajalakshmi@jiit.ac.in3
Abstract The advanced properties like low cost, increased
communication range, own battery source etc. preferred Radio
frequency identification (RFID) over bar codes for object
identification and tracking. In RFID systems, reader-to-reader,
tag-to-tag, reader-to-tag collisions are major challenges during
object identification. The performance analysis of state-of-art
protocols shows that the majority of probabilistic and
deterministic algorithms are inefficient. In this work, the
proposed protocol uses simulated annealing mechanism which
concentrates on parameters of physical state of the RFID readers
while selecting the reader for interrogation. If readers with best
physical state are selected for interrogation then chances of
better network performance also increases. The physical state
parameters include energy efficiency, mobility, distance to tag
etc. The simulation analysis of proposed scheme shows better
performance with parameters like tag identification ratio, total
successful interrogation cycles, total time cycles, total IDLE
cycles, total number of collisions, delay, and total number of
packets sent and received. It is also observed that a collision free
RFID network is possible with integration of simulated annealing
mechanism.
KeywordsRFID; simulated annealing; tag-to-tag collisions;
reader-to-reader collisions
I. INTRODUCTION
Radio Frequency identification (RFID) technology is popular
among various applications [1]-[3] like medical devices,
patient monitoring system, supply chain management, military
services, authorization and access control etc. RFID
technology provides wide range of communication at low cost
for reading multiple devices at same time thus, preferred over
bar codes. Among RFID devices, reader read the information
from tags which are attached to products. The read
information is stored in backend system for information
processing [4][5]. In majority of application scenarios, RFID
devices create a dense network where there is large number of
readers and tags present at one geographical location. Here,
one reader tries to read multiple tags and tags contend to be
read by reader. As a result, chances of collisions among
reader-to-reader, reader-to-tag or tag-to-tag increases
drastically. In order to efficiently management the RFID
network, proper identification of devices is important. On
other hand, the presence of multiple readers or tags at random
978-1-5090-3251-8/16/$31.00 2016 IEEE
Alok Aggarwal
Computer Sc. Engg. and Info. Tech. Department
JP Institute of Engineering and Technology
Meerut, India
director@jpiet.com
locations cannot be avoided in dense networks. There exist
various solutions to solve this problem but none of them
concentrate on state of a device. RFID devices are resource
constraint devices thus there is fast consumption of stored
energy with time in a dense network. The state-of-art anti-
collision protocols concentrate on unique identification with
collision resolution only rather than selecting the best suitable
device which can efficiently reduce the collision and perform
proper identification also. Simulated annealing is a
probabilistic technique for approximating the optimum
solution from a universal set of solutions. Thus, it helps in
selecting the best reader for identification of tag with physical
state of readers taken into consideration. If best deices are
selected everytime for identification then a major benefit of
improving the performance of RFID network is quite feasible.
There exist various parameters that can be used for measuring
the performance of anti-collision protocols in RFID networks.
These parameters are explained as follows.
x Tag Identification Ratio (TIR): It is the ratio of the number
of identified tags to the total number of tags present in a
given geographical location.
x Total time cycles: Majority of reader and tag devices consist
of single transmitter and receiver unit. Thus, one tag can be
identified at a time only. An efficient anti-collision protocol
should identify maximum number of tag in minimum time
cycles.
x Total IDLE cycles: In IDLE cycles, a reader does not
identify the tag. This may be due to requirement of pre-
processing, collisions in previous cycle/s, device not ready,
ambiguity among reader to solve a collision etc. An anti-
collision protocol is considered to be efficient if it
minimizes the number of IDLE cycles.
x Total successful interrogation cycles: In successfully
interrogation cycle, a reader successfully identifies a tag. In
order to improvement the performance, a reader should
maximize the number of successful interrogation cycles.
x Total collisions: Minimum collisions during interrogation
cycles mean maximum performance. Thus, an anti-collision
protocol is developed to minimize the number of collisions.
x Total Delay: Delay is directly proportional to time. If there
are more collisions then delay will automatically increase.
 Hence, anti-collision protocol concentrates on maximum
tags identification with minimum delay.
x Total number of messages received and sent by reader or
interrogator: Reader may take one or multiple rounds for
exchanging the identification number. More the number of
identification number exchange rounds more will be the
delay which in turn decreases the performance. Thus, an
efficient anti-collision protocol should minimize the number
of message received and sent by reader for decreasing the
communication and computational cost.
x Order of tags identification: There exist various
applications where order of tags identification is important.
For example, leakage points in water or gas pipeline can be
measured by reading the tags of each pipe sequentially
which in turn provides the data of pressure in each pipe
hence leakage points can be identified and repair can be
done timely.
In this work, a novel and efficient anti-collision protocol is
proposed which selects readers for interrogation through
simulated annealing. In simulated annealing process, reader
physical state parameters like energy efficiency, mobility,
number of neighboring nodes etc. are taken for collision free
protocol. The performance parameters like total time cycles,
total IDLE cycles, total successful interrogation cycles, total
collisions, total delay, total number of messages received or
sent and order of tag identification show comparatively better
results than existing protocols..
The rest of the paper is organized as follows. Section II
explores the state-of-art RFID anti-collision protocols. Section
III describes the steps taken for integrating the simulated
annealing mechanism in proposed anti-collision protocol.
Section IV explains the simulation parameters and
performance analysis of proposed algorithm. Finally,
conclusion is drawn in section V.
II. RELATED WORK
As discussed earlier, reader-to-reader, tag-to-tag and
reader-to-tag collisions are the major challenges for RFID
anti-collision protocols [6]. The state-of-art anti-collision
protocols are classified as deterministic and probabilistic.
These protocols are explained as follows.
A. Deterministic Algorithms
The deterministic algorithms are space, time, frequency and
code division based multiple access methods. In these methods,
identification is performed either synchronously or
asynchronously. In synchronous identification process, reader
sends a prefix value and tag compares it with its most
significant identification bits and if it matched then tag respond
to reader. Polling, I-code, tree splitting etc. are the popular
synchronous identification methods [6]. In asynchronous
identification process, total identification period is divided into
cycles and reader is scheduled to interrogate during these
cycles. If reader interrogates then tag has to send it complete
identification number. Protocols like ALOHA, CSMA, CSMA
with soft reservation etc. are the popular deterministic
algorithms. This category of anti-collision protocol is
preferable used for tag-to-tag related collisions [6].
B. Probabilitistic Algorithms
This category of anti-collision protocols is preferably used
for reader-to-reader related collisions. For example, graph
coloring, heuristic, neural network, simulated annealing etc.
[6][7]. Here, performance is majorly concentrated for
designing the anti-collision protocol. Thus, objective is to
maximize the performance with increase in chances of
maximum readerV interrogation. These methods are the
preferred option of highly dense networks. Since, readers per
unit area are high in dense network, thus chances of collisions
are maximum. In order to resolve this problem probabilistic
algorithms are preferred over deterministic.
As both deterministic and probabilistic algorithms fails to
provide complete collision free network, thus there is wide
scope of improvement in this area. A collision free network
with better performance can be designed with UHDGHUV state
parameters like energy, distance to interrogating tag,
neighboring tags etc. In [8]-[13], various simulated annealing
based protocols are proposed for collision free network with
reader state properties taken into consideration. A few
simulated annealing based anti-collision protocols are
explained as follows. Lin et al. [8] proposes a simulated
annealing based anti-collision protocol. In this protocol energy
efficiency of reader is taken into consideration while selecting
the reader for interrogation. This protocol does not explain the
situation when multiple readers have same energy efficiency
value. Hung et al. [9] simulated annealing approach uses
temperature state parameter for deciding the interrogator. This
work has compared various temperature control schemes also
for proposing the best anti-collision protocol. This proposal
again does not address the situation of selecting an
interrogation with same temperature readers. Also, there is
unrealistic approach of selecting a tag dependent reader. Tian
et al. [10] proposed a more realistic solution to interrogator
selection with graph coloring mechanism. Here, readers are
colored and scheduling mechanism decides the color for
interrogators. This solution does not completely avoid the
collisions because multiple interrogators with same color can
come closer and leads to collision. Further, use of a large
number of colors delay the chances of readers to interrogate. In
both cases, network performance degrades drastically. In [11],
simulated annealing process is used for locating the readers and
gradient descent method is proposed for reducing the error.
Although locations of readers give clarity to selecting an
interrogator but it do not guarantee the collision free network
with minimum delay. In another density based anti-collision
approach, Li et al. [12] uses artificial immune network as state
parameter for simulated annealing. The network is configured
with placement of tags which is unrealistic. Placement of
readers should be independent of tags. These algorithms are
more suitable for local optimum solution and do not provide
global optimum solution. As a result, scalability of proposed
solution is not guaranteed. Similarly, Tao et al. [13] proposed
position change simulated annealing parameter based anti-
collision protocol and Alonso et al. [14] uses centralized server
for scheduling and managing the interrogator. Both of these
approaches seem to be infeasible because there is not uniform
distribution of channels. Similarly, various schemes are
analyzed in [6] but none of them provide collision free
network. Thus, there is wide scope of designing an anti-
collision protocol for improving the performance and there
should be uniform distribution of channels among similar
featured readers.
III. PROPOSED ANTI-COLLISION PROTOCOL
This section proposes an anti-collision protocol where there
is use of centralized server. This centralized server checks that
whether the geographical area under observation is having Figure 1: An Figure 2: An interrogation
obstacles for mobile readers and tags or not. If it is having interrogation zone zone depicting network
obstacles (case-1) then centralized server constructs an obstacle
containing obstacles structure of uneven squares
free network otherwise fixed cells network (case-2). In obstacle
and rectangles
free network, a fixed area geometric structure is repeatedly
drawn to cover the interrogation zone. It is like a cellular
network where hexagonal structure is repeatedly used. In a
network where there are obstacles, it is preferred to draw
uneven geometric structures. In both cases, network structured
are drawn over complete interrogation zone. After drawing a
network structure, movement of readers is observed though
polar graphs. If polar graphs show presence of multiple readers
in one geometric structure then linear ordering algorithm with
simulated annealing is used for maximizing the gain.
A. Draw Polar Graphs
In order to identify the reader location, polar graphs are
necessary when there are obstacles in the interrogation zone. It
is not necessary when there are no obstacles. In another case,
if the frequency of radio wave is high then it bounce back [3]
rather than penetrates. Thus, there is need to draw
heterogeneous geometric structured network. Drawing polar
graphs from network structure in both cases is explained as
follows.
Case 1: If radio waves do not penetrate through objects or
there are obstacles then drawing a network structure with
heterogeneous areas of squares and rectangles is appropriate
for polar graphs. Let the interrogation zone is shown in fig. 1.
Fig. 2 shows the network structure of interrogation zone. In
this interrogation zone, uneven geometric structures are used
such that it should construct obstacle free zones for
interrogators. Fig. 2 shows that there are 11-obstacle free
areas. In Fig. 3, polar graphs of network structure are
constructed with mobility of readers taken into consideration. Figure 3: Polar graphs of network structure when radio waves
The horizontal and vertical polar graphs predict the mobility can not penetrate through obstacles (case-1)
of readers. An obstacle free area may contain one or more
entry/exit interfaces. For example zone 8 has 8-1 and 8-2 exit Case-2: If radio waves penetrate through objects or there are
points. Every entry/exit point acts as a node in both vertical no obstacles then drawing a cell structure with homogenous
and horizontal polar graph. For example, movements of reader areas of fixed geometric structure is preferred for polar graphs.
1 tracked using 2-1(T1-R1), 4-3(T2-R1) and 3-3(T3-R1) exit This saves the network construction time and energy. Fig. 4(a)
points and reader 2 are tracked using 1-1(T1-R2), 4-4(T2-R2), and 4(b) represents the network structure of interrogation zone
7-5(T3-R2), 10-2(T4-R2), 9-3(T5-R2) and 8-1(T6-R2) exit shown in Fig. 1 using two different geometric structures. Fig.
points as shown in fig. 3. As a result, reader 1 is present in 5 shows the process of constructing polar graphs of Fig. 4(a).
obstacle free areas 2, 4, 3 and 5 at time before T1-R1, T1-R1 Like the process shown in Fig. 3, Fig. 5 also constructing
to T2-R1, T2-R1 to T3-R1 and after T3-R1 respectively. interfaces. In this example, reader 1 moves from 1-1 and 2-2
Similarly, reader 2 is present in obstacle free areas 1, 4, 7, 10, exits at time T1-R1 and T2-R2 respectively. Thus, reader 1 is
9, 8 and 6 at time before T1-R2, T1-R2 to T2-R2, T2-R2 to present in cell 1, cell 2 and cell 3 at time before T1-R1, T1-R1
T3-R2, T3-R2 to T4-R2, T4-R2 to T5-R2, T5-R2 to T6-R2 to T2-R1 and after T2-R1 respectively. It is observed that
and after T6-R2 respectively. Both vertical and horizontal constructing polar graphs in obstacle-free zone consumes
polar graphs are necessary for predicting the mobility of lesser time and energy compared to obstacle-zone.
readers. The timestamps while creating the nodes in polar
graphs predict the movements.

Figure 4(a): Polar graphs with rectangles
Figure 4(b): Polar graphs with squares
Figure 4: Polar graphs of network structure when radio waves
can penetrate through obstacles (case-2)
Figure 5: Counter example of polar graphs of network
structure when radio waves can penetrate through obstacles
(case-2)
B. Execute Simulated Annealing based Linear Ordering
Algorithm for Anti-collision Protocol
Polar graph gives the locations of readers and tags when
mobile. During the construction of polar graph, information
about presence of multiple readers in obstacle free zone is
collected. This information helps in selecting the interrogator
Step 1: Initialization The process of drawing obstacle free or
fixed cell network structure start with randomly selected
location.
Step 2: Count the readers After drawing the polar graphs
from network structure, this process counts the readers per
obstacle free zone.
Step 3: Calculate gain score The gain score is calculated
with objective taken into consideration. As discussed earlier,
objective may be to minimize the energy consumption,
maximize the neighboring nodes etc. This gain score is updated
on regular basis.
Step 4: Select a reader per obstacle free area or cell
Simulated annealing gives the global optimum result. This
process takes gain into consideration for providing the global
optimum result in reader selection. Since gain score is updated
regularly, thus selection of reader also varies with time.
Step 5: Update The value of gain score is regularly updated
and of two or more readers have same value then random
process decides the interrogator.
Step 6 Repeat The process of interrogator selection continues
until interrogation time expires or all tags are identified.
Algorithm 1 of linear ordering with simulated annealing
(for readers) explains the selection of interrogator among
readers in obstacle-free zone. Similarly, algorithm 2 of linear
ordering with simulated annealing (for readers) explains the
selection of interrogate tag among multiple responding tags. In
algorithm 1, first interrogator in every obstacle free area is
randomly selected based on seed value. This process of random
selection in first interrogation cycles give take to centralized
server for calculating the gain score which improves the
network performance also. After first interrogation cycle,
centralized server collects the distances between readers in
every obstacle-free zone. If the differences are positive i.e.
interrogation ranges of readers are not colliding then everyone
get the chance of interrogation in next interrogation cycle else
if the difference is negative then gain score is calculated. In
calculating the gain, distance between readers is computed first
followed by maximum number of neighboring nodes, energy
efficiency and distance to cover. In worst case, if all parameters
are same then a contiguous channel allocation procedure
uniformly distributed the available channels.
Algorithm 1: Linear Ordering with Simulated Annealing (for
readers)
1. R: Set of all readers
through linear ordering algorithm with game theory. The game 2. O6HTXHQFHRIUHDGHUVVHOHFWLRQLQLWLDOO\HPSW\
is to maximize the gain in terms of energy consumption, 3. : interference range of ith reader
network performance, handling maximum number of 4. Dij: distance between ith and jth readers
neighboring nodes etc. These are considered as simulated 5. Begin
annealing parameters. Although the objective of gain varies 6. Seed:= Select seed reader
with simulated annealing parameter but there are common set 7. O:=[Seed]
of procedures followed through linear ordering algorithm. The 8. R:=R-{Seed}
steps of linear order algorithms include initializing the location 9. Repeat
identification process, count the readers in obstacle free zones, 10. For each reader ri R do
calculating the gain score, selecting the reader with global 11. Compute the gain for selecting reader ri
optimum solution and updating the gain score. These steps are
12.  := Dij - -
explained as follows.
13. If  is negative then 21. Choose another c
14. Select another ri and compute gain 22. Else if all c C are busy then
15. End for each 23. Wait for slots
16. Select the reader r with maximum gain 24. End for each

17. If there is a tie then 25. Compute Amax =
18. Select the reader which has maximum 26. End for each
neighboring tags 27. End for each
19. If there is a tie then In order to improve network performance, algorithm 2
20. Select the reader that has the maximum proposes a linear ordering algorithm with simulated annealing.
energy efficiency Like in algorithm 1, this algorithm also starts with a seed tag
21. If there is a tie then which is randomly selected tag. During first interrogation
22. Select the reader that expect to cycle, this tag respond to interrogator and centralized server
cover least number of obstacle free computes the gain. The criteria for computing gain uses
areas or cells minimum energy efficiency followed by distance from
23. If there is a tie then interrogator and then distance from obstacles. After first
24. Select the reader that cover interrogation cycle, centralized server selects interrogate tag
least distance using the gain. If there is tie between two or more tags then
25. Else centralized server selects one random tag only.
26. Run the Algorithm 2: Linear Ordering with Simulated Annealing (for
Slot_Allotment_Proce tags)
dure for multiple 1. T: Set of all tags
readers 2. O: Sequence of tags VHOHFWLRQLQLWLDOO\HPSW\
27. O:=[r] (append r to the ordered sequence 3. Begin
28. R:=R-{r} 4. Seed:= Select seed tag
29. Until R= 5. O:=[Seed]
30. End 6. T:=T-{Seed}
In Step 26th of algorithm1, channels are uniformly 7. Repeat
distributed among readers. The procedure 1 i.e. 8. For each tag t T do
Slot_Allocation_Procedure() explains the uniform distribution 9. Compute the gain for selecting tag t
process. Every reader gives its requests for interrogation with 10. gainr := number of seconds spend when t
priority. Now, if number of channels is same as number of has not responded
readers then each reader gets one channel else if number of 11. End for each
channels are less than readers then channels are allocated on 12. 6HOHFWWKHWDJW with maximum gain
priority basis. The readers are assigned channel on first come 13. If there is a tie then
and first serve basis and if no channel is available then readers 14. Select the reader that has the minimum
KDYHWRZDLWIRUVORWV energy efficiency
Procedure 1: Slot_Allotment_Procedure() 15. If there is a tie then
1. C: Number of channels 16. Select the tag that has maximum
2. Ai: Allocation vector for ith channel distance from reader
3. Pi : Priority of ith channel 17. If there is a tie then
4. NR : total readers 18. Select the tag that is nearer to
5. Dij : request vector for ith reader with jth priority obstacles
6. : Number of slots assigned to reader at stretch 19. Else
7. For each channel c C do 20. Randomly select one tag as
8. Ac = 0 desired
9. End For each 21. O:=[t] (append t to the ordered sequence
10. For each priority p P do 22. T:=T-{t}
11. For each reader r NR do 23. Until T=
12. If Dij of r is 0 then 24. End
13. Skip IV. ANALYSIS OF RESULTS
14. Else
15. For each channel c C do In simulation analysis, a large network is constructed for
16. If c is free then creating a highly dense network. Simulation parameters used
17. Assign slots to r on channel c for analysis are shown in table 1. For comparative analysis, six
state-of-art protocols are selected. These protocols are Lin et.
18. Increment Ac = Ac+
et. al. [8], Hung et. al. [9], Tian et. al. [10], Ko [11], Tao et. al.
19. Decrement Dij = Dij -
[13] and Alonso et. al. [14]. The performance analysis is
20. Else if c is busy then explained as follows.
 Table 1: Simulation Parameters >

E
,
Parameters Value
d
Number of Readers 1000

<
Number of Tags 100000
d
Channel Type WirelessChannel

Radio Propagation Model TwoRayGround
W
Network Interface WirelessPhy EZ W
MAC Type 802.11
Figure 7: Comparative analysis of number of cycles required
Interface Queue Priority Queue for 100000 tags identification
Antenna OmniAntenna
>

E/>
Max Packets in Queue 50 ,


X dimension of the topography 1000 meters d

Y dimension of the topography 1000 meters <

Mobility Model Random WayPoint d


Data Rates 5 packets/second
W
Packet Size 512 bits EZ W

Simulator ns-3[15] Figure 8: Comparative analysis of number of IDLE cycles

Simulation Time 1000sec while identifying 100000 tags
Number of slots assigned to reader at 1 The number of successful interrogation cycles increases
stretch () with increase in readers as shown in Fig. 9. This increase is
5 msec. because of distance parameter taken into consideration during
Time of each slot
gain calculation. Further, uniform channels distribution also
fulfills the requests of multiple readers. The success of
As shown in Fig. 6, TIR analysis shows that the proposed proposed protocol in dense network shows that the solution is
protocol is better than state-of-art protocols. Results show that scalable with better performance.
TIR is reader dependent i.e. increase in number of readers
>
increases the TIR. However, 100% TIR is impossible because
/

,
interrogation time may expire before tag identification.
E

d
>

<
,
d/Z

d d

< 
d
EZ W
 W

EZ
W
W
Figure 9: Comparative analysis of number of successful
interrogation cycles for identifying 100000 tags
Figure 6: Comparative analysis of TIR
>
E

Number of cycles required for identifying tags decreases ,

with increase in number of readers as show in Fig. 7. This is
because of increase in tags increases the number of readers in d

obstacle-free zone which in-turn increases the chances of more <

tag identification. A comparative analysis with state-of-art d

protocols shows that the uniform distribution process of
channels give better performance to proposed protocol. The 

comparative analysis of number of IDLE cycles during W

EZ
interrogation is shown in Fig. 8. The increase in number of W

reader increases the chances of presence of multiple readers at
same location but use of uniform channel distribution process
increases the chances of channels allocation. If waiting time is
small e.g. 5 msec. then readers frequently get the interrogation
cycle which reduces the number of IDLE cycles and improves
the performance also.
Figure 10: Comparative analysis of reader-to-reader collisions
The comparative reader-to-reader collision analysis shows
that the proposed scheme does not give provision for a
collision rather it sends a control message to wait until any
channel gets free. As shown in Fig. 10, the proposed protocol
reduces reader-to-reader collisions with increase in number of to tag, distance to move, count of covering least number of
readers and it is same as other state-of-art protocols. obstacle free areas etc. These parameters are different from
However, other protocols may goes into IDLE state after tags which include energy efficiency, distance from selected
collision whereas the proposed protocol uses uniform channel reader and distance from obstacles. The network performance
allocation procedure which improves its performance. parameters like tag identification ratio, total successful
The comparative analysis of number of packets sent by interrogation cycles total time cycles, total IDLE cycles, total
readers show that the proposed protocol has lesser number of number of collisions, delay, and total number of packets sent
transmitted packets compared to other protocols as shown in and received show that the proposed protocol is better than
Fig. 11. The number of packets sent is lesser for proposed other protocols. Simulation of large network shows that the
scheme because it does not ask to re-send request after proposed protocol is suitable for dense network. Further, read-
collision rather put them on wait until channel get free. Further, to-reader collision analysis shows contiguous and uniform
increases in repeated requests increases the usage of channels channel distribution scheme give zero collision network.
which in-turn increases the collisions and decreases the
performance of other protocols. REFERENCES
[1]. $ .XPDU . *RSDO DQG $ $JJDUZDO Design and Analysis of
>
Lightweight Trust Mechanism for Secret Data using Lightweight
EW

, Cryptographic Primitives in MANETs ,QWHUQDWLRQDl Journal of

Network Security, vol. 18, iss. 1, pp. 1-18, 2016.
^

d
[2]. A. Kumar, . *RSDO DQG $ $JJDUZDO A Novel Trusted Hierarchy
<
Construction for RFID-Sensor Based Secure Mobile Ad Hoc
d NETworkds 0$1(7V XVLQJ (UURU &RUUHFWLQJ &RGHV (&&V

Electronics Telecommunication Research Institute Journal (ETRI
Journal), vol. 37, iss. 1, pp. 186-196, 2015.

W [3]. The Basics of RFID Technology:

W
EZ
Figure 11: Comparative analysis of number of packets sent by
readers
A similar trend is observed in comparative analysis of
number of packets received by readers as shown in Fig. 12. A
network performance is considered to be best if number of
requests is close to number of identified tags which is the case
of proposed scheme. This scheme does not allow collisions to
occur which in turn increases the chances of maximum
requests handled per execution. The increase in number of
packets received with increase in readers is because uniform
channel distribution process continuously gives chance to
waiting readers for interrogation.
>
EW
http://www.rfidjournal.com/articles/view?1337/2
[4]. A. Kumar, K. Gopal aQG $ $JJDUZDO 'HVLJQ DQG $QDO\VLV RI
/LJKWZHLJKW 7UXVW 0HFKDQLVP IRU $FFHVVLQJ 'DWD LQ 0$1(7V .6,,
Transactions on Internet and Information Systems, vol. 8, iss. 3, pp.
1119-1143, March 2014.
[5]. $.XPDU.*RSDODQG$$JJDUZDO2XWOLHU'HWHFWLRQDQGTreatment
IRU /LJKWZHLJKW 0RELOH $G +RF 1HWZRUNV ,QW &RQI RQ
Heterogeneous Networking for Quality, Reliability, Security and
Robustness (QSHINE 2013), Gautam Budh University, Greater Noida,
India, pp 750-763, 2013.
[6]. D. K. Klair, K.-: &KLQ 5 5DDG $ Survey and Tutorial of RFID
Anti-&ROOLVLRQ 3URWRFROV ,((( &RPPXQLFDWLRQV 6XUYH\V  7XWRULDOV
vol. 12, iss. 3, pp. 400-421, April 2010.
[7]. ) *DQGLQR 5 )HUUHUR % 0RQWUXFFKLR DQG 0 5HEDXGHQJR '&16
An Adaptable High Throughput RFID Reader-to-Reader Anticollision
3URWRFRO ,((( 7UDQVDFWLRQVRQ3DUDOOHODQG'LVWULEXWHG6\VWHPVYRO
24, No. 5, May 2013.
[8]. C.-F. Lin and F. Y.-6/LQ$6LPXODWHG$QQHDOLQJ$OJRULWKPIRU5),'
5HDGHU 1HWZRUNV  ,((( :LUHOHVV &RPPXQLFDWLRQV DQG

, Networking Conference, Kowloon, Hong Kong, pp. 1669-1672, March
Z

d
2007.
[9]. S.-W. Hung, J. Sum, Y.-f Huang, "Empirical analysis on the application
< of simulated annealing for RFID reader networks", IEEE Conference on

d Soft Computing in Industrial Applications 2008 (SMCia '08)., Muroran,
Japan, pp. 177 181, June 2008.
 [10]. -7LDQ<)DQ<=KX.+X5),'UHDGHUDQWL-collision using chaos

W QHXUDO QHWZRUN EDVHG RQ DQQHDOLQJ VWUDWHJ\ th World Congress on

W Intelligent Control and Automation 2008 (WCICA 2008), Chongqing,

EZ
Figure 12: Comparative analysis of number of packets
received by readers
V. CONCLUSION
In this work, it is analyzed that reader-to-reader and tag-to-tag
collisions are major challenges in RFID identification process.
This problem can be efficiently handled using linear ordering
and simulation annealing. The simulation annealing
parameters used to provide global optimum result for readers
include energy efficiency, distance between readers or reader
China, pp. 6128-6132, une 2008.
[11]. & + .R '-Web-GIS RFID Location Sensing System for
&RQVWUXFWLRQ 2EMHFWV 7KH 6FLHQWLILF :RUOG -RXUQDO YRO  DUWLFOH
ID: 217972, pp. 1-8, 2013.
[12]. =/L-/L&+H&7DQJ-=KRX5),'UHDGHU-to-reader collision
avoidance model with multiple density tag distribution solved by
DUWLILFLDO LPPXQH QHWZRUN RSWLPL]DWLRQ -RXUQDO RI $SSOLHG 6RIW
Computing, vol. 30, iss. C, May 2015.
[13]. 07DR6+XDQJ</L0<DQ<=KRX6$-PSO based optimizing
reader deployment in large-scale RF,' 6\VWHPV -RXUQDO RI 1HWZRUN
and Computer Applications, vol. 52, pp. 90-100, June 2015.
[14]. J. V. Alonso, F. J. Parrado-*DUFLD--$OFDUD]26/$QRSWLPL]DWLRQ-
based scheduler for RFID Dense-5HDGHU (QYLURQPHQWV $G +RF
Networks, vol. 37, iss. 2, pp. 512-525, Feb. 2016.
[15]. NS-3 Simulator: https://www.nsnam.org/