Jihoon Myung

Adaptive binary splitting for efficient RFID tag anti-collision

Tag collision arbitration for passive RFID tags is a significant issue for fast tag identification. This letter presents a novel tag anti-collision scheme called adaptive binary splitting (ABS). For reducing collisions, ABS assigns distinct timeslots to tags by using information obtained from the last identification process. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols.

Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification

Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a readers identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an Adaptive Query Splitting protocol (AQS), which is an improvement on the query tree protocol, and an Adaptive Binary Splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols.

Adaptive splitting protocols for RFID tag collision arbitration

Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags simultaneously transmit their IDs to a reader, the tag signals collide and this collision disturbs the readers identification process. Therefore, tag collision arbitration for passive RFID tags is a significant issue for fast identification. This paper presents two adaptive tag anti-collision protocols, an Adaptive Query Splitting protocol (AQS), which is an improvement on the query tree protocol and an Adaptive Binary Splitting protocol (ABS), which is based on the binary tree protocol, which is a de facto standard for RFID anti-collision protocols. To reduce collisions and identify tags efficiently, adaptive splitting protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree based tag anti-collision protocols.

Adaptive binary splitting: a RFID tag collision arbitration protocol for tag identification

In the RFID system, a reader recognizes tags through communications over a shared wireless channel. When multiple tags transmit their IDs at the same time, the tag-to-reader signals lead to collision. Tag collision arbitration for passive RFID tags is significant for fast identification since collisions disturb the readers identification process. This paper presents an Adaptive Binary Splitting (ABS) protocol which is an improvement on the binary tree protocol. To reduce collisions and identify tags efficiently, ABS uses information which is obtained from the last processes of tag identification. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols.

An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration

A radio frequency identification (RFID) reader recognizes objects through wireless communications with RFID tags. Tag collision arbitration for passive tags is a significant issue for fast tag identification due to communication over a shared wireless channel. This paper presents an adaptive memoryless protocol, which is an improvement on the query tree protocol. Memoryless means that tags need not have additional memory except ID for identification. To reduce collisions and identify tags promptly, we use information obtained from the last process of tag identification at a reader. Our performance evaluation shows that the adaptive memoryless protocol causes fewer collisions and takes shorter delay for recognizing all tags while preserving lower communication overhead than other tree based tag anticollision protocols

Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers

This paper proposes an adaptive and dynamic localized scheme unique to hierarchical clustering in RFID networks, while reducing the overlapping areas of clusters and consequently reducing collisions among RFID readers. Drew on our LLC scheme that adjusts cluster coverage to minimize energy consumption, low-energy localized clustering for RFID networks (LLCR) addresses RFID reader anti-collision problem in this paper. LLCR is a RFID reader anti-collision algorithm that minimizes collisions by minimizing overlapping areas of clusters that each RFID reader covers. LLCR takes into account each RFID readers energy state as well as RFID reader collisions. For the energy state factor, we distinguish homogeneous RFID networks from heterogeneous ones according to computing power of each RFID reader. Therefore, we have designed efficient homo-LLCR and hetero-LLCR schemes for each case. Our simulation-based performance evaluation shows that LLCR minimizes energy consumption and overlapping areas of clusters of RFID readers.

LSRP: a lightweight secure routing protocol with low cost for ad-hoc networks

Ad-hoc networks consist of only mobile nodes and have no support infrastructure. Due to the limited resources and frequent changes in topologies, ad-hoc network should consider these features for the provision of security. We present a lightweight secure routing protocol (LSRP) applicable for mobile ad-hoc networks. Since the LSRP uses an identity-based signcryption scheme, it can eliminate public or private key exchange, and can give savings in computation cost and communication overhead. LSRP is more computationally efficient than other RSA-based protocols because our protocol is based on the properties of pairings on elliptic curves. Empirical studies are conducted using NS-2 to evaluate the effectiveness of LSRP. The simulation results show that the LSRP is more efficient in terms of cost and overhead.

ISSRP: a secure routing protocol using identity-based signcryption scheme in ad-hoc networks

TWe present a secure routing protocol based on identity-based signcryption scheme in ad-hoc networks. Because the proposed protocol uses identity-based cryptography, it can eliminate storage consumption and a certificate of public key exchange. Also, our protocol has very short ciphertexts/signatures and efficient computation time than other protocols based on RSA because it uses pairings over elliptic curves. In addition, the signcryption scheme fulfills both the functions of digital signature and encryption, and it thus can give savings in computation cost and communication overhead.

Eliminating Duplicate Forwarding in Wireless Opportunistic Routing

Opportunistic routing is a wireless multi-hop routing approach that allows each packet to be relayed through any node that overhears the transmission. In this letter, we propose a method for avoiding duplicate forwarding in opportunistic routing. The proposed technique enables forwarding nodes to control relaying at their neighbors on a per-packet basis using a small amount of information piggybacked on packets. Our simulation results show that DFOR achieves higher throughput than existing relevant protocols by reducing unnecessary transmissions.

ESSHP: an enhanced semi-soft handoff protocol based on explicit node decision in cellular networks

Due to frequent handoff, Mobile IP has been confronted with some limitations. Cellular IP, one of micro-mobility protocols, was proposed to overcome these limitations and to provide good handoff performance. However, some drawbacks of Cellular IP like packet loss have been addressed. We propose an enhanced semi-soft handoff protocol based on a node’s decision to cope with these drawbacks. With a bi-casting mechanism based on an explicit node decision, the proposed protocol can achieve fast and seamless handoff.