.png){kind=icon}
返回
An Optimal Greedy Algorithm for the Single Access Contention Resolution Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2902358.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Algorithms
contention resolution
greedy algorithms
optimization
random algorithms
wireless sensor networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏
Enhanced thermal conductivity and mechanical property through boron nitride hot string in polyvinylidene fluoride fibers by electrospinning通过电纺在聚偏氟乙烯纤维中通过氮化硼热丝增强热导率和机械性能
PREAI
分享收藏分享收藏分享收藏 没有更多内容
没有更多内容