Distributed relative clock synchronization for wireless sensor networks

Shames, I; Bishop, AN

Distributed relative clock synchronization for wireless sensor networks

Shames, I Bishop, AN

Permalink

Publication Type:: Conference Proceeding
Citation:: IFAC Proceedings Volumes (IFAC-PapersOnline), 2011, 44 (1 PART 1), pp. 11265 - 11270
Issue Date:: 2011-01-01

Closed Access

	Filename	Description	Size
	1-s2.0-S1474667016454248-main.pdf	Published version	305.68 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Shames, I	en_US
dc.contributor.author	Bishop, AN https://orcid.org/0000-0001-8581-8562	en_US
dc.date.issued	2011-01-01	en_US
dc.identifier.citation	IFAC Proceedings Volumes (IFAC-PapersOnline), 2011, 44 (1 PART 1), pp. 11265 - 11270	en_US
dc.identifier.isbn	9783902661937	en_US
dc.identifier.issn	1474-6670	en_US
dc.identifier.uri	http://hdl.handle.net/10453/119672
dc.description.abstract	This paper considers an important problem in sensor networks, i.e. clock synchronization in wireless sensor networks with a focus on those scenarios where the inter-node time-of-arrival measurements are noisy. Initially, a simple convex, constraint based, optimization protocol for the problem of relative clock synchronization in wireless (sensor) networks is presented. Later, we provide a distributed discrete-time solution to the same problem and show exponential convergence. Then we provide a similar algorithm for achieving the same solution in continuous-time. Both the discrete-time algorithm and the continuous-time algorithm are distributed in that each node in the network requires very little information from its neighbours in the network. In the end, we provide a modification of the continuous time algorithm that achieves a finite-time convergence to the desired solution under some additional requirements. © 2011 IFAC.	en_US
dc.relation.ispartof	IFAC Proceedings Volumes (IFAC-PapersOnline)	en_US
dc.relation.isbasedon	10.3182/20110828-6-IT-1002.03685	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Distributed relative clock synchronization for wireless sensor networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	1 PART 1	en_US
utslib.citation.volume	44	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Biomedical Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CHT - Health Technologies
utslib.copyright.status	closed_access	*
pubs.issue	1 PART 1	en_US
pubs.publication-status	Published	en_US
pubs.volume	44	en_US

Abstract:

This paper considers an important problem in sensor networks, i.e. clock synchronization in wireless sensor networks with a focus on those scenarios where the inter-node time-of-arrival measurements are noisy. Initially, a simple convex, constraint based, optimization protocol for the problem of relative clock synchronization in wireless (sensor) networks is presented. Later, we provide a distributed discrete-time solution to the same problem and show exponential convergence. Then we provide a similar algorithm for achieving the same solution in continuous-time. Both the discrete-time algorithm and the continuous-time algorithm are distributed in that each node in the network requires very little information from its neighbours in the network. In the end, we provide a modification of the continuous time algorithm that achieves a finite-time convergence to the desired solution under some additional requirements. © 2011 IFAC.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/119672