Professional Documents
Culture Documents
= e
< = =
v v v
tx v
v dist v N
v
V
range
d
' '
,
'
, | ) ( |
| | o =
A d
v v
Weighted Clustering Algorithm (WCA) Steps
3. Compute the sum of the distances D
v
with all neighbors
Energy consumption; more energy for greater dist.
communication.
Power required to support a link increases faster than
linearly with distance. (For cellular networks)
( ) { }
e
=
) (
'
'
,
v N
v
v
v dist
v
D
1
2 3
4
5
6
7
12
13
14
15
16
17
Weighted Clustering Algorithm (WCA) Steps
4. Compute the average speed of every node; gives a measure of
mobility M
v
where and are the
coordinates of the node at time and
Component with less mobility is a better choice for clusterhead.
( ) ( )
=
+
=
T
t
Y Y X X
M t t t t
T
v
1
1 1
1
2 2
( )
Y X
t t
,
( )
Y X
t t 1 1
,
v
t
( ) 1 t
Y
t
Y
t-1
X
t
X
t-1
time
Weighted Clustering Algorithm (WCA) Steps
5. Compute the total (cumulative) time P
v
a node acts as
clusterhead
Battery drainage = Power consumed
6. Calculate the combined weight W
v
for each node
W
v
= w
1
v
+ w
2
D
v
+ w
3
M
v
+ w
4
P
v
for each node
7. Find min W
v
;
choose node v as the cluster head, remove all
neighbors of v for further WCA
8. Repeat steps 2 to 7 for the remaining nodes
Load Balancing Factor (LBF)
It is desirable to balance the loads among the clusters
Load balancing factor (LBF) has defined as (should be high)
( )
=
i
i
c
LBF
x
n
2
where,
n
c
is the number of clusterheads
x
i
is the cardinality of cluster i and
n
c
n
c
N
=
is the average number of neighbors of a clusterhead
(N being the total number of nodes in the system)
Connectivity
For clusters to communicate with each other, it is assumed that
clusterheads are capable of operating in dual power mode
A clusterhead uses low power mode to communicate with its immediate
neighbors within its transmission range and high power mode is used for
communication with neighboring clusters
Connectivity is defined as (for multiple component graph)
Probability that a node is reachable from any other node
( 0 1; 1 being most desirable)
N
component largest of size
= ty connectivi
Scattered nodes in the network
Clusterheads are identified
Clusters are formed
Clusters are connected
Features of WCA
Invocation of WCA is on-demand
Reduces information exchange by less system updates
Reduces computation/communication costs
Manages mobility by reaffiliations
Delays (avoids) invocation of clustering as far as possible
WCA is distributive
No clusterhead is over loaded
Balances load by limiting the cluster size
Performance Metric
1. Number of clusterheads
2. Number of reaffiliations
a process where a node detaches from one clusterhead and
attaches
to another
3. Number of dominant set updates
when a node can no longer attach to any of the existing
clusterheads
These parameters are studied for the varying
number of nodes
transmission range
maximum displacement
Simulation Environment
System with N nodes on a 100x100 grid
N was varied between 20 and 60
Nodes moved in all directions randomly
Velocity of nodes were varied uniformly between 0 and 10
Transmission range of nodes was varied between 0 and 70
Ideal degree was fixed at = 10
Weighing factors: w
1
= 0.7, w
2
= 0.2, w
3
= 0.05 and w
4
= 0.05
o
Experimental Results
Max displacement = 5 (const)
Transmission range = 0 - 70
Number of nodes = 20 - 60
Ideal degree = 10
Experimental Results
Max displacement = 1 - 10
Transmission range = 30 (const)
Number of nodes = 20 - 60
Ideal degree = 10
Load Balancing
Connectivity
Performance of WCA
References
[Baker+ 1981a] D.J. Baker and A. Ephremides, A Distributed Algorithm for Organizing Mobile Radio
Telecommunication Networks, Proceedings of the 2
nd
International Conference on Distributed Computer
Systems, April 1981, pp. 476-483.
[Baker+ 1981b] D.J. Baker and A. Ephremides, The Architectural Organization of a Mobile Radio Network via a
Distributed Algorithm, IEEE Transactions on Communications COM-29(11), 1981, pp. 1694-1701.
[Basagni 1999a] S. Basagni, Distributed Clustering for Ad hoc Networks, Proceedings of International Symposium on
Parallel Architectures, Algorithms and Networks, June 1999, pp. 310-315.
[Basagni 1999b] S. Basagni, Distributive and Mobility-Adaptive Clustering for Multimedia Support in Multi-hop
Wireless Networks, Proceedings of Vehicular Technology Conference, VTC, Vol. 2, 1999-Fall, pp. 889-893.
[Chatterjee+ 2002] M. Chatterjee, S. K. Das and D. Turgut, WCA: A Weighted Clustering Algorithm for Mobile Ad hoc
Networks. Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks), Vol. 5, No. 2, April 2002,
pp. 193-204.
[Chatterjee+ 2000] M. Chatterjee, S. K. Das and D. Turgut, An On-Demand Weighted Clustering Algorithm (WCA) for
Ad hoc Networks. IEEE GLOBECOM 2000, pp. 1697-1701.
[Ephremides+ 1987] A. Ephremides J.E. Wieselthier and D.J. Baker, A Design Concept for Reliable Mobile Radio
Networks with Frequency Hopping Signaling, Proceedings of IEEE, Vol. 75(1), 1987, pp. 56-73.
[Parekh 1994] A.K. Parekh, Selecting Routers in Ad-hoc Wireless Networks, Proceedings of the SBT/IEEE
International Telecommunications Symposium, August 1994.