1

2005 Workshop on Ad Hoc Networks 1

Fundamental Properties of
Wireless Ad Hoc Networks
Li-Hsing Yen
Chung Hua University
Dec. 9, 2005
2005 Workshop on Ad Hoc Networks 2
Outline
Link Probability
Node Degree
Network Coverage
Connectedness
Clustering Coefficient
Quantity of Hidden Terminals
2
2005 Workshop on Ad Hoc Networks 3
Network Model
(n, r, l, m)-network
A set of n nodes placed in an l m
rectangle area
The position of each node is a
random variable uniformly distributed
over the given area.
Each node has a transmission radius
of r unit length.
2005 Workshop on Ad Hoc Networks 4
Connectivity
Any two nodes that are within the
transmission range of each other will have a
link connecting them

link
3
2005 Workshop on Ad Hoc Networks 5
Border Effects
A node placed near the boundary of the
rectangle area will cover less system area
then expected
Desired Area

border effects border effects

2005 Workshop on Ad Hoc Networks 6
Torus Convention
turns the system area into a torus
the region covered by any node is considered
completely within the system
border effects are gone
4
2005 Workshop on Ad Hoc Networks 7
Link Probability
with torus convention; location independent
without torus convention
location dependent; must consider border
effects
d(x, y): the area covered by a node located at (x, y)
m l
r
p

=
2

)/2 , min( when m l r <

A
y x
p
y x
) , ( d
,
=
P
x,y
: link probability if node is at (x, y)
A = l m
2005 Workshop on Ad Hoc Networks 8
Location-Dependent Link
Probability
r = 250
5
2005 Workshop on Ad Hoc Networks 9
Expected Link Probability
Considering Border Effects
Way 1
Compute the expected coverage of a node
R: the deployment region.
Link probability = expected coverage /
overall system area
}}
=
R
x y y x
A
N d )d , ( d
1
] [ E
E[N] / A
2005 Workshop on Ad Hoc Networks 10
Results of Way 1
Expected probability of link occurrence
2 2
2 3 3 4
3
4
3
4
2
1
l m
ml r mr - lr - r
p
+
=
In a 1000 1000 network
6
2005 Workshop on Ad Hoc Networks 11
Computing Expected Link
Probability: Way 2
Let the location of node i be (X
i
, Y
i
)
Derive Pr[U
i
+V
i
s r
2
], the probability of the link
that connects nodes i and j
where U
i
= (X
i
X
j
)
2
, V
i
= (Y
i
Y
j
)
2
Find first the pdf of U
i
and V
i
, and then their
joint pdf
The probability can be derived by taking an
appropriate integration
2005 Workshop on Ad Hoc Networks 12
Results of Way 2
The pdf of U
i
The pdf of V
i
2
2
5 . 0
0 ,
1
) ( l u
l
lu
u f s s

=

2
2
5 . 0
0 ,
1
) ( m v
m
mv
v g s s

=

2 2
2 3 3 4
0 0
2
3
4
3
4
2
1
d d ) , ( ] Pr[
2 2
l m
ml r mr lr r
u v v u h r V U
r u r
i i
+
=
= s +
} }

joint pdf of U
i
and V
i
= f(u) g(v)
We got the
same result!
7
2005 Workshop on Ad Hoc Networks 13
Node Degree: Expected Value
Let random variable L
i,j
be the number of links
connecting nodes i and j (L
i,j
= 1 or 0).
Let D
i
= E
i
L
i,j
be the node degree of i
E[D
i
] = E[E
i
L
i,j
] = E
i
E[L
i,j
] no matter L
i,j
s are
independent or not
E[L
i,j
] = p
E[D
i
] = (n1)p
2005 Workshop on Ad Hoc Networks 14
Expected Node Degree
8
2005 Workshop on Ad Hoc Networks 15
Node Degree Distribution
The probability that a node has k links
With torus convention; location independent
When n (or equivalently, p0) but np = o remains
to be a constant, the binomial distribution becomes a
Poisson distribution with parameter o
k n k
i
p p
k
n
k D

|
|
.
|

\
|

