Non-cooperative versus cooperative approaches for distributed network synchronization

Anna Scaglione, Roberto Pagliari

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007
Pages537-541
Number of pages5
DOIs
StatePublished - 2007
Externally publishedYes
Event5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007 - White Plains, NY, United States
Duration: Mar 19 2007Mar 23 2007

Other

Other5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007
CountryUnited States
CityWhite Plains, NY
Period3/19/073/23/07

Fingerprint

Synchronization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Scaglione, A., & Pagliari, R. (2007). Non-cooperative versus cooperative approaches for distributed network synchronization. In Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007 (pp. 537-541). [4144894] https://doi.org/10.1109/PERCOMW.2007.85

Non-cooperative versus cooperative approaches for distributed network synchronization. / Scaglione, Anna; Pagliari, Roberto.

Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007. 2007. p. 537-541 4144894.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Scaglione, A & Pagliari, R 2007, Non-cooperative versus cooperative approaches for distributed network synchronization. in Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007., 4144894, pp. 537-541, 5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007, White Plains, NY, United States, 3/19/07. https://doi.org/10.1109/PERCOMW.2007.85
Scaglione A, Pagliari R. Non-cooperative versus cooperative approaches for distributed network synchronization. In Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007. 2007. p. 537-541. 4144894 https://doi.org/10.1109/PERCOMW.2007.85
Scaglione, Anna ; Pagliari, Roberto. / Non-cooperative versus cooperative approaches for distributed network synchronization. Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007. 2007. pp. 537-541
@inproceedings{78fce58258304d4eaad3e6549de07b9b,
title = "Non-cooperative versus cooperative approaches for distributed network synchronization",
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.",
author = "Anna Scaglione and Roberto Pagliari",
year = "2007",
doi = "10.1109/PERCOMW.2007.85",
language = "English (US)",
isbn = "0769527884",
pages = "537--541",
booktitle = "Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007",

}

TY - GEN

T1 - Non-cooperative versus cooperative approaches for distributed network synchronization

AU - Scaglione, Anna

AU - Pagliari, Roberto

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34547655989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547655989&partnerID=8YFLogxK

U2 - 10.1109/PERCOMW.2007.85

DO - 10.1109/PERCOMW.2007.85

M3 - Conference contribution

AN - SCOPUS:34547655989

SN - 0769527884

SN - 9780769527888

SP - 537

EP - 541

BT - Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2007

ER -