An Optimal Greedy Algorithm for the Single Access Contention Resolution Problem

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.

[1]  Jyoti Prakash Singh,et al.  A Survey on Successors of LEACH Protocol , 2017, IEEE Access.

[2]  Marco Conti,et al.  A simple protocol for the dynamic tuning of the backoff mechanism in IEEE 802.11 networks , 2001, Comput. Networks.

[3]  Luca Benini,et al.  Wireless sensor networks: Enabling technology for ambient intelligence , 2006, Microelectron. J..

[4]  Marco Conti,et al.  Optimal capacity of p-persistent CSMA protocols , 2003, IEEE Communications Letters.

[5]  Yun Han Bae Analysis of Optimal Random Access for Broadcasting with Deadline in Cognitive Radio Networks , 2013, IEEE Communications Letters.

[6]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[7]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[8]  Guy Shani,et al.  Noname manuscript No. (will be inserted by the editor) A Survey of Point-Based POMDP Solvers , 2022 .

[9]  Fabrice Rouillier,et al.  Computing Real Roots of Real Polynomials ... and now For Real! , 2016, ISSAC.

[10]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[11]  Mario E. Rivero-Angeles,et al.  Transmission Probability Strategies for Cluster-Based Event-Driven Wireless Sensor Networks , 2017, 2017 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC).

[12]  Qassim Nasir,et al.  Adaptive Backoff Algorithm for IEEE 802.11 MAC Protocol , 2009, Int. J. Commun. Netw. Syst. Sci..