= =
1
) 1 (
1
] Pr[
for all i
where p = tr
2
/ A
2005 Workshop on Ad Hoc Networks 16
Node Degrees Are Not
Independent
Consider D
i
and D
j
Pr[D
i
= 0, D
j
= n1] = 0
Pr[D
i
= 0] Pr[D
j
= n1] = 0
D
i
and D
j
are not independent for all i, j
The joint pdf of D
i
and D
j
are hard to
derive
9
2005 Workshop on Ad Hoc Networks 17
Network Links: Expected Value
Total number of links in a network
L = E D
i
/ 2
E[L] = E[E D
i
] = E E[D
i
] no matter D
i
s
are independent or not
E[D
i
] = (n1)p
E[L] = n(n1) p / 2
2005 Workshop on Ad Hoc Networks 18
Network Coverage
A piece of area is said to be covered if every point in
this area is within the communication range of some
node.
Network coverage: the area collectively covered by a
set of nodes
Desired Area
Coverage < 100%
10
2005 Workshop on Ad Hoc Networks 19
Network Coverage: Two Factors
region covered by each node may
overlap one another in a stochastic way
a node placed near the border of the
deployment region will cover less area
than nodes placed midway (border
effects)
2005 Workshop on Ad Hoc Networks 20
Network Coverage Estimate (1)
The deployment of n nodes can be modeled as a
stochastic process that places nodes one by one
according to a uniform distribution over R
When a node is placed, only a portion of its node
coverage gives extra network coverage

Extra
coverage
Extra
coverage
11
2005 Workshop on Ad Hoc Networks 21
Network Coverage Estimate (2)
Let C
i
be the random variable denoting the size of the
covered region collectively offered by i randomly
placed nodes
Let X
i
denote the extra network coverage contributed
by the i-th placed node
] E[ ] E[ ] E[
1 1
N X C = =
expected node
coverage (p.9)
C
i
= C
i1
+ X
i
for all i, 2 s i s n
E[C
i
] = E[C
i1
+ X
i
] = E[C
i1
] + E[X
i
]
for all i, 2 s i s n
2005 Workshop on Ad Hoc Networks 22
Network Coverage Estimate (3)
Let N
i
be the node coverage of the i-th
placed node
Let F
i
= X
i
/ N
i
If border effects are ignored
N
i
= tr
2
, a constant independent of F
i
,
so E[F
i
N
i
] = E[F
i
] E[N
i
]
E[C
i
] = E[C
i1
]+ E[F
i
N
i
] for all i, 2 s i s n
12
2005 Workshop on Ad Hoc Networks 23
Network Coverage Estimate (4)
As nodes are uniformly distributed, F
i
is expected to
be the proportion of the uncovered area to the whole
It turns out that
Since E[C
1
] = E[N]
A
C A
F
i
i
] E[
] E[
1

=
] E[
] E[
1 ] E[ ] E[
1
1
N
A
C
C C
i
i i
|
.
|

\
|
+ =

A
A
N
C
n
n
(
(

|
.
|

\
|
=
] E[
1 1 ] E[
2005 Workshop on Ad Hoc Networks 24
Expected Network Coverage
13
2005 Workshop on Ad Hoc Networks 25
k-Coverage Problem
Find the area that can be covered by at
least k out of n randomly placed nodes

1-coverage
2-coverage 3-coverage
2005 Workshop on Ad Hoc Networks 26
k-Coverage Estimate
Similar to the 1-coverage case
It can be computed by way of dynamic
programming
] E[ ) 1 ( ] E[
0
t d j
d i
t t d
d
t
j
i
C p p
t
d
C
+

=

|
|
.
|

\
|
=

: the size of the j-covered area after i nodes

have been randomly placed
j
i
C
holds for any integer d, 0 s d s i j
14
2005 Workshop on Ad Hoc Networks 27
Expected k-Coverage
r = 100
A = 10001000
2005 Workshop on Ad Hoc Networks 28
Connectedness
A network is said to be connected if it
contains no isolated node
phase transitions
an ad hoc network possesses many graph
properties with a rather small increase in
the expected number of edges
B. Krishnamachari et al., Critical Density Thresholds in Distributed
Wireless Networks, Communications, Information and Network Security,
Kluwer Publishers, 2002.
15
2005 Workshop on Ad Hoc Networks 29
Connectedness: Experimental
Results
1250 1250
2005 Workshop on Ad Hoc Networks 30
Clustering Coefficient
the extent to which a nodes neighbors are
also neighbors to each other
Node is clustering coefficient
The clustering coefficient of the whole network
is the average of all individual c
i
s
) 2 , (
i
i
i
m C
E
c =
m
i
: the num of is neighbors
E
i
: the num of links that exist among is neighbors
16
2005 Workshop on Ad Hoc Networks 31
Clustering Coefficient: Examples
( )
( )
10
2
4 5
2
1
2 =

=
i i
i
m m
, m C
6 =
i
E
( )
6 0
10
6
2
.
, m C
E
c
i
i
i
= = =
2005 Workshop on Ad Hoc Networks 32
Clustering Coefficient Estimate (1)
Given any node A with m 2 neighbors, let
N(A) = {X
1
, X
2
, , X
m
} be the set of As
neighbors
For any X
i
N(A), let N(A)
i
= {X
j
|X
j
N(A)
X
j
N(X
i
)}
The expected number of links connecting any
two neighbors of A is
(

=
m
i
i
A N
1
) ( E
2
1
17
2005 Workshop on Ad Hoc Networks 33
Clustering Coefficient Estimate (2)
The expected area jointly covered by two
neighboring nodes is
It follows that
|
|
.
|

\
|

4
3 3
2
r

= =
=
(

m
i
i
m
i
i
A N A N
1 1
] ) ( E[
2
1
) ( E
2
1
|
|
.
|

\
|
=
4
3 3
1 ) 1 ( |] ) ( [| m A N E
i for all i
(assuming torus conv.)

expected
area
2005 Workshop on Ad Hoc Networks 34
Clustering Coefficient Estimate (3)
Therefore,
Dividing this value by C(m,2) yields the
expected clustering coefficient
|
|
.
|

\
|

=
4
3 3
1
2
) 1 (
] ) ( E[
2
1
1
m m
A N
m
i
i
|
|
.
|

\
|
=
4
3 3
1 c a constant
18
2005 Workshop on Ad Hoc Networks 35
Clustering Coefficient:
Experimental Results
With torus convention Without torus convention
2005 Workshop on Ad Hoc Networks 36
Hidden Terminal Triples
(X, Y,Z) forms an HT-triple if Y located within Xs
coverage region and Z located within Ys coverage
region but not within Xs
the probability of HT-triple (X, Y,Z) is
Y
X
Z
An HT-triple
Z must be in
this region
Xs coverage
Ys coverage
2
2 2
2
) 1 (
4
3 3
p c
lm
r r
lm
r
=
|
|
.
|

\
|

Ys located
within Xs
coverage
Zs located within
region Y - X
joint
node
19
2005 Workshop on Ad Hoc Networks 37
Quantity of HT-Triples
There are C(n, 3) ways to select three nodes
from n nodes without order
Any selection may yield three possible HT-
triples, each corresponding to a distinct joint
node
Total number of HT-triples
2 2
) 2 )( 1 (
2
1
) 1 (
3
3 p n n n
c
p c
n

=
|
|
.
|

\
|
=
n
3
p
2
2005 Workshop on Ad Hoc Networks 38
HT-Triples: Theoretical Results
20
2005 Workshop on Ad Hoc Networks 39
Conclusions
We have analyzed
Link Probability
Node Degree
Network Coverage
Clustering Coefficient
Quantity of Hidden Terminals
Exact expression for connectedness remains
unsolved
2005 Workshop on Ad Hoc Networks 40
References
L.-H. Yen and C. W. Yu, Link probability, network coverage,
and related properties of wireless ad hoc networks, The 1st
IEEE Int'l Conf. on Mobile Ad-hoc and Sensor Systems, Oct.
2004, pp. 525-527.
L.-H. Yen and Y.-M. Cheng, Clustering coefficient of wireless
ad hoc networks and the quantity of hidden terminals, IEEE
Communications Letters, 9(3): 234-236, Mar. 2005.
C. W. Yu and L.-H. Yen, Computing subgraph probability of
random geometric graphs: Quantitative analyses of wireless ad
hoc networks, 25th IFIP WG 6.1 Int'l Conf. on Formal
Techniques for Networked and Distributed Systems, Oct. 2005,
LNCS, vol. 3731, pp. 458-472.
L.-H. Yen, C. W. Yu, and Y.-M. Cheng, Expected k-coverage in
wireless sensor networks, Ad Hoc Networks, to appear.