Tag count based priority scheduling algorithm for mitigating the RFID collisions
RFID (Radio Frequency IDentification) is a developing technology that employs electromagnetic signals to send the data among reader and tags to identify categorize and track the moveable items. The objective of this paper is to mitigate the reader collision problem by scheduling the readers in RFID...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2020-04-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | RFID (Radio Frequency IDentification) is a developing technology that employs electromagnetic signals to send the data among reader and tags to identify categorize and track the moveable items. The objective of this paper is to mitigate the reader collision problem by scheduling the readers in RFID system. Mobile readers in the RFID network send the same frequency signal to the air to read the data from the tags. While these two signals interfere each other and Tags are unable to backscatter signal to the reader. This causes a reader collision problem. The Reader collision problem reduces the lifetime of the RFID network and generates redundant data in the RFID Network. Tag Count based Priority Scheduling algorithm is proposed, that enhances the throughput of the readers and mitigates the reader collision problem. In the cluster based RFID network, The Dragonfly algorithm performed the Cluster Head reader election and cluster construction process and then allotting the mobile readers in the cluster. This algorithm improves the energy efficiency and diminishes the reader collision problem, thereby alleviating the tag information loss and expanding the mobile RFID network life time, while compared with Priority Clustering Protocol and the Graph Coloring based TDMA algorithm. |
|---|---|
| Item Description: | https://ijeecs.iaescore.com/index.php/IJEECS/article/view/19472 |