1. Global Clock Synchronization in Sensor Networks Qun Li, Member, IEEE, and Daniela Rus, Member, IEEE IEEE Transactions on Computers 2006 Chien-Ku Lai

2. Outline Introduction The Synchronization Problem All-Node-Based Synchronization Cluster-Based Synchronization Synchronous Diffusion The Asynchronous Diffusion Methods Simulation Conclusion

3. Introduction - Clock Synchronization Many emerging sensor network applications require that the sensors in the network agree on the time  Ex. a vehicle tracking application

4. Introduction - Clock Synchronization (cont.) Clock synchronization has been a seminal topic in distributed systems  But it’s not easy to extend these results in the context of a sensor network  all the nodes in a network can communicate directly with each other

5. Introduction - About this paper Four new methods for global synchronization 1. The all-node-based method 2. The cluster-based method 3. The fully localized diffusion-based method 4. The fault-tolerant diffusion-based method  This paper aims to provide coarse synchronization

6. The Synchronization Problem The time of a computer clock is measured as a function of the hardware oscillator

7. The Synchronization Problem (cont.) The clocks in a sensor network can be inconsistent due to  The clock may drift due to environment changes Temperature Pressure Battery voltage  The nodes in a sensor network may not be synchronized well initially  The clock can also be affected by the interaction of other components of the sensor system The Berkeley Mica Mote sensors

8. The Synchronization Problem - Assumptions The hardware clock is not precise Nodes can read the current clock time and adjust the clock time at any time The sensor cannot determine the time elapsed in between the two ticks

9. All-Node-Based Synchronization - Assumptions 1. This method is used on all the nodes in the system 2. It is most effective when the size of the sensor network is relatively small 3. The clock cycle on each node is the same 4. The clock tick time is much longer than the packet transmission time 5. The message transmission time over each link and handling time on each node is roughly the same

10. All-Node-Based Synchronization - The Key Idea Send a message along a loop and record the initial time and the end time of the message Average the time to different segments of the loop and smooth over the error of the clocks

11. All-Node-Based Synchronization - Example A clock synchronization message traveling along a loop originated from node n 1 and then back to node n 1

12. All-Node-Based Synchronization - Algorithm is the minimal number of nodes synchronized in each synchronization round (excluding the reference node)

13. All-Node-Based Synchronization - Example (cont.) 12 t s = 1 t e = 1 t i = 3 t = 3 1 3

14. All-Node-Based Synchronization - Example (cont.) 12 t s = 1 t e = 1 t i = 3 t = 3 1 0 0 3 – 3 + 1 + 0 = 1 t = 1

15. All-Node-Based Synchronization - Proof

16. Cluster-Based Synchronization - Algorithm

17. Synchronous Diffusion 1. Why Use Diffusion? 2. The Rate-Based Synchronous Diffusion Algorithm

18. Why Use Diffusion? The previous methods  use global time information sent to all the nodes  are not scalable for very large networks  are not fault-tolerant

19. Why Use Diffusion? (cont.) The diffusion method is fully distributed and localized Synchronization is done locally  without a global synchronization initiator The diffusion synchronization method can be viewed as a high level framework for global synchronization

20. Why Use Diffusion? - The main idea Average all the clock time readings and set each clock to the average time A node with high clock time reading diffuses that time value to its neighbors and levels down its clock time A node with low time reading absorbs some of the values from its neighbors and increases its value

21. Why Use Diffusion? - Assumptions Two basic operations:  The neighboring nodes compare their clock readings at a certain time point  The nodes change their clock accordingly It may be a problem because  The clock comparison and the clock update cannot be done simultaneously

22. The Rate-Based Synchronous Diffusion Algorithm - Assumptions There are n sensors in the system This network is represented as a graph Let contain the time readings of the sensors in the network at time t T denotes matrix or vector transposition is the clock reading for sensor n i at time t (for simplicity, use c i )

23. The Rate-Based Synchronous Diffusion Algorithm - Algorithm is the diffusion rate

24. The Rate-Based Synchronous Diffusion Algorithm - Example 1 23 C 1 :2 C 2 :5C 3 :7 0.1 0.2 1 23 C 1 :3.1 C 2 :4.4C 3 :6.5 0.1 0.2

25. The Asynchronous Diffusion Methods 1. Asynchronous Diffusion Algorithms 2. Discussion

26. Asynchronous Diffusion Algorithms The average operation is atomic  If a node is involved in two or more average operations, these operations must be sequenced

27. Discussion The local synchronization is more important than the precise global synchronization Each node can run the asynchronous operations on the fly without knowing what other nodes are doing  Changing network topology  Node failure  Adverse communication conditions  Node mobility

28. Simulation 1. The relative error 2. The convergence speed

29. The relative error Number of nodes 200 Sensor field 10x10 Transmission range 1.5 Algorithm stop error 0.01 percent

30. The convergence speed (1/4) Sensor field 10x10 Transmission range 1.5 Algorithm stop error 0.01 percent

31. The convergence speed (2/4) Sensor field 10x10 Number of nodes 1,000 Algorithm stops at error 0.01 percent

32. The convergence speed (3/4) Sensor field proportional to the number of nodes (10 nodes per unit area) Transmission range 0.7 Algorithm stops at error 0.1 percent

33. The convergence speed (4/4) Number of nodes 400 Sensor field 15x15 Transmission range 1.5

34. Conclusion The global synchronization problem in sensor networks is considered  The all-node-based method  The cluster-based method  The diffusion-based methods  The fault-tolerant diffusion-based method Two implementations of the clock diffusion:  Synchronous  Asynchronous

35. Conclusion - Future Work The proposed algorithms can be extended to other sensor network applications  Data aggregation The authors are currently examining how the methods presented here fit to more general applications The future work also includes implementing the algorithms in a real sensor network using the Mica Mote sensor network platform

36. Questions? Thank you.