{"title":"一种基于八叉树的分组编码RFID防碰撞算法","authors":"Shaoqing Zhu, Xiaofang Jin, Libiao Jin","doi":"10.1109/ICSESS.2015.7339167","DOIUrl":null,"url":null,"abstract":"In order to improve the communication efficiency of tree-based algorithms, this paper proposes the octree-based grouping recoding (OGR) algorithm. The OGR algorithm puts forward a method by dividing the original encoding of tag into groups firstly, then recoding every group. The simulation results show that compared with the latest quad-tree-based advanced (QA) anti-collision algorithm, OGR algorithm decreases the searching timeslots by about 13% and reduces the transmission date by about 15%. Meanwhile the communication efficiency is greatly improved nearly 69%.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A octree-based grouping recoding RFID anti-collision algorithm\",\"authors\":\"Shaoqing Zhu, Xiaofang Jin, Libiao Jin\",\"doi\":\"10.1109/ICSESS.2015.7339167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve the communication efficiency of tree-based algorithms, this paper proposes the octree-based grouping recoding (OGR) algorithm. The OGR algorithm puts forward a method by dividing the original encoding of tag into groups firstly, then recoding every group. The simulation results show that compared with the latest quad-tree-based advanced (QA) anti-collision algorithm, OGR algorithm decreases the searching timeslots by about 13% and reduces the transmission date by about 15%. Meanwhile the communication efficiency is greatly improved nearly 69%.\",\"PeriodicalId\":335871,\"journal\":{\"name\":\"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"176 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2015.7339167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2015.7339167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A octree-based grouping recoding RFID anti-collision algorithm
In order to improve the communication efficiency of tree-based algorithms, this paper proposes the octree-based grouping recoding (OGR) algorithm. The OGR algorithm puts forward a method by dividing the original encoding of tag into groups firstly, then recoding every group. The simulation results show that compared with the latest quad-tree-based advanced (QA) anti-collision algorithm, OGR algorithm decreases the searching timeslots by about 13% and reduces the transmission date by about 15%. Meanwhile the communication efficiency is greatly improved nearly 69%.