Show simple item record

dc.contributor.convenorB. Mans and M. Reynoldsen_AU
dc.contributor.authorPupunwiwat, Prapassaraen_US
dc.contributor.authorStantic, Belaen_US
dc.contributor.editorB. Mans and M. Reynoldsen_US
dc.date.accessioned2017-04-24T08:20:07Z
dc.date.available2017-04-24T08:20:07Z
dc.date.issued2010en_US
dc.date.modified2010-07-08T08:09:05Z
dc.identifier.refurihttp://www.comp.mq.edu.au/conferences/acsc10/en_AU
dc.identifier.urihttp://hdl.handle.net/10072/31362
dc.description.abstractRadio-Frequency Identification (RFID) systems consist of tags and networked electromagnetic readers. Despite the emergence of RFID technology, the problem of identifying multiple tags, due to the Collisions is still a major problem. The problem can be solved by using anti-collision methods such as /emph{ALOHA-based} approaches and Tree-based approaches. ALOHA-based approaches suffer from tag starvation, which causes that not all tags can be identified. The tree-based approaches suffer from too long identification delay caused by lengthy queries during identification process. In this paper, we propose a tree-based anti-collision method called ``Joined Q-ary Tree'', which adaptively adjusts tree branches according to tag movement behavior and number of tags within an interrogation zone. In this empirical study, we demonstrate that the proposed method is suitable for numerous scenarios. It requires less queries issued per complete identification than existing approaches while ensuring identification of all tags within the interrogation zone.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent220286 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherAustralian Computer Societyen_US
dc.publisher.placeSydney Australiaen_US
dc.publisher.urihttp://www.comp.mq.edu.au/conferences/acsc10/en_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencenameThe Thirty-Third Australasian Computer Science Conferenceen_US
dc.relation.ispartofconferencetitleProceedings of the Thirty-Third Australasian Computer Science Conference (ACSC 2010)en_US
dc.relation.ispartofdatefrom2010-01-18en_US
dc.relation.ispartofdateto2010-01-22en_US
dc.relation.ispartoflocationBrisbane, Australiaen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchDatabase Managementen_US
dc.subject.fieldofresearchcode080604en_US
dc.titleJoined Q-ary Tree Anti-Collision for Massive Tag Movement Distributionen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2010, Australian Computer Society, Inc. This paper appeared at the Thirty-First Australasian Computer Science Conference (ACSC2010), Brisbane, Australia. Conferences in Research and Practice in Information Technology (CRPIT), Vol. 102. B. Mans and M. Reynolds, Eds. Reproduction for academic, not-for profit purposes permitted provided this text is included.en_AU
gro.date.issued2010
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record