Fast distributed multi-hop relative time synchronization protocol and estimators for wireless sensor networks |
| |
Authors: | Djamel Djenouri Nassima Merabtine Fatma Zohra Mekahlia Messaoud Doudou |
| |
Affiliation: | 1. CERIST Center of Research, Ben-aknoun, BP 143, Algiers 16030, Algeria;2. Saad Dahlab University, Blida, Algeria;1. IT, Multimedia and Telecom Department, Open University of Catalonia, Rambla Poblenou, 156, Office 205, 08018 Barcelona, Spain;2. Telecommunications Technological Centre of Catalonia, Av. Carl Friedrich Gauss 7, 08860 Castelldefels, Spain;1. Univ. Politècnica de Catalunya, Dept. d''Arquitectura de Computadors, c/Jordi Girona, 1-3, Barcelona, Spain;2. Univ. Politècnica de València, Communications Dep., València, Spain;1. National University of Rwanda, Huye, Rwanda;2. SRM University, Chennai, India;1. Dept. of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China;2. Dept. of Computer Science and Engineering, University of Connecticut, Storrs, USA;3. Dept. of Computer Science, University of Massachusetts, Lowell, USA |
| |
Abstract: | The challenging problem of time synchronization in wireless sensor networks is considered in this paper, where a new distributed protocol is proposed for both local and multi-hop synchronization. The receiver-to-receiver paradigm is used, which has the advantage of reducing the time-critical-path and thus improving the accuracy compared to common sender-to-receiver protocols. The protocol is fully distributed and does not rely on any fixed reference. The role of the reference is divided amongst all nodes, while timestamp exchange is integrated with synchronization signals (beacons). This enables fast acquisition of timestamps that are used as samples to estimate relative synchronization parameters. An appropriate model is used to derive maximum likelihood estimators (MLE) and the Cramer-Rao lower bounds (CRLB) for both the offset-only, and the joint offset/skew estimation. The model permits to directly estimating relative parameters without using or referring to a reference’ clock. The proposed protocol is extended to multi-hop environment, where local synchronization is performed proactively and the resulted estimates are transferred to the intermediate/end-point nodes on-demand, i.e. as soon as a multi-hop communication that needs synchronization is initiated. On-demand synchronization is targeted for multi-hop synchronization instead of the always-on global synchronization model, which avoids periodic and continuous propagation of synchronization signals beyond a single-hop. Extension of local MLE estimators is proposed to derive relative multi-hop estimators. The protocol is compared by simulation to some state-of-the-art protocols, and results show much faster convergence of the proposed protocol. The difference has been on the order of more than twice compared to CS-MNS, more than ten times compared to RBS, and more than twenty times compared to TPSN. Results also show scalability of the proposed protocol concerning the multi-hop synchronization. The error does not exceed few microseconds for as much as 10 hops in R4Syn, while in CS-MNS, and TPSN, it reaches few tens of microseconds. Implementation and tests of the protocol on real sensor motes confirm microsecond level precision even in multi-hop scenarios, and high stability (long lifetime) of the skew/offset model. |
| |
Keywords: | Wireless sensor networks Time synchronization Distributed algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|