ON THE CONNECTIVITY OF RADIO NETWORKS

被引：57

作者：

PIRET, P

机构：

[1] Philips Research Laboratory, 1348, Louvain-La-Neuve

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 05期

关键词：

CONNECTIVITY; COVERING; POISSON; CRITICAL RANGE; ONE AND 2-DIMENSIONAL;

D O I：

10.1109/18.133276

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The connectivity of a two-dimensional radio network as a function of the range of the transmitters is still an open problem. Recently, it has been conjectured that the critical range of this problem is the same as the one for the covering problem. The analysis of the one-dimensional problem makes it clear that situations can exist where these two ranges are different. It is conjectured that the critical ranges of the two-dimensional problems are also different.

引用

页码：1490 / 1492

页数：3