Authors : C. Hema, Sharmila Sankar and Sandhya
Abstract: RFID is the technology that reads and captures the information from the tags attached to the objects with the use of radio waves. Reader collision is an obstruction in RFID and it is also a greater disadvantage in RFID system. The existing reader anti-collision algorithms like LEACH, HEED and DCHS leads to communication overhead and increase in time and energy consumption. A graph coloring based TDMA scheduling algorithm is proposed that reduces the reader collision and improves the throughput of the readers. Every the readers in the RFID network transmit their mobility and energy level to the base station for cluster head reader selection. The base station computes the average energy level of all the readers and ranks the cluster head. The cluster head reader is ranked based on the energy level, mobility of the readers, number of tags around it and the distance to the base station. The cluster head selection process is done with the firefly algorithm followed by coloring and scheduling the readers in the RFID network. When compared with the Priority Clustering Protocol (PCP), the proposed scheme saves the energy of the readers there by reducing the data loss and increasing the network life time.
C. Hema, Sharmila Sankar and Sandhya , 2017. Graph Coloring Based TDMA Algorithm for Scheduling the Readers in RFID Network to Avoid Reader Collision. Journal of Engineering and Applied Sciences, 12: 9528-9533.