Cluster Tree Based Self Organization of Virtual Sensor Networks Dilum Bandara 1 , Anura Jayasumana 1 , and Tissa Illangasekare 2 1 Department of Electrical and Computer Engineering, Colorado State University, CO 80523, USA. 2 Division of Environmental Science and Engineering, Colorado School of Mines, Golden, CO 80401, USA. [email protected]Supported in part by a grant from Army Research Office (ARO)
29
Embed
Cluster Tree Based Self Organization of Virtual Sensor Networks Dilum Bandara 1, Anura Jayasumana 1, and Tissa Illangasekare 2 1 Department of Electrical.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Cluster Tree Based Self Organization of Virtual Sensor Networks
Dilum Bandara1, Anura Jayasumana1, and Tissa Illangasekare2
1Department of Electrical and Computer Engineering, Colorado State University, CO 80523, USA.
2Division of Environmental Science and Engineering, Colorado School of Mines, Golden, CO 80401, USA.
VSN message delivery Alternative strategies for node-to-sink and node-to-node
communication Random routing
Rumor routing – Braginsky and Estrin, (2002)
Ant routing – Hussein and Saadawi (2003)
Geographic routing
Hierarchical routing
Need some sort of an addressing scheme Imposing some structure within network is more attractive
E.g., Cluster tree – IEEE 802.15.4, GTC
GTC – Generic Top-down Clustering algorithm
10WMSN 2008
Cluster tree formation with Generic Top-down Clustering (GTC) algorithm
A
K
L
M
D
C
B
N
F
O
G
I
E
J
H
P
Q
R A
DCB F GE
IH K L
J M
N
OQ PR
11WMSN 2008
Bandara & Jayasumana, 2007
Hierarchical addressing scheme is developed to facilitate in-network communication
. f f . f . E . E E E E E F . F . F F . l l.I . . . . x x .
. . . f f.E E E E . . E E E F F F F F . l . I I I I x.. . .f f . f Q E E E . E E . E E F.. F . . F . . . I . . I x . .. . . . . . . . . . E E . E F . 3 . . . . . . I . . I v v .Q . Q . . E E . . E.. E E . . . . 3 . . . I I I . . I . v .Q Q Q Q Q E . . E . E E . . 3 3 . 3 3 . . . I.. . . . . . .. Q . . Q E E . E . . E 3 3 . . . . 3 . . . I . I I . . . v. Q Q . Q.. . . . . 6 6 . 3 3 3 . 3 3 3 . . . . G I I v v v.. Q Q Q . 6 . . 6 6 . 3 . . . . 3.. . 3 3 . G . . G G G . .Q Q Q . Q 6 . . 6 . 6 . 3 3 . . 3 3 . . 3 . . . . G . . . .Q . Q Q . . . . 6 . . . . . 3 . 3 . 3 . 3 G . . . G G . G .. Q . . . 6 . 6 . 6.. . 1 1 . . 1 1 1 . . . G . G G . G . .? ? ?.. Q 6 6 6 . . 6 . 1 1 1 1 . 1 . 1 . . G G G.. G . G G. T . T T . . . . . . 1 1 . . 1 1 1 . 1 . G G G . . G G . O. T . T T . . 6 . 6 6 . 1 1 . 1 1 1 1 . . G . . G G G G G .. T T T . . . . . . . . 1 . . 1.. 1 . . 1 4 . . 4 . G G G OT T . . T . . A A . . . 1 1 1 1 1 1 . 1 4 . . . . 4 4 . . O.. . T T.. . A A A . A.1 . . 1 1 . . 1 1 . . 4 . . 4 . O . OT . . . T . . . . A A 1 1 1 1 1 1 1 1 1 . 4 . 4 . 4 4 O . .T . . . . . . . . A A . 1 1 . 1 . 1 . 4 . . 4.4 4 4 4 . O OT T T T T T . A . A . 2 . . 2 . 2 . 2 . . . 4 4 . . 4 O . .. . . . . T . A A A . . 2 . 2 2 2 2 . . . . 4 . . 4 4 ! ! .. . Z . Z . . . . . A . . 2 2 . 2 . 2 . . . . . 4 . . ! !... . Z W Z.Z . Z Z . 2 2 2 2 . 2.2 2 2 . . . 4 . 4 . . . . !W . W W . . W . . 8 8 . 2 2 2 . . 2 2 . D . . . . . ! . ! .. . W W . . W W 8 . . 2 2 . . 2 . 2 . . . D D . . D ! . . .W W W . W W . W 8 . . 2 2 2 2 . 2 . 2 2 . . D . . . ! . . !W . . . W . W . . 8 8 8 2 . . . 2 2 2 . D D D . D . . . . .W W . W.. W W . 8 . . . 8.8 8 2 8 . . . . D.D D . . . a . .W W . W . . . . . 8 . 8 8 8 8 8 8 D . . . D . D D D a a.. .
A
K
L
M
D
C
B
N
F
O
G
I
E
J
H
P
Q
R
A
DCB F GE
IH K L
J M
N
OQ PR
Cluster tree based self-organization of VSNs
Cluster heads in VSN
Cluster heads that facilitate VSN
12WMSN 2008
Self-organization of VSNs (cont.)
A
K
L
M
D
C
B
N
F
O
G
I
E
J
H
P
Q
R
A
DCB F GE
IH K L
J M
N
OQ PR
Virtual tree belong to plume 2
Cluster heads belong to plume 1
Cluster heads belong to plume 2
Virtual tree belong to plume 1
13WMSN 2008
Simulator Discrete event simulator was developed using C 5000 nodes in a circular region with a radius of 500m 500 nodes detect the phenomenon in all the regions
(0, 0) (200, 0)
(200, 200)(0, 200)
Region 1
(0, 70)
(80, 70)
(0, 190) (80, 190)
(120, 200)
(120, 150) (200, 150)
Region 3
Region 2
(20, 150)(20, 180)
(80, 180)(80, 150)
14WMSN 2008
Performance analysis – Self-organization of VSNs
(a) Scenario 1, (b) Scenario 2PT= -12dBm
15WMSN 2008
Performance analysis – VSN formation overhead
Number of event nodes added over the time
0 100 200 300 400 500
Tot
al n
umbe
r of
hop
s
0
200
400
600
800Scenario 1Scenario 2Scenario 3
No hopsper agent
Probability of successful delivery
350 0.51
600 0.84
1000 0.91
Scenario 2 - 896 hops are required if CH-to-CH communication is multi-hop
Scenario 2 - Cost of discovering two VSN members with Rumor routing
Cluster tree based VSN formation guarantees that all VSN members identify each other
Lower overhead16WMSN 2008
Summary & future work Cluster tree based VSN formation scheme
Efficient Reliable Addressing scheme
Future work VSN management functions to detect multiple VSNs Merging 2 VSNs together Splitting a VSN into 2 VSNs
17WMSN 2008
Questions ?
Thank You…
Generic Top-Down Cluster & cluster tree formation (GTC) algorithm
C1
19
C2
C4
C3
WMSN 2008
GTC - Cluster tree formation Cluster tree is formed by keeping track of parent & child relationships