Abstract
We study a clock synchronization protocol for the Chess WSN. First, we model the protocol as a network of timed automata and verify various instances using the Uppaal model checker. Next, we present a full parametric analysis of the protocol for the special case of cliques (networks with full connectivity), that is, we give constraints on the parameters that are both necessary and sufficient for correctness. These results have been checked using the proof assistant Isabelle. Finally, we present a negative result for the special case of line topologies: for any instantiation of the parameters, the protocol will eventually fail if the network grows. This result suggests a variation of the fundamental result of Fan and Lynch on gradient clock synchronization, where the synchronization eventually fails as the network diameter grows, for a setting with logical clocks whose value may also decrease.
Research supported by the European Community’s Seventh Framework Programme under grant agreement no 214755 (QUASIMODO). A preliminary version of the model presented in this paper appeared in [14].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Assegei, F.A.: Decentralized frame synchronization of a TDMA-based wireless sensor network. Master’s thesis, Eindhoven University of Technology, Department of Electrical Engineering (2008)
Bakhshi, R., Bonnet, F., Fokkink, W., Haverkort, B.: Formal analysis techniques for gossiping protocols. SIGOPS Oper. Syst. Rev. 41(5), 28–36 (2007)
Behrmann, G., David, A., Larsen, K.G., Håkansson, J., Pettersson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: Third International Conference on the Quantitative Evaluation of SysTems (QEST 2006), Riverside, CA, USA, September 11-14, pp. 125–126. IEEE Computer Society, Los Alamitos (2006)
Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)
Brown, G.M., Pike, L.: Easy parameterized verification of biphase mark and 8n1 protocols. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 58–72. Springer, Heidelberg (2006)
Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: PODC 1987: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pp. 1–12. ACM, New York (1987)
Fan, R., Lynch, N.A.: Gradient clock synchronization. Distributed Computing 18(4), 255–266 (2006)
Kermarrec, A.-M., van Steen, M.: Gossiping in distributed systems. SIGOPS Oper. Syst. Rev. 41(5), 2–7 (2007)
Lamport, L.: Time, clocks and the ordering of events in distributed systems. Communications of the ACM 21(7), 558–564 (1978)
Locher, T., Wattenhofer, R.: Oblivious gradient clock synchronization. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 520–533. Springer, Heidelberg (2006)
Meier, L., Thiele, L.: Gradient clock synchronization in sensor networks. Technical Report 219, Computer Engineering and Networks Lab., ETH Zurich (2005)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)
Pussente, R.M., Barbosa, V.C.: An algorithm for clock synchronization with the gradient property in sensor networks. Parallel and Distributed Computing 69, 261–265 (2009)
QUASIMODO. Case studies: Models, Deliverable 5.5 from the FP7 ICT STREP project 214755 (QUASIMODO) (January 2009)
QUASIMODO. Preliminary description of case studies, Deliverable 5.2 from the FP7 ICT STREP project 214755 (QUASIMODO) (January 2009)
Rushby, J.: A formally verified algorithm for clock synchronization under a hybrid fault model. In: PODC 1994: Thirteenth annual ACM symposium on Principles of distributed computing, pp. 304–313. ACM, New York (1994)
Schmaltz, J.: A formal model of clock domain crossing and automated verification of time-triggered hardware. In: Baumgartner, J., Sheeran, M. (eds.) Formal methods in computer aided design, pp. 223–230. IEEE Computer Society, Los Alamitos (2007)
Sundararaman, B., Buy, U., Kshemkalyani, A.D.: Clock synchronization for wireless sensor networks: a survey. Ad Hoc Networks 3(3), 281–323 (2005)
Tjoa, R., Chee, K.L., Sivaprasad, P.K., Rao, S.V., Lim, J.G.: Clock drift reduction for relative time slot tdma-based sensor networks. In: Proceedings of the 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2004), September 2004, pp. 1042–1047 (2004)
Umeno, S.: Event order abstraction for parametric real-time system verification. In: EMSOFT, pp. 1–10. ACM, New York (2008)
Vaandrager, F.W., de Groot, A.L.: Analysis of a biphase mark protocol with Uppaal and PVS. Formal Asp. Comput. 18(4), 433–458 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heidarian, F., Schmaltz, J., Vaandrager, F. (2009). Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks. In: Cavalcanti, A., Dams, D.R. (eds) FM 2009: Formal Methods. FM 2009. Lecture Notes in Computer Science, vol 5850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05089-3_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-05089-3_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05088-6
Online ISBN: 978-3-642-05089-3
eBook Packages: Computer ScienceComputer Science (R0)