On the connectivity in finite ad hoc networks
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
On the connectivity in finite ad hoc networks
|
|
Creator |
DESAI, MP
MANJUNATH, D |
|
Subject |
channel capacity
data communication systems one dimensional probability resource allocation switching networks |
|
Description |
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.
|
|
Publisher |
IEEE
|
|
Date |
2008-11-21T06:49:21Z
2011-11-25T12:34:46Z 2011-12-26T13:06:34Z 2011-12-27T05:54:34Z 2008-11-21T06:49:21Z 2011-11-25T12:34:46Z 2011-12-26T13:06:34Z 2011-12-27T05:54:34Z 2002 |
|
Type |
Article
|
|
Identifier |
IEEE Communications Letters 6 (10), 437-39
1089-7798 http://dx.doi.org/10.1109/LCOMM.2002.804241 http://hdl.handle.net/10054/79 http://dspace.library.iitb.ac.in/xmlui/handle/10054/79 |
|
Language |
en_US
|
|