Collision Reduction Using Modified Q-Algorithm with Moving Readers in LED-ID System

Abstract

LED-ID (Light Emitting Diode-Identification) is one of the key technologies for identification, data transmission, and illumination simultaneously. This is the new paradigm in the identification technology environment. There are many issues are still now challenging to achieve high performance in LED-ID system. Collision issue is one of them. Actually this is the most significant issue in all identification system. LED-ID system also suffers from collision problem. In our system, collision occurs when two or more readers transmit data to tag at the same time or vice versa. There are many anti-collision protocols to resolve this problem; such as: Slotted ALOHA, Basic Frame Slotted ALOHA, Query Tree, Tree Splitting, and Q-Algorithm etc. In this paper, we propose modified Q-Algorithm to resolve collision at tag. The proposed protocol is based on Q-Algorithm and used the information of arrived readers to a tag from neighbor. The information includes transmitting slot number of readers and the number of readers that can be arrived in next slot. Our proposed protocol can reduce the numbers of collision slot and the successful time to identify all readers. In this paper our simulation and theoretical results are presented.

Interference Minimization Using Cognitive Spectrum Decision for LED-ID Network

“…LED-ID system works on two stages for data communication [4] . In the pre-identification stage reader is identified by tag and then reader sends a request for desired information.…”

Adaptive Bandwidth Allocation for QoS Guaranteed VLC Based WPAN

“…Coordinator which actually is a controller, controls the over all data communication procedure. It requires two stages for data communication [4] . In the pre-identification stage an user is identified by transmitter and then user sends a request for desired information.…”