On the connectivity in finite ad hoc networks

被引：115

作者：

Desai, M ^{[1
]}

Manjunath, D ^{[1
]}

机构：

[1] Indian Inst Technol, Dept Elect Engn, Bombay 400076, Maharashtra, India

来源：

IEEE COMMUNICATIONS LETTERS | 2002年 / 6卷 / 10期

关键词：

connectivity; finite ad hoc networks; one-dimensional ad hoc networks;

D O I：

10.1109/LCOMM.2002.804241

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Connectivity and capacity analysis of ad hoc networks has usually focused on asymptotic results in the number of nodes in the network. In this letter we analyze finite ad hoc networks. With the standard assumption of uniform distribution of nodes in [0, z], z > 0, for a one-dimensional network, we obtain the exact formula for the probability that the network is connected. We then extend this result to find bounds for the connectivity in a two-dimensional network, in [0, z](2).

引用

页码：437 / 439

页数：3

共 11 条

[1] CRITICAL CONNECTIVITY PHENOMENA IN MULTIHOP RADIO MODELS [J].

CHENG, YC ;

ROBERTAZZI, TG .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1989, 37 (07) :770-777

[2] One-dimensional loss networks and conditioned M/G/∞ queues [J].

Ferrari, PA ;

Garcia, NL .

JOURNAL OF APPLIED PROBABILITY, 1998, 35 (04) :963-975

[3]

Grossglauser M, 2001, IEEE INFOCOM SER, P1360, DOI 10.1109/INFCOM.2001.916631

[4] The capacity of wireless networks [J].

Gupta, P ;

Kumar, PR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404

[5]

GUPTA P, 1999, SYS CON FDN, P547

[6]

KELLY FP, 1985, J ROY STAT SOC B MET, V47, P379

[7]

KELLY FP, 1989, ANN PROBAB, V15, P1166

[8]

PANCHAPAKESAN P, 2001, P SPCOMM 2001

[9]

Penrose MD, 1999, RANDOM STRUCT ALGOR, V15, P145, DOI 10.1002/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO

[10]

2-G

← 1 2 →