A note on interference in random networks

作者：Devroye L; Morin P^*

来源：Computational Geometry-Theory and Applications, 2018, 67: 2-10.

DOI：10.1016/j.comgeo.2017.10.006

• Wireless network
• Interference
• Unit disk graph

The (maximum receiver-centric) interference of a geometric graph (von Rickenbach et al. 2005 [11]) is studied. It is shown that, with high probability, the following results hold for a set, V, of n points independently and uniformly distributed in the unit d-cube, for constant dimension d: (1) there exists a connected graph with vertex set V that has interference O((logn)(1/3)); (2) no connected graph with vertex set V has interference o((logn)(1/4)); and (3) the minimum spanning tree of V has interference Theta((logn)(1/2)).

• 单位
  McGill