tasc: topology adaptive spatial clustering for sensor networks reino virrankoski, dimitrios...
TRANSCRIPT
![Page 1: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/1.jpg)
TASC: Topology Adaptive Spatial Clustering for Sensor Networks
Reino Virrankoski, Dimitrios Lymberopoulos and Andreas SavvidesEmbedded Networks and Application Lab Electrical Engineering Department Yale University, New Haven
Infocom 2005
![Page 2: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/2.jpg)
Ju-Mei Li
Outline
Introduction TASC
Distributed Leader Election Discovering Local Network Structure
Weight computation Grouping Similar Densities
Density reachability
Evaluation Conclusion
![Page 3: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/3.jpg)
Ju-Mei Li
Introduction
A good topology of large-scale sensor networks should help Sensor nodes coordination Network management Data aggregation and compression
Goal Through the development of weights and dynamic dens
ity reachablility Topology Adaptive Spatial Clustering Scheme (TASC)
![Page 4: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/4.jpg)
Ju-Mei Li
TASC: Distributed Leader Election
Input information 2-hop neighborhood Inter-node distance measurements Min. cluster size MinPoints
Each node uses input information to compute Weight Number of density reachable node
Midmost position on each shortest path, biggest weight
![Page 5: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/5.jpg)
Ju-Mei Li
TASC: Distributed Leader Election
f
g
b
a
c
e
h
d
i
k
j
BroadcastToNeighborhood(weight)BroadcastToNeighborhood(weight)
Select the heaviest density reachable node as nominee
BroadcastToNeighborhood(nominee)
Select the heaviest density reachable node as nominee
BroadcastToNeighborhood(nominee)
Density reachable nodes of node i = 4
Density reachable nodes of node j = 7
Density reachable nodes of node k = 3
Select the closest nominee as leader
BroadcastToNeighborhood(leaderID, nodeID)
Select the closest nominee as leader
BroadcastToNeighborhood(leaderID, nodeID)
![Page 6: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/6.jpg)
Ju-Mei Li
TASC: Distributed Leader Election
f
g
b
a
c
e
h
d
i
k
j
If this node is leader
until election timeout;
BroadcastToNeighborhood(clustermenbers)
If this node is leader
until election timeout;
BroadcastToNeighborhood(clustermenbers)
If clustersize is received
If clustersize < min. cluster size = 4
select the closest neighbor for which
clustersize ≥ min. cluster size = 4
and joints its cluster
BroadcastToNeighborhood(leaderID, clustersize)
If clustersize is received
If clustersize < min. cluster size = 4
select the closest neighbor for which
clustersize ≥ min. cluster size = 4
and joints its cluster
BroadcastToNeighborhood(leaderID, clustersize)
![Page 7: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/7.jpg)
Ju-Mei Li
TASC: Weight computation
A B C D E
4 7 7 48
A-B
A-B-C
A-B-C-D
A-B-C-D-E
B-C
B-C-D
B-C-D-E
C-D
C-D-E
D-E
![Page 8: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/8.jpg)
Ju-Mei Li
TASC: Weight computation
Including distance in Weight Computation If node k is
found on path from node i to node j
in between node a and node b Then the weight increment of
node k is given
3
2
12
53
,
,,
GA
EDDA
l
llD node of weight
A
B
C
D E G
F
H
3 45
1.29 10.15 11.46 1
0.86
0.49
0.84 0.51
4
3
12
45
,
,,
GA
GEED
l
llE node of weight
ij
bkkaij l
llw ,,
![Page 9: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/9.jpg)
Ju-Mei Li
TASC: Density reachability
i
Sensing range <= transmission range
If MinPoints = m = 3
ri
Could be large, equal, or small than sensing range
Could be large, equal, or small than sensing range
![Page 10: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/10.jpg)
Ju-Mei Li
TASC: Density reachability
i
a
b
c
jk
d
e
Density reachable nodes of node i : node j, node k, node a, node b, and node c
![Page 11: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/11.jpg)
Ju-Mei Li
TASC: Density reachability
i
k
j
i
k
j
![Page 12: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/12.jpg)
Ju-Mei Li
TASC: Distributed Leader Election
![Page 13: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/13.jpg)
Ju-Mei Li
Evaluation
PARSEC 100 random scenarios 100 nodes are deployed on 1000*1000 Measurement range
200, 250, 300, 350, 400 Minimum cluster size: 4 Shortest path is done on each node
Floyd-Warshall algorithm
![Page 14: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/14.jpg)
Ju-Mei Li
Evaluation
![Page 15: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/15.jpg)
Ju-Mei Li
Evaluation
Measurement range: (a)200, (b)300
(a) (b)
![Page 16: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/16.jpg)
Ju-Mei Li
Evaluation Measurement range: (a)200, (b)300, (c)400
![Page 17: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/17.jpg)
Ju-Mei Li
Evaluation
MinPoints = 2 MinPoints = 4
MinPoints = 6
![Page 18: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/18.jpg)
Ju-Mei Li
Conclusion
This paper proposed a TASC algorithmWhich uses
Weight Number of density reachable node
To decompose large network into smaller locally clusters
![Page 19: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/19.jpg)
Thank You!!
![Page 20: TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application](https://reader036.vdocuments.mx/reader036/viewer/2022062515/56649cc55503460f9498e246/html5/thumbnails/20.jpg)
Ju-Mei Li
TASC: Density reachability
i
k
j
i
j
k