Probabilistic optimal tree hopping for RFID identification
Authors:
Open Access
- 17 June 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 41 (1) , 293-304
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Efficient storage scheme and query processing for supply chain management using RFID2008
- Slotted Scheduled Tag Access in Multi-Reader RFID Systems2007
- RFID Technology and ApplicationsIEEE Pervasive Computing, 2006
- Redundant reader elimination in RFID systems2005
- Framed ALOHA for Multiple RFID Objects IdentificationIEICE Transactions on Communications, 2005
- LANDMARC: Indoor Location Sensing Using Active RFIDWireless Networks, 2004
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985
- On the instability of slotted ALOHA multiaccess algorithmIEEE Transactions on Automatic Control, 1983
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- The Detection of Defective Members of Large PopulationsThe Annals of Mathematical Statistics, 1943