Non-cooperative versus Cooperative Approaches for Distributed Network Synchronization

Authors:
Anna Scaglione;Roberto Pagliari
Affiliations:
Cornell University, USA;Universita di Genova, Italy
Venue:
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Year:
2007

Citing 0
Cited 3

Design and implementation of a PCO-based protocol for sensor networks

Proceedings of the 5th international conference on Embedded networked sensor systems
Performance of distributed consensus time synchronization with Gaussian delay in wireless sensor networks

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Analysis of distributed consensus time synchronization with Gaussian delay over wireless sensor networks

EURASIP Journal on Wireless Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we compare the so called Pulse Coupled Oscillator (PCO) protocol with an alternative gossiping algorithm, known as Average Consensus protocol, considering the application of decentralized network synchronization. The main difference between the PCO algorithm and the Average Consensus protocol is that the latter is based on the explicit exchange of time-stamps in the payload of packets, which are delivered with contention to the neighbors. The PCO scheme, instead, implicitly encodes the computed state into the transmission time, driving the nodes to transmit packets in synchrony. Our results show clearly how as more nodes tend to transmit at unison, cooperative transmission emerges boosting up the signal level and, therefore, speeding up the algorithm convergence. Conversely, the average consensus protocol, requires increasing energy as the number of nodes increases.