A collision resolution algorithm for RFID using modified dynamic tree with Bayesian tag estimation

Wijayasekara, SK; Nakpeerayuth, S; Annur, R; Srichavengsup, W; Sandrasegaran, K; Hsieh, HY; Wuttisittikulkij, L

A collision resolution algorithm for RFID using modified dynamic tree with Bayesian tag estimation

Wijayasekara, SK Nakpeerayuth, S Annur, R Srichavengsup, W Sandrasegaran, K

Hsieh, HY Wuttisittikulkij, L

Permalink

Publication Type:: Journal Article
Citation:: IEEE Communications Letters, 2018, 22 (11), pp. 2238 - 2241
Issue Date:: 2018-11-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published VersionAdobe PDF (445.22 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Wijayasekara, SK	en_US
dc.contributor.author	Nakpeerayuth, S	en_US
dc.contributor.author	Annur, R	en_US
dc.contributor.author	Srichavengsup, W	en_US
dc.contributor.author	Sandrasegaran, K https://orcid.org/0000-0003-1270-5756	en_US
dc.contributor.author	Hsieh, HY	en_US
dc.contributor.author	Wuttisittikulkij, L	en_US
dc.date.available	2020-09-01T19:09:13Z
dc.date.issued	2018-11-01	en_US
dc.identifier.citation	IEEE Communications Letters, 2018, 22 (11), pp. 2238 - 2241	en_US
dc.identifier.issn	1089-7798	en_US
dc.identifier.uri	http://hdl.handle.net/10453/127795
dc.description.abstract	© 1997-2012 IEEE. A new tree-based anti-collision protocol for radio-frequency identification systems is proposed to achieve a very high tag identification efficiency. The proposed algorithm works in two phases. In the first phase, the number of competing tags is estimated through the proposed Bayesian estimation technique, while in the second phase, tags are identified using our modified dynamic tree algorithm. The system efficiency is mathematically derived and verified through simulation. Numerical results show that the proposed algorithm achieves a tag identification system efficiency of 45% and a time system efficiency of 78.5%, thus outperforming any existing collision resolution algorithms.	en_US
dc.relation.ispartof	IEEE Communications Letters	en_US
dc.relation.isbasedon	10.1109/LCOMM.2018.2865735	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	A collision resolution algorithm for RFID using modified dynamic tree with Bayesian tag estimation	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	22	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
utslib.for	0805 Distributed Computing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	open_access	*
pubs.issue	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	22	en_US

Abstract:

© 1997-2012 IEEE. A new tree-based anti-collision protocol for radio-frequency identification systems is proposed to achieve a very high tag identification efficiency. The proposed algorithm works in two phases. In the first phase, the number of competing tags is estimated through the proposed Bayesian estimation technique, while in the second phase, tags are identified using our modified dynamic tree algorithm. The system efficiency is mathematically derived and verified through simulation. Numerical results show that the proposed algorithm achieves a tag identification system efficiency of 45% and a time system efficiency of 78.5%, thus outperforming any existing collision resolution algorithms.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/127795