IDTree: Concise Hierarchical Data Representation for ResourceConstrained Smart Objects For Smart Object (SO) in Internet of Everything, especially for barcode and RFID tags in supply Chains, the interoperability, scalability and high efficiency is critical to store and exchange semistructured data among SOs. However, current methods either are too heavyweight, or cannot represent hierarchical data model flexibly on demand, and they cannot meet the requirement of resourceconstrained SOs. This paper presents a bytealigned concise IDTree method to represent hierarchical data based on metadata identifiers, with IDValue associations and specific nonprinting characters to control data structure, for resourceconstrained SOs. After introducing the overview of IDTree method, the paper presents the representations for two types of nodedata, then represent treelike structure with generalized list method. Finally, a practical hierarchical data example is given to illustrate the method in detail.

Dynamic Query Tree AntiCollision Protocol for RFID Systems Radio frequency identification (RFID) has been widely used in various areas, such as logistics, healthcare, manufacture and so on. However, tag collision problem greatly affects the performance of RFID systems by reducing bandwidth utilization and increasing identification delay etc. In this paper, we propose a dynamic query tree anticollision (DQTA) protocol, which dynamically adjusts the number of subgroups of each collision slot. Based on the number of consecutive colliding bits in tag response k, DQTA splits colliding tags into 2k subgroups. Dividing colliding tags into more appropriate subgroups, the number of collision slots and transmitted message bits are effectively reduced. Comparing with the most related stateofart works, the proposed DQTA protocol can identify tags with less time and fewer transmitting message bits.