Merged Search Algorithms for Radio Frequency Identification Anticollision

Algorithm 1

Pseudo codes of the Binary Search Tree.

(1) /^∗binary search tree initialize and arbitrate∗

(2) main()

(3) {

(4)Initialize: BST = null;

(5)

(6) for each tag existing

(7)    {

(8)BST_insert (BST,D1);

(9)}

(10) BST_arbitration (BST,D1);

(11)}

(12)

(13) /^∗binary search tree initialize∗

(14)BST insert (BST:a binary search tree,Da:the ath bit of tagID)

(15) {

(16) if (𝑎=𝑘) then return tag;

(17)

(18) if (Da=0) then {

(19)            𝑎=𝑎+1;

(20)           BST_insert (left_subtree of BST,Da);

(21)          }

(22) if (Da=0) then{

(23)            𝑎=𝑎+1;

(24)           BST_insert (right_subtree of BST,Da);

(25)}

(26)}    

(27)

(28) /^∗binary search tree arbitrate∗

(29)BST_arbitration (BST:a binary search tree,Da:the ath bit of tagID)

(30){ 

(31)if (collision happened at Da)

(32)     then {

(33)𝑎=𝑎+1;

(34)BST_arbitration (left_subtree of BST,Da);

(35)BST_arbitration (right_subtree of BST,Da);

(36)}

(37) else ifentify the tagID;

(38)

(39) }