We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic approach that schedules a subset of nodes for broadcasting information to their neighbors in every round. We compare several heuristic methods for assigning the node broadcast probabilities under a fixed number of transmissions per round. Furthermore, we introduce a pre-compensation method to correct the bias between the consensus value and the average of the initial values, and suggest possible extensions for our design. Our results are particularly relevant for developing communication-efficient consensus protocols in a wireless environment with limited frequency/time resources.

翻译：我们认为,在部分通信的无线网络中,可以分配平均的共识,以减少每个循环/循环的传输次数。考虑到无线频道的广播性质,我们建议一种概率办法,在每轮广播中将一组节点排到邻居那里。我们比较了将节点广播概率定在每轮固定数的传输次数之下的几种超常方法。此外,我们引入了一种预先补偿方法,以纠正共识值与初始值平均值之间的偏差,并建议可能延长我们的设计。我们的结果对于在频率/时间资源有限的无线环境中制定通信高效共识协议尤为重要。