Computer networks
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
A Simulation Study of Retransmission Strategies for the Asynchronous Virtual Time CSMA Protocol
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
On the time complexity of broadcast communication schemes (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient algorithms for multiple access channels
Efficient algorithms for multiple access channels
Stability of binary exponential backoff
Journal of the ACM (JACM)
On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
IEEE Transactions on Computers
On contention resolution protocols and associated probabilistic phenomena
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Stochastic contention resolution with short delays
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks
IEEE Transactions on Computers
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
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
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Quasi-optimal energy-efficient leader election algorithms in radio networks
Information and Computation
Contention resolution with heterogeneous job sizes
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
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
Distributed anonymous function computation in information fusion and multiagent systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Immune size approximation algorithms in ad hoc radio network
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Random Structures & Algorithms
| Hi-index | 0.01 |
New, improved algorithms are proposed for regulating access to a multiple-access channel, a common channel shared by many geographically distributed computing stations. A conflict of multiplicity n occurs when n stations transmit simultaneously to the channel. As a result, all stations receive feedback indicating whether n is 0, 1, or ≥2. If n = 1, the transmission succeeds; whereas if n ≥ 2, all the transmissions fail. Algorithms are presented and analyzed that allow the conflicting stations to compute a stochastic estimate n* of n, cooperatively, at small cost, as a function of the feedback elicited during its execution. An algorithm to resolve a conflict among two or more stations controls the retransmissions of the conflicting stations so that each eventually transmits singly to the channel. Combining one of our estimation algorithms with a tree algorithm (of Capetanakis, Hayes, and Tsybakov and Mikhailov) then leads to a hybrid algorithm for conflict resolution. Several efficient combinations are possible, the most efficient of which resolves conflicts about 20 percent faster on average than any of the comparable algorithms reported to date.