Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. ,  propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions,  demonstrate that the proposed algorithm achieves at least 10% improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases.
['Hyunho Koh', 'Sangki Yun', 'Hyogon Kim']
I am writing a research paper on a idea Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags
[{"from": "human", "value": "I am writing a research paper on a idea Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. ,  propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions,  demonstrate that the proposed algorithm achieves at least 10% improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases."}]