{"title":"一种最优动态帧槽段算法","authors":"Litian Duan, Z. Wang, Fu Duan","doi":"10.1145/2757384.2757395","DOIUrl":null,"url":null,"abstract":"In a Radio Frequency Identification (RFID) System, collision issues occurred by multiple tags communicating with the reader simultaneously influence the system efficiency. Therefore, researching on the anti-collision algorithm to reduce the collisions and increase the system efficiency becomes a hotspot. After analyzing the pros and cons of some existing DFSA-based (dynamic frame-slotted ALOHA) anti-collision algorithms, we propose our algorithm in adjustment strategy and tag estimation method. To decrease the computation complexity, we define a parameter S to dynamically segment the frame into some reading units (each reading unit includes at least 1 time slot). Finally, the simulation shows that our algorithm outperforms the other algorithms in the throughput of tags/s (reading speed) and the system efficiency.","PeriodicalId":330286,"journal":{"name":"Proceedings of the 2015 Workshop on Mobile Big Data","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Optimal Dynamic Frame Slot-Segment Algorithm\",\"authors\":\"Litian Duan, Z. Wang, Fu Duan\",\"doi\":\"10.1145/2757384.2757395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a Radio Frequency Identification (RFID) System, collision issues occurred by multiple tags communicating with the reader simultaneously influence the system efficiency. Therefore, researching on the anti-collision algorithm to reduce the collisions and increase the system efficiency becomes a hotspot. After analyzing the pros and cons of some existing DFSA-based (dynamic frame-slotted ALOHA) anti-collision algorithms, we propose our algorithm in adjustment strategy and tag estimation method. To decrease the computation complexity, we define a parameter S to dynamically segment the frame into some reading units (each reading unit includes at least 1 time slot). Finally, the simulation shows that our algorithm outperforms the other algorithms in the throughput of tags/s (reading speed) and the system efficiency.\",\"PeriodicalId\":330286,\"journal\":{\"name\":\"Proceedings of the 2015 Workshop on Mobile Big Data\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 Workshop on Mobile Big Data\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2757384.2757395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Workshop on Mobile Big Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2757384.2757395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In a Radio Frequency Identification (RFID) System, collision issues occurred by multiple tags communicating with the reader simultaneously influence the system efficiency. Therefore, researching on the anti-collision algorithm to reduce the collisions and increase the system efficiency becomes a hotspot. After analyzing the pros and cons of some existing DFSA-based (dynamic frame-slotted ALOHA) anti-collision algorithms, we propose our algorithm in adjustment strategy and tag estimation method. To decrease the computation complexity, we define a parameter S to dynamically segment the frame into some reading units (each reading unit includes at least 1 time slot). Finally, the simulation shows that our algorithm outperforms the other algorithms in the throughput of tags/s (reading speed) and the system efficiency.