Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Practical Coding Schemes For Bandwidth Limited One-Way Communication Resource Allocation
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-6617-8683
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9810-3478
2016 (English)In: 2016 IEEE 55th Conference on Decision and Control, CDC 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016, 221-226 p., 7798273Conference paper, Published paper (Refereed)
Abstract [en]

This paper investigates resource allocation algorithms that use limited communication - where the supplier of a resource broadcasts a coordinating signal using one bit of information to users per iteration. Rather than relay anticipated consumption to the supplier, the users locally compute their allocation, while the supplier measures the total resource consumption. Since the users do not compare their local consumption against the supplier’s capacity at each iteration, they can easily overload the system and cause an outage (for example blackout in power networks). To address this challenge, this paper investigates pragmatic coding schemes, called PFcodes (Primal-Feasible codes), that not only allow the restriction of communication to a single bit of information, but also avoid system overload due to users’ heavy consumption. We derive a worst case lower bound on the number of bits needed to achieve any desired accuracy using PF-codes. In addition, we demonstrate how to construct time-invariant and time-varying PF-codes. We provide an upper bound on the number of bits needed to achieve any desired solution accuracy using time-invariant PF-codes. Remarkably, the difference between the upper and lower bound is only 2 bits. It is proved that the time-varying PF-codes asymptotically converge to the true primal/dual optimal solution. Simulations demonstrating accuracy of our theoretical analyses are presented.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016. 221-226 p., 7798273
Series
IEEE Conference on Decision and Control, ISSN 0743-1546
National Category
Communication Systems
Research subject
Electrical Engineering
Identifiers
URN: urn:nbn:se:kth:diva-192889DOI: 10.1109/CDC.2016.7798273ISI: 000400048100037Scopus ID: 2-s2.0-85010720920ISBN: 9781509018376 (print)OAI: oai:DiVA.org:kth-192889DiVA: diva2:972728
Conference
55th IEEE Conference on Decision and Control, CDC 2016, ARIA Resort and Casino, Las Vegas, United States, 12 December 2016 through 14 December 2016
Note

QC 20160923

Available from: 2016-09-22 Created: 2016-09-22 Last updated: 2017-06-12Bibliographically approved

Open Access in DiVA

fulltext(553 kB)85 downloads
File information
File name FULLTEXT01.pdfFile size 553 kBChecksum SHA-512
978b041c678a087b0955aa7fc224c8278ffce789be64afe94bdf4a22d00dc26305b7beeb3f640aedad407a46ab08d5acb47a9294cc02858f56d5181022ed4281
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopushttp://cdc2016.ieeecss.org/

Search in DiVA

By author/editor
Magnusson, SindriFischione, Carlo
By organisation
Automatic ControlACCESS Linnaeus Centre
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 85 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 195 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf