Escolar Documentos
Profissional Documentos
Cultura Documentos
Dissertation
A Physicomimetics Desynchronization Algorithm without Global Time Knowledge for Wireless Sensor Networks
Supasate Choochaisri
Under supervision of Asst. Prof. Dr. Chalermek Intanagonwiwat
Outline
Desynchronization Problem and Challenges Related Works Physicomimetics Algorithm: Motivation, Design, Evaluation
Single-hop Multi-hop
Conclusion
Problem
Desynchronization Problem
Desynchronization Problem
Desynchronization Problem
Desynchronization Problem
Desynchronization Problem
Desynchronization Problem
Desynchronization Problem
10
Framework
1
Period T
12
31
23
11
Framework
1
Period T
12
31
23
12
Framework
1
Period T
12
31
23
13
Framework
1
Period T
12
31
23
14
Framework
1
Period T
12
31
23
15
Framework
1
Period T
12
31
23
16
Challenges
17
Challenges
I use slot 1.
I use slot 1.
I use slot 3.
18
Challenges
Without global time or time synchronization, it is hard to determine the beginning of a slot.
Without global time knowledge
Node 1
1
Node 2
3 Time
Node 2
3 Time
1
Node 3
3 Time
1
Node 3
3 Time
3 Time
3 Time
19
Challenges
Message Collision
20
Challenges
Limited resources
21
Challenges
Problem is NP-Hard.
22
Challenges
23
Related Works
24
Temporal Desynchronization
2007: DESYNC and Inverse-MS (Harvard, USA) - IEEE SASO, ACM/IEEE IPSN - IEEE SASO 2008: DESYNC Multihop (Harvard, USA) 2009: EXTENDED-DESYNC (University of Wuerzburg, Germany) 2009: Lightweight Desynchronization (Stanford, USA) 2009: Localized Multi-hop Desynchronization (Stony Brook, USA) 2011: Orthodontics-Inspired Desynchronization (Chulalongkorn U., Thailand) 2012: V-DESYNC (Chulalongkorn U., Thailand) - IEEE VTC
25
DESYNC
ACM/IEEE IPSN 2007, IEEE SASO 2007 Julius Degesys et al. (Harvard University, USA)
3
26
DESYNC
3
27
DESYNC
3
28
DESYNC
Midpoint between node 2 and 4 1 Next phase neighbor Previous phase neighbor 4 2
3
29
DESYNC
Midpoint between node 2 and 4 1 1 Next phase neighbor Previous phase neighbor 4 2
3
30
INFOCOM 2009 Arik Motskin, Tim Roughgarden, Primoz Skraba, and Leonidas Guibas (Stanford University, USA)
31
t+
32
t+
2) Listens any neighbor fires during the selected slot. - if so, restart the process.
beginning point listening
start t
t+
selected slot
t + + slot size
33
Main loop steps: 3) Listens any neighbor fires at the slot beginning in the next period. - if so, restart the process
selected slot
t++T
34
Main loop steps: 3) Listens any neighbor fires at the slot beginning in the next period. - if so, restart the process
selected slot
t++T 4) Else, enters the permanent state and fire for the selected slot.
firing
t++T
35
36
t++T
t + + 2T
t + + 3T
T
37
t++T
t + + 2T
t + + 3T
T
38
Temporal to Spatial
39
40
Spatial Desynchronization
41
2004: Samia Souissi, Xavier Dfago, and Takuya Katayama, Convergence of a uniform circle formation algorithm for distributed autonomous mobile robots 42 2008: Reuven Cohen and David Peleg Local spreading algorithms for autonomous robot systems 2008: Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, Self-deployment of mobile sensors on a ring
2004: Samia Souissi, Xavier Dfago, and Takuya Katayama, Convergence of a uniform circle formation algorithm for distributed autonomous mobile robots 43 2008: Reuven Cohen and David Peleg Local spreading algorithms for autonomous robot systems 2008: Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, Self-deployment of mobile sensors on a ring
Robots are in an artificial force field (Physicomimetics). 44 Same type robots are repelled each other. Different type robots are attracted each others.
45
Period T
3
46
f12
Period T
f13
3
47
Force Function
Single force from node j to node i:
f14
f12
2
f13
3 Total force to node i:
Period T
48
Phase Adjustment
f12
2 4
f14
1 1
f13
3
Period T
49
Phase Adjustment
f12
2 4
f14
1 1
f13
3
Period T
50
Single-hop Evaluation
TinyOS 2.1.2 TOSSIM simulator Protocols: DWARF vs DESYNC Topology: fully connected mesh network Period: 1,000 ms Simulation time: 300,000 ms Network size: 4, 16, 32, 48, 64, 80, 96 nodes Nodes: random wake up during 0 1,000 ms Average: 30 simulations in each scenario
51
Desynchronization Error
Root Mean Square Error (RMSE) / Perfect Phase Interval (T/N) after 300 periods
52
DESYNC
DWARF
55
DESYNC
DWARF
56
DESYNC
DWARF
57
DESYNC
DWARF
58
DESYNC
DWARF
59
DESYNC
DWARF
60
Message Overhead
Control overhead = 0
both in DESYNC and DWARF. Rely on timing of the messages not information inside the message.
61
Stability Analysis
62
Convexity
63
Convexity
B
convex set
B
non-convex set
64
Convexity
B
convex set
B
non-convex set
, j1
, j2
T/2
65
Convexity
Objective function is convex. 1) The set of variables ( i , j ) is a convex set. 2) Hessian matrix of the objective function is positive semidefinite.
E
Slope of E
or
66
Convexity
Objective function is convex. 1) The set of variables ( i , j ) is a convex set. 2) Hessian matrix of the objective function is positive semidefinite.
E
Slope of E
or
Non-linear dynamic system At equilibrium, the system is stable under small perturbation,
68
Jacobian (J ) at i , j = T/n
i , j = T/n
Characteristic polynomial of J
where A=Kn2 / T
1 nodes
69
Jacobian (J ) at i , j = T/n
i , j = T/n
Characteristic polynomial of J
where A=Kn2 / T
1 nodes
Q.E.D.
70
71
1 Local view of 0
1 Local view of 1
0 0 2 2
1 Local view of 0
1 Local view of 1
The Problem
74
Resolution
I'm at 0:55AM
Node 0
Resolution
Broadcasts 1-hop neighbors' firing times. But, there is no global time (time is not synchronized).
Node 0
Node 1 Node 2
76
Resolution
Instead of broadcasting firing times, each node broadcasts its 1-hop neighbors' relative firing times (phases).
I'm at 0
Node 0
0 0 1 750
0 250 1 0 750
2 0 1 250
78
0 0 1 750
0 250 1 0 750
2 0 1 250
79
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
80
0 0 1 666
2 333
0 333
2 666
0 666 1 333 0
1 0
81
Another Problem
2 0 1 3
1
82
Another Problem
2 0 1 3
f0,2
f0,3
f0,1
1
83
M-DWARF
f0,3
f0,1
1 2
f0,3- f0,2
84
Multi-hop Evaluation
TinyOS 2.1.2 TOSSIM simulator Protocols: M-DWARF vs EXTENDED-DESYNC vs LIGHTWEIGHT Topology: chain, cycle, star, dumbbell, mesh Period (T): 1000, 2000, 3000 ms Simulation time: 300 periods Network size: depend on topology Nodes: random wake up during 0 T ms Average: 30 simulations in each scenario
(DESYNC-Multihop)
85
Impact of Topology
Chain Topology
0 1 2
{0},{1},{2}
{0},{2},{1}
Cycle Topology
0 9 1 8 2 7 3 6 4 5
{0,5},{1,4,8}, {3,7},{2,6,9}
{0,6},{2,5,9}, {3,8},{1,4,7}
86
Problematic cases
87
Impact of Topology
0
12
9 8 11 10
4 5 6 7
88
M-DWARF
T = 1000 ms
EXTENDED-DESYNC T = 1000 ms
T = 2000 ms
T = 3000 ms
89
30, 40 nodes
T = 1000 ms
90
91
Overhead
Optimized M-DWARF
Saving gain = 1
I'm at 0 Node 0 at 250 Node 2 at 750
0 1 2
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
93
Optimized M-DWARF
Saving gain = 1
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
94
Optimized M-DWARF
Saving gain = 1
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
95
Optimized M-DWARF
Saving gain = 1
.......
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
96
Optimized M-DWARF
Saving gain = 1
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
97
Optimized M-DWARF
Saving gain = 1
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
98
Optimized M-DWARF
Saving gain = 1
I'm at 0 Node 0 at 250 Node 2 at 750
0 1 2
0 0 1 750 500
0 250 1 0 750
0 500 1 250 0
99
100
101
Stability Analysis
102
Force Components
f0,5
5 Respect to node 0 0
f0,5- f0,4
4 1 3 2
f0,1
f0,4- f0,3
f0,1- f0,2
103
Force Components
f0,5
5 Respect to node 0 0
1. Closest Component
f0,1
f0,5- f0,4
4 1 3 2
f0,4- f0,3
f0,1- f0,2
f0,5
)- (
f0,1
104
Force Components
f0,5
5 Respect to node 0 0
1. Closest Component
f0,1
f0,5- f0,4
4 1 3 2
2. Resistance Component
f0,4- f0,3
f0,5
f0,5
)- (
f0,1
f0,1
105
Force Components
f0,5
5 Respect to node 0 0
1. Closest Component
f0,1
f0,5- f0,4
4 1 3 2
f0,4- f0,3
f0,5
f0,5
f0,4
f0,3
)- (
f0,1
f0,1
f0,2
106
1. Closest Component
f0,1
f0,5- f0,4
4 3 2 1
f0,1- f0,2
f0,5
f0,5
f0,4
f0,4
f0,3
)- (
f0,1
f0,1
f0,2
107
1. Closest Component
f0,1
f0,5- f0,3
4 3 2 1
f0,1- f0,2
f0,5
f0,5
f0,4
f0,4
f0,3
)- (
f0,1
f0,1
f0,2
108
f0,4
1. Closest Component
f0,1
1 3 2
f0,4- f0,3
f0,5
f0,5
f0,3
)- (
f0,1
f0,1
f0,2
109
2 factors
1) Connectivity between node i and j 2) Force component condition
ci , j
Closest component condition Resistance component condition Absorption component condition Closest
Ri , j Si , j Ti, j
Absorption
Resistance
Closest
Resistance
Absorption
110
Finding Jacobian at the Equilibrium Proving every eigenvalue lies in a unit circle
111
112
1
Q.E.D.
113
Berkeley TelosB mote platform running TinyOS 2.1.2 Compiled binary size = 27.4 KB, memory = 1.9 KB Demo
Conclusion
115
Summary of Contributions
Physicomimetics desynchronization algorithm 1. No master node 2. No global time knowledge/time synchronization 3. Lightweight, simple, practical
116
Summary of Contributions
Physicomimetics desynchronization algorithm 5. Asymptotically stable (if not saturated) 6. Less fluctuation 7. Single-hop and multi-hop networks support 8. Scalable with network size
Single-hop network: 1-hop local information Multi-hop network: 2-hop local information
117
Do not always achieve global optimum. Incur no overhead on single-hop networks but rather high overhead on multi-hop networks. The proper step size K could be further tuned and dynamically adjusted to maximize performance. Tolerate clock skew but not clock drift (if the drift is too large). Stability analysis is still complex.
118
The proposed algorithm could be fundamental to those various applications on temporal and spatial desynchronization.
119
Journal Publications
1. Desynchronization with an Artificial Force Field for Wireless Networks (ACM SIGCOMM Computer Communication Review, 2012)
Supasate Choochaisri, Kittipat Apicharttrisorn, K. Korprasertthaworn, Pongpakdi Techalertpaisarn, and Chalermek Intanagonwiwat
2. Logic Macroprogramming for Wireless Sensor Networks (International Journal of Distributed Sensor Networks, 2012)
3. An Analysis of Deductive-Query Processing Approaches for Logic Macroprograms in Wireless Sensor Networks (Engineering Journal, 2012)
4. Technology Adoption of InnovViz 2.0 : A Study of Mixed-Reality Visualization and Simulation System for Innovation Strategy with UTAUT Model (Journal of Information Technology Applications & Management, 2011)
Phannaphatr Savetpanuvong, Utai Tanlamai, Chidchanok Lursinsap, Pairote Leelaphattarakij, Wisit Kunarittipol, and Supasate Choochaisri
120
Conference Publications
1. DeVise: a Practical Tool for Visualizing and Validating Desynchronization Protocols on Multi-hop Wireless Sensor Networks (ECTI-CON'12)
2. V-DESYNC: Desynchronization for Message Collision Avoidance in Vehicular Networks (IEEE VTC'12)
3. Usefulness of Mixed Reality Visuals in the Learning and Assessment of Financial Data (BAI'12)
4. 2PMP: A Push-Pull with Buffer-Map Prediction Algorithm for Peer to Peer Live Streaming (IEEE ISPACS'11)
6. Efficiency and Speed Improvement for Network Coded File Distribution with Adaptive Request (IEEE ICCT'11)
8. Technology Adoption of InnovViz 2.0 : A Study of Mixed-Reality Visualization and Simulation System for Innovation Strategy with UTAUT Model (ITAM-6' 11) (Best Paper Award)
9. SENVM: Server Environment Monitoring and Controlling System for a Small Data Center Using Wireless Sensor Network (ICSEC'10)
10. Energy-Efficient Gradient Time Synchronization for Wireless Sensor Networks (IEEE CICSyN'10)
121
Acknowledgement
Assoc. Prof. Dr. Paisan Nakmahachalasint (Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University)
Asst. Prof. Dr. Kultida Rojviboonchai (Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University)
Asst. Prof. Dr. Manop Wongsaisuwan (Department of Electrical Engineering, Faculty of Engineering, Chulalongkorn University)
Rawin Youngnoi (Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University)
122
Acknowledgement
Faculty: Asst. Prof. Dr. Chalermek Intanagonwiwat and Asst. Prof. Dr. Kultida Rojviboonchai Student: Tanapoom Danmanee, Kittipat Apicharttrisorn, Jirawat Sirilar, Saran Jenjaturong, Wanchai Ngiwlay, Kulit Na Nakorn, Pongpakdi Taechalertpaisarn, Tossaphol Settawatcharawanit, Kwanjira Narkdej, Phuri Nicrovanachumrus , Prateep Puttrapornpisut, Vittawus Prueksasri, Chayanin Thaina, Wipawee Viriyapongsukit, Nattavit Kamoltham, Kiattikun Kawila, Nuttanart Pornprasitsakul, Siam Aurburananont, and Akekanat Saowwapak-adisak
123
End of Presentation
DWARF/M-DWARF source code @ https://github.com/supasate/dwarf Dissertation LaTeX source code @ https://github.com/supasate/dissertation Dissertation @ http://www.slideshare.net/supasate/a-physicomimeticsdesynchronization-algorithm-without-global-time-knowledge-for-wirelesssensor-networks-12893710 Presentation @ http://www.scribd.com/doc/90677084 Contact: supasate.c@student.chula.ac.th, supasate.c@ieee.org Department of Computer Engineering, Faculty of Engineering Chulalongkorn University, Bangkok, Thailand
124
Backup Slide
125
Physicomimetics
Introduced in 1999 by Prof. William Spears and Prof. Diana Spears. Physico (Greek for "nature" or "the science of Physics"), Mimetics (Greek for "imitate") To imitate the science of Physics. Also called Artificial Physics or Virtual Physics.
126
K-n relation
Select best K.
127
K-n relation
128
K-n relation
129
K-n relation
130
Algorithm Complexity
DESYNC - (n)
(n) for storing phase neighbors (1) for next phase calculation (n) for storing phase neighbors (n) for next phase calculation
DWARF - O(n)
0.05
0.10
0.15
0.20
0.25
0.30
0.35
0.40
0.45
0.50
0.55
0.60
0.65
0.70
0.75
0.80
0.85
0.90
0.95
Desynchronization Error
Root Mean Square Error (RMSE)
138
Convergence
Root Mean Square Error (RMSE)
139
DESYNC
DWARF
141
Chain Topology
Simulation: 3, 10 nodes
142
Chain Topology
143
Chain Topology
144
Cycle Topology
Simulation: 4, 10 nodes
145
Cycle Topology
146
147
Star Topology
148
Star Topology
149
150
Dumbbell Topology
151
Dumbbell Topology
152
153
M-DWARF
EXTENDED-DESYNC
154