Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Conflict multiplicity estimation and batch resolution algorithms
IEEE Transactions on Information Theory
Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Data networks (2nd ed.)
Randomized algorithms
IEEE Communications Magazine
Collision-minimizing CSMA and its applications to wireless sensor networks
IEEE Journal on Selected Areas in Communications
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
IEEE Transactions on Mobile Computing
RFID-based networks: exploiting diversity and redundancy
ACM SIGMOBILE Mobile Computing and Communications Review
The optimization of framed aloha based RFID algorithms
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Identifying RFID tag categories in linear time
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Design and analysis of framed aloha based RFID anti-collision algorithms
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Performance evaluation of a multi-branch tree algorithm in RFID
IEEE Transactions on Communications
The optimal reading strategy for EPC Gen-2 RFID anti-collision systems
IEEE Transactions on Communications
Optimal framed Aloha based anti-collision algorithms for RFID systems
IEEE Transactions on Communications
RFID reader collision problem: performance analysis and medium access
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of active sensors in sensor networks, estimating the mean value contained in a group of sensors etc. Such inquiry solicits replies from possibly large number of terminals n. This necessitates the usage of algorithms for resolving batch conflicts with unknown conflict multiplicity n. In this paper we present a novel approach to the batch conflict resolution. We show how the conventional tree algorithms for conflict resolution can be used to obtain progressively accurate estimation of the multiplicity. We use the estimation to propose a more efficient binary tree algorithm, termed Estimating Binary Tree (EBT) algorithm. We extend the approach to design the Interval Estimation Conflict Resolution (IECR) algorithm. For n → ∞ we prove that the efficiency achieved by IECR for batch arrivals is identical with the efficiency that Gallager's FCFS algorithm achieves for Poisson packet arrivals. For finite n, the simulation results show that IECR is, to the best of our knowledge, the most efficient batch resolution algorithm reported to date.