| Resumen |
We present the greedy optimal algorithm for contention resolution (GOAL-CR), a greedy algorithm that solves a variant of the standard contention resolution problem where a set of nodes want to access a shared resource only once, and the objective is to minimize the time it takes for all the nodes to access the resource successfully. These assumptions hold, for instance, in event reporting applications or in the cluster formation phase of wireless sensor networks. We formally prove that the GOAL-CR computes access policies that minimize the expected contention resolution time. We also show, numerically, that the performance of the greedy policies is close to that of a protocol with complete information about the exact number of nodes that have not yet accessed the resource; this latter assumption is hard to fulfill in practice but allows the derivation of a lower bound for the problem. In addition, we show how to adapt the algorithm to scenarios where there is uncertainty in the initial number of nodes and to scenarios where nodes have very limited memory. Finally, we use simulations to show the robustness of the GOAL-CR against asynchronous starts. |
