Scalable feedback for large groups
IEEE/ACM Transactions on Networking (TON)
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Robustness of Q-ary collision resolution algorithms in random access systems
Performance Evaluation
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Finding popular categories for RFID tags
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Adaptive binary splitting for a RFID tag collision arbitration via multi-agent systems
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
S-search: finding RFID tags using scalable and secure search protocol
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 754.84 |
The standard model of a multiple-access channel with ternary feedback is considered. When packets of a batch of k nodes initially collide, it is assumed that no a priori statistical information about k is available. An algorithm is presented and analyzed that enables the nodes to compute a statistical estimate of k. Combining the estimation procedure with tree algorithms leads to batch-resolution algorithms that resolve conflicts more efficiently than any other reported to date. Both complete-resolution and partial-resolution algorithms are presented