kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Finite-Time Privacy-Preserving Quantized Average Consensus with Transmission Stopping
KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Digital futures.ORCID-id: 0000-0002-8737-1984
Univ Cyprus, Dept Elect & Comp Engn, CY-1678 Nicosia, Cyprus.
KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Digital futures.ORCID-id: 0000-0001-9940-5929
2022 (Engelska)Ingår i: 2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC), Institute of Electrical and Electronics Engineers (IEEE) , 2022, s. 6762-6768Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Due to their flexibility, battery powered or energy-harvesting wireless networks are deployed in diverse applications. Securing data transmissions between wireless devices is of critical importance in order to avoid privacy-sensitive user data leakage. In this paper, we focus on the scenario where some nodes are curious (but not malicious) and try to identify the initial states of one (or more) other nodes, while some other nodes aim to preserve the privacy of their initial states from these curious nodes. We present a privacy-preserving finite transmission event-triggered quantized average consensus algorithm. Its operation is suitable for battery-powered or energy-harvesting wireless network since it guarantees (i) efficient (quantized) communication, and (ii) transmission ceasing (which allows preservation of available energy). Furthermore, we present topological conditions under which the proposed algorithm allows nodes to preserve their privacy. We conclude with a comparison of our algorithm against other algorithms in the existing literature.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE) , 2022. s. 6762-6768
Serie
IEEE Conference on Decision and Control, ISSN 0743-1546
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:kth:diva-326408DOI: 10.1109/CDC51059.2022.9993299ISI: 000948128105108Scopus ID: 2-s2.0-85146985268OAI: oai:DiVA.org:kth-326408DiVA, id: diva2:1754199
Konferens
IEEE 61st Conference on Decision and Control (CDC), December 6-9, 2022, Cancun, Mexico
Anmärkning

QC 20250923

Tillgänglig från: 2023-05-03 Skapad: 2023-05-03 Senast uppdaterad: 2025-09-23Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Rikos, ApostolosJohansson, Karl H.

Sök vidare i DiVA

Av författaren/redaktören
Rikos, ApostolosJohansson, Karl H.
Av organisationen
ReglerteknikDigital futures
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 33 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf