首页>
外文OA文献
>Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
【2h】
Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
展开▼
机译:简要说明:通信不可靠的无线网络中的广播硬度
展开▼
免费
页面导航
摘要
著录项
引文网络
相似文献
相关主题
摘要
We prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ε(n − 1) rounds are required for success probability ε. In both cases, the bounds are proved for a network in which constant-time broadcast is possible.
展开▼