{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:43:54Z","timestamp":1740120234266,"version":"3.37.3"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"name":"Inner Mongolia Autonomous Region Science and Technology Project","award":["20130432"],"award-info":[{"award-number":["20130432"]}]},{"name":"Scientific Research Foundation of Department","award":["NJZY17057"],"award-info":[{"award-number":["NJZY17057"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61363016"],"award-info":[{"award-number":["61363016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Nature Science Foundation of Inner Mongolia Antonymous Region","award":["2015ms0626","2015ms0605"],"award-info":[{"award-number":["2015ms0626","2015ms0605"]}]},{"name":"Basic Research Foundation of Inner Mongolia Agriculture University","award":["2015008"],"award-info":[{"award-number":["2015008"]}]},{"name":"Inner Mongolia Agriculture University, Huhhot","award":["010010"],"award-info":[{"award-number":["010010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:p> Capture effect is a very common phenomenon in wireless channel. By using capture effect, the collision tags can be identified in a certain probability, so the identification efficiency and speed of the system can be improved. In this paper, we extend the Maximum a Posterior probability method to capture effect environment and propose a novel tag anti-collision algorithm MAPCE for RFID tags identification. The proposed algorithm can not only estimate the number of tags, but also estimate the capture effect probability. Based on the estimation, we can derive the optimal frame length in the tag identification systems. The experimental results show that when the tags\u2019 number is larger than 600 and less than 1000, the proposed algorithm has lower computational complexity and lower estimation error rate. <\/jats:p>","DOI":"10.1142\/s0218001420500111","type":"journal-article","created":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T05:59:22Z","timestamp":1562219962000},"page":"2050011","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Maximum a Posterior-Based Estimation Method Coping with Capture Effect for RFID Tags Identification"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4102-6675","authenticated-orcid":false,"given":"Liqian","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Computer and Information Engineering, Inner Mongolia Agriculture University, Inner Mongolia 010018, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueliang","family":"Fu","sequence":"additional","affiliation":[{"name":"College of Computer and Information Engineering, Inner Mongolia Agriculture University, Inner Mongolia 010018, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honghui","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer and Information Engineering, Inner Mongolia Agriculture University, Inner Mongolia 010018, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, North Dakota State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"key":"S0218001420500111BIB001","first-page":"63","volume-title":"Proc. Int. Conf. Parallel Distrib. Syst. Comput.","volume":"2","author":"Cha J.-R.","year":"2005"},{"key":"S0218001420500111BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.917093"},{"key":"S0218001420500111BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2334317"},{"key":"S0218001420500111BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2257756"},{"key":"S0218001420500111BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2441052"},{"key":"S0218001420500111BIB006","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1499-2012-268"},{"key":"S0218001420500111BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/9780470665121"},{"issue":"9","key":"S0218001420500111BIB008","first-page":"1958004","volume":"32","author":"Kangshun L.","year":"2018","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"S0218001420500111BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2837692"},{"key":"S0218001420500111BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.02.080571"},{"key":"S0218001420500111BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.05.002"},{"key":"S0218001420500111BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.03.092208"},{"first-page":"75","volume-title":"Proc. 4th ACM Int. Workshop Discrete Algorithms and Methods for Mobile Computing and Communications","author":"Law C.","key":"S0218001420500111BIB013"},{"key":"S0218001420500111BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.011311.101332"},{"key":"S0218001420500111BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1603365"},{"key":"S0218001420500111BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2005.213"},{"key":"S0218001420500111BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001496000517"},{"key":"S0218001420500111BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095854"},{"key":"S0218001420500111BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2014.2330418"},{"key":"S0218001420500111BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2012.03.060"},{"first-page":"98","volume-title":"Proc. Int. Conf. Pervas. Comput.","author":"Vogt H.","key":"S0218001420500111BIB022"},{"key":"S0218001420500111BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2396911"},{"key":"S0218001420500111BIB024","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2042957"},{"key":"S0218001420500111BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2014.2339653"},{"key":"S0218001420500111BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.082413.130765"},{"key":"S0218001420500111BIB027","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-169110"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001420500111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T08:33:04Z","timestamp":1590481984000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001420500111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,26]]},"references-count":26,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["10.1142\/S0218001420500111"],"URL":"https:\/\/doi.org\/10.1142\/s0218001420500111","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2019,8,26]]}}}