Analyzing Security of RFID Tag Reading Protocols Based on Binary Tree Traversal

2008 ◽  
Author(s):  
Gen-Yih Liao ◽  
Hsiu-Fen Hsieh
Keyword(s):  
Binary Tree ◽  
Rfid Tag ◽  
Tree Traversal

Non-recursive Algorithm Derivation and Formal Proof of Binary Tree Traversal Class Problems

2020 ◽  
Author(s):  
Zhengkang Zuo ◽  
Yue Fang ◽  
Qing Huang ◽  
Yunyan Liao ◽  
Yuan Wang ◽  
...  
Keyword(s):  
Binary Tree ◽  
Recursive Algorithm ◽  
Formal Proof ◽  
Tree Traversal

scholarly journals A Combinatorial Bijection on di-sk Trees

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Shishuo Fu ◽  
Zhicong Lin ◽  
Yaling Wang
Keyword(s):  
Binary Tree ◽  
Number Of Components ◽  
Symmetric Extension ◽  
Alternative Approach ◽  
Tree Traversal ◽  
Separable Permutations ◽  
Rooted Binary Tree ◽  
Schur Positive

A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial bijection on di-sk trees proving  the two quintuples $(\mathrm{LMAX},\mathrm{LMIN},\mathrm{DESB},\mathsf{iar},\mathsf{comp})$ and $(\mathrm{LMAX},\mathrm{LMIN},\mathrm{DESB},\mathsf{comp},\mathsf{iar})$ have the same distribution over separable permutations. Here for a permutation $\pi$, $\mathrm{LMAX}(\pi)/\mathrm{LMIN}(\pi)$ is the set of values of the left-to-right maxima/minima of $\pi$ and $\mathrm{DESB}(\pi)$ is the set of descent bottoms of $\pi$, while $\mathsf{comp}(\pi)$ and $\mathsf{iar}(\pi)$ are respectively  the number of components of $\pi$ and the length of initial ascending run of $\pi$.  Interestingly, our bijection specializes to a bijection on $312$-avoiding permutations, which provides  (up to the classical Knuth–Richards bijection) an alternative approach to a result of Rubey (2016) that asserts the  two triples $(\mathrm{LMAX},\mathsf{iar},\mathsf{comp})$ and $(\mathrm{LMAX},\mathsf{comp},\mathsf{iar})$ are equidistributed  on $321$-avoiding permutations. Rubey's result is a symmetric extension of an equidistribution due to Adin–Bagno–Roichman, which implies the class of $321$-avoiding permutations with a prescribed number of components is Schur positive.  Some equidistribution results for various statistics concerning tree traversal are presented in the end.

RFID Tag Anti-Collision Protocols

2012 ◽  
pp. 133-154 ◽  
Author(s):  
Ching-Nung Yang ◽  
Jyun-Yan He ◽  
Yu-Ching Kun
Keyword(s):  
Radio Frequency ◽  
Large Volume ◽  
Radio Frequency Identification ◽  
Binary Tree ◽  
Radio Frequency Field ◽  
Rfid Tag ◽  
Rfid System ◽  
Collision Problem ◽  
Query Tree ◽  
Frequency Identification

A tag collision problem (or missed reads) in Radio Frequency Identification (RFID) system happens when multiple tags respond to a reader simultaneously. At this time, the reader cannot differentiate these tags correctly. This problem is often seen whenever a large volume of RFID tags are read together in the same radio frequency field. Tag collisions will degrade identification efficiency, and this unreliable identification will compromise the usefulness of RFID system. This chapter introduces tag collision problem and discusses tag anti-collision protocols, including ALOHA-based protocol, Binary Tree (BT) protocol, and Query Tree (QT) protocol. To date, most tag anti-collision protocols are QT protocols. Thus, in this chapter, the authors briefly describe some elegant researches on QT protocols, and also introduce their recent research results on QT protocols.

