RFID PROTOCOL

Improving efficiency of Passive RFID tag anti-collision protocol using splitting and dynamic BTSA

Algorithm

Final seminar

Mirza Ammar Yasir (09MECSN22) Supervisor Prof: Dr Tariq Jamil Khanzada Co-supervisor Syed Naveed Ahmed Jafri

1

2

Outline Introduction

Anti-collision Algorithms Problem Statements Objective Conventional Algorithms Methodology Tools/Results Conclusion Future work References

3

Introduction

• RFID (radio frequency identification) is a low power and low-cost wireless communication technology that provide automatic identification and data collection.

• RFID use Radio Frequency

• store, send and process information

How does RFID work?

• Sends

• receive information • Small chip

• Attached with object

Reader TAG Data

Timing

energy

Application

network • To mange Reader

master

master

slave slave

5

Problem Statements

• Identification time increases due to

– Collision

– Idle slots

– Number of iteration

• Anti-collision Algorithm has limited computation and status information

6

Objective

• Aim, Improving efficiency of RFID Anti- collision algorithm

– Reduce Identification time of tags using Modified algorithm

• Modifying the Dynamic BTSA Algorithm with M ary Splitting Algorithm

Anti-Collision Algorithm

• When reader sends command to the tags for the communication purpose – Collisional response

– Successful response

– Idle response

• If response simultaneously

• Run anti-collision algorithm for resolving collisional slot and Idle slot

Conventional Algorithms(CA)

BTSA

Algorithm

Dynamic Frame

Adjustment

Binary Tree

M ary Splitting Algorithm

Optimal Splitting

Mechanism Tag Splitting

9

Advantages of CA

Ratio of collisional slot less than other, Due to dy:frame adjustment

Non estimation based algorithm

Dy: BTSA Algorithm

Non estimation based algorithm

Minimum identification time due to small duration of idle slots

M ary Splitting

Algorithm

10

Comparison of OS/BT

11

12

Proposed Algorithm

13

Methodology

Criteria

If # of slots < # of tags then collision is increases

If # of slots > # of tags then idle slots is increases

If # of slots =~ # of tags then successful slots is increases

14

Methodology (2)

15

• Dynamic method of BTSA algorithm

Frame adjustment

• Optimal splitting algorithm

Resolve collisional slot/idle

slot

Process of Modified Algorithm (3)

frame adjust dynamically

Fun:BTSA(L)

Divide the frame into # of slots

Fun:BTSA(L)

Slot randomly select by the Tag

collision and Idle response occur in the

slot

Resolve idle and collisional slot by OS

algorithm

Fun:Opt_spl( )

During resolve collided tag iteration

is produce

16

Flowchart of Modified Algorithm

17

18

Reader Broadcast start round message

Reader Get response from tag

Tag get msg and transmit response intialize

C=0 c≥0

Response?

Tag response

collision Idle slot

Q=min(15,Q+1) and

Dynamic(2^Q)

Fun: OS(L)

Fun: dy: BTSA(l)

Reader

success

Reader broadcast r=1

Tag get feedback message r from reader

Tag do C = C + Mopt_- 1

r=2? R=0 or 1: (C≥0)

reader run anti collision

algorithm OS( )

Iteration i=i+1counter

Resolve?

Transmit r=0 & run OS( )

R=2 : (c=0) Tag do C= C - 1

Tag Do C=C+Q End loop when c<0

yes

No

yes

Q=max(0,Q-1) and

DYBTSA(2^Q)

yes

Transmit r=2

No idle

End loop when c<0

19

Expected efficiency Improvement

• efficiency of modified algorithm depend upon the identify the tags in minimum time

• for improving the efficiency of RFID anti collision algorithm , the identification time should be minimum

• Identification time depend • Minimum Number of Collisional and idle slot

• Number of iteration

Tools Utilized

• Simulation of modified algorithm is designed under the mat lab environment

• The main parameter of simulation are reference from EPC class1 G2

20

Calculation Scenario

• Comparison Modified Algorithm with Dy: BTSA Algorithm

• Simulation results shows that the Modified Algorithm perform well than the Dynamic BTSA Algorithm

• We calculate – Identification Time

– Collisional and Idle Slot

– Number of Iteration

– Expected efficiency

21

Calculation Analysis

Identification Time number of Collision

and Idle Slots

Number of Iteration Expected efficiency

0 to 50 Tags , 0 t0 100 Tag

30 to 200 Tags ,100 to 500 Tags

22

MATLAB Functional Flowchart

23

Is input valid?

Start

User enter total number of tags

User select protocol

Determine user action

Determine User selected protocol

Declare arrays to hold value of T tags # for each scenario & T time for each scenario

No

Is simulation run for total # of tags, identification time

Calculate time

yes

modified BTSA

RESET

Is the simulation run for idle, collisional slot

Calculate idle slots& collisional slot for each scenario, Declare array to hold total idle slot & collision slot of each trail and assign total # of tags

No

Calculate efficiency for each scenario, Declare array to hold idle slot time successful & collisional slot time for each trail &assign slot time

Is the simulation run for total slots & efficiency?