Research of RFID Tag Anti-collision Algorithm based on Binary Tree

2014 ◽  
Vol 9 (9) ◽  
Author(s):  
Zhi Bai ◽  
Yigang He ◽  
Sainan Wang
Keyword(s):  
Binary Tree ◽  
Rfid Tag

Another representation of binary tree traversal

1973 ◽  
Vol 2 (2) ◽  
pp. 52-54 ◽  
Author(s):  
Edward N. Adams
Keyword(s):  
Binary Tree ◽  
Tree Traversal

Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms

2016 ◽  
Vol 19 (4) ◽  
pp. 2145-2156 ◽  
Author(s):  
Zhen You ◽  
Jinyun Xue ◽  
Zhengkang Zuo
Keyword(s):  
Binary Tree ◽  
Automatic Verification ◽  
Recursive Algorithms ◽  
Formal Derivation ◽  
Tree Traversal

A Novel Encryption of Text Messages using Two Fold Approach

2019 ◽  
Vol 13 ◽  
Author(s):  
T. Sivakumar ◽  
S Veeramani ◽  
M Pandi ◽  
Ganesh Gopal
Keyword(s):  
Binary Tree ◽  
Secure Communication ◽  
Text Messages ◽  
Digital Data ◽  
Security Threats ◽  
New Methods ◽  
Xor Operation ◽  
Tree Traversal ◽  
Encryption Method ◽  
Tree Traversals

Background: The amount of digital data created and shared via internet has been increasing every day. The number of security threats has also increased due to the vulnerabilities present in the network hardware and software. Cryptography is the practice and study of techniques to secure communication in the presence of third parties. Though there are several cryptosystems to secure the information, there is a necessity to introduce new methods in order to protect information from the attackers. Objective: To propose a new encryption method using Binary Tree Traversal (BTT) and XOR operation to protect the text messages. Method: The proposed method uses both transposition and substitution techniques for converting plaintext into ciphertext. The notion binary tree traversal is adapted as transposition and bitwise XOR operation is used for substitution. Results: The repeating letters appeared in the plaintext are replaced with different cipher letters and placed on different location in the cipher text. Hence, it is infeasible to identify the plaintext message easily. The time taken by the proposed method for encryption is very less. Conclusion: A simple encryption method using binary tree traversals and XOR operation is developed. Encrypting data using binary tree traversals is a different way while compared with other traditional encryption methods. The proposed method is fast, secure and can be used to encrypt short messages in real time applications.

Dynamic Interpretation Method of XML Configuration Strategy for IP Mode Measurement and Control System

2010 ◽  
Vol 139-141 ◽  
pp. 2537-2541
Author(s):  
Xiao Bin Hong ◽  
Gui Xiong Liu ◽  
Jian Long Xu
Keyword(s):  
Control System ◽  
Binary Tree ◽  
Ethanol Concentration ◽  
Tree Model ◽  
Measurement And Control System ◽  
Dynamic Interpretation ◽  
Tree Traversal ◽  
And Control ◽  
Measurement And Control ◽  
Interpretation Method

The interoperability among diversified ubiquitous sensor network platforms can be solved well by employing XML technology. According to the requirement that implementing accurately remote XML configuration strategy for spot equipments, a new dynamic interpretation method of XML configuration strategy is proposed. First, an XML-based IP mode measurement & control system is introduced. On the basis of realizing graphical strategy editor, the innovative ways and technologies of some key problems for dynamic interpretation method were especially discussed in this paper, including configuration strategy conversion combining preorder binary tree traversal with stack, XML strategy decomposition based on DOM tree model and dynamical update of XML configuration strategy. Finally, an application example in IP mode ethanol concentration measurement & control system is introduced. Experimental results show that the new method can greatly simplify conversion from measurement & control strategy to microinstructions, which saves system resources and improves greatly the speed of interpretation.

Sign in / Sign up

Export Citation Format

Share Document