Calculate total iteration for each scenario, Declare array to hold each trail of resolving tags slot and assign collisional slot time

Define number of trail for each scenario

No

yes

yes

yes

Modified

25

Set C value, initial Qfp & Q as 4,& assign & of tags

Is Q=0?

Round Qfp value to nearest integer & assigned to Q

Tags select random value b/w 0&2^q-1 for slot counter C

Determine # of tags respond for 0

slots

Qfp=max(0,Qfp-c) and calculate idle slot& id time

Qfp=min(0,Qfp+c) & calculate iteration&

collisional slot

Successful reply, current Q &Qfp unchanged,decrement1 from total tags,& calculate time & efficiency

Is the simulation run for # of iteration?

yes

No

Calculate Id: time of each trail

Calculate efficiency

Calculate # of iteration slot

Calculate total time

Calculate idle slot slots

Calculate total # of slot

Calculate collisional slots

STOP

Plot graph

1 tag

No tag More than 1

Results: Achievements

• Comparison Modified Algorithm with dynamic BTSA Algorithm using different Number of Tags

• Along X-axis show the Number of Tags

• Along Y-axis Show the Terms

26

Number of Collision (50 Tags)

27

Number of Iteration (0 to 50)

28

Number of Idle Slot (0 to 50 Tags)

29

Identification Time (0 to 50 Tags)

30

Expected Efficiency (0 to 50 Tags)

31

Result summary

32

# of tags Idle slots collision Total slot Id: time micro sec

# of iteration

Efficiency= Ts/S

0 to 50 31-38 29-30 112-120 140-180 80-90 0.4411-0.4201

Number of Collision (0 to 100 Tags)

33

Number of Iteration (0 to 100 Tags)

34

Number of Idle Slot (0 to 100 Tags)

35

Time Identification (0 to 100 Tags)

36

Expected Efficiency (0 to 100 Tags)

37

Results Summary

38

# of tags Idle slots collision Total slot Id: time micro sec

# of iteration

Efficiency= Ts/S

0 to 100 65-78 65-66 230-245 300-375 185-220 0.4301- 0.4113

Number of Collision (30 to 200)

39

Number of Idle Slot (30 to 200 Tags)

40

Number of Iteration (30 to 200)

41

Identification Time (30 to 200 Tags)

42

Expected Efficiency(30 to 200 Tags)

43

Number of Collision (100 to 500)

44

Number of Idle Slot (100 to500 Tags)

45

Number of Iteration (100 to 500)

46

Identification Time (100 to 500)

47

Expected Efficiency (100 to 500 Tags)

48

Results Summary

49

# of tags Idle slots collision Total slot Id: time micro sec

# of iteration Efficiency of M al:

Efficiency of DBTSA Al:

30 t0 200 125-153 131-128 455-480 500-650 360-450 0.4332-0.4161

0.4161

100 to 500 340-430 345-344 1100-1250 800-970 850-1050 0.4112-0.4001

0.4001

Conclusion

• Efficiency of Modified algorithm is increases

– when it produce less # of idle slot and # of iteration than the dynamic BTSA algorithm

– Replace binary Tree algorithm by optimal splitting algorithm

• Identification time of modified Algorithm also decrease than the Dynamic BTSA algorithm

50

Future Research Work

• Why collision occur? Because Reader does not know how many tags in reading zone

• In future, RFID technology may be neglected or replaced by any other technology, which reason behind will be collision problem

• So if we would like to preserve to RFID technology then should overcome to collision Utilizing AI for design the Intelligent reader

51

52

References • M Bolic/ David Simplot Ryc / Ivan stojmenovic, ”RFID: System Research Trends

and challenges," edition 1st, chapter 7& 8,pp181-228 , 2010 • H . Wu ,Y Zeng “BTSA algorithm for RFID tag anti collision protocol,”IEEE

transactions on parallel and distributed system,2012. • H . Wu ,Y Zeng “efficient frame slotted ALOHA protocol for RFID tag anti

collision,”IEEE transaction on automation science and engineering,2011. • Litain Duan/Wenwen pang ”An enhance posterior probabilty Anti-collision

Algorithm Based on Dynamic Frame Slotted AlOHA”journal of communication, Vol 9, No 10, Oct 2014

• C.M.leung ”M-ary RFID Tags Splitting with small Idle Slots,” IEEE transactions on automation science and Engineering,vol.9 No.1,january 2012

• Zhiyong Luo, ”An Approach of Adjusting Frame Size in Anti-Collision Algorithm for RFID System,” Key Laboratory of Network control & Intelligent Instrument,2011.

• M.H Desilva, ”Anti collision protocol for RFID system" Wichita state University,2010

• J. R. Cha and J. H. Kim, “Novel An'ti-collision Algorithms for Fast Object Identification in RFID System,” Proc. 11th Inter. Conf. on Parallel and Distributed Systems, Vol. 2, pp. 63-67, Jul. 2009..

• J. H. Choi, D. W. Lee and H. J. Lee, “Query Tree based Reservation for Efficient RFID Anti-Collision,” IEEE Communications Letters, Vol. 11, pp. 85-87Jan. 2007.

53