Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Minimizing Age of Correlated Information for Wireless Camera Networks
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.ORCID iD: 0000-0002-4876-0223
KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering.ORCID iD: 0000-0002-2764-8099
2018 (English)In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2018, p. 547-552Conference paper, Published paper (Refereed)
Abstract [en]

Freshness of information is of critical importance for a variety of applications based on wireless camera networks where multi-view image processing is required. In this study, we propose to jointly optimize the use of communication and computing resources such that information from multiple views is delivered is obtained in a timely fashion. To this end, we extend the concept of age of information to capture packets carrying correlated data. We consider the joint optimization of processing node assignment and camera transmission policy, so as to minimize the maximum peak age of information from all sources. We formulate the multi-view age minimization problem (MVAM) and prove that it is NP-hard. We provide fundamental results including tractable cases and optimality conditions. To solve the MVAM efficiently, we develop a modular optimization algorithm following a decomposition approach. Numerical results show that, by employing our approach, the maximum peak age is significantly reduced in comparison to a traditional centralized solution with minimum-time scheduling.

Place, publisher, year, edition, pages
IEEE , 2018. p. 547-552
Series
IEEE Conference on Computer Communications Workshops, ISSN 2159-4228
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-239838DOI: 10.1109/INFCOMW.2018.8406914ISI: 000450157700155Scopus ID: 2-s2.0-85050667072ISBN: 978-1-5386-5979-3 (print)OAI: oai:DiVA.org:kth-239838DiVA, id: diva2:1275784
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI
Note

QC 20190107

Available from: 2019-01-07 Created: 2019-01-07 Last updated: 2019-01-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

He, QingDán, GyörgyFodor, Viktória

Search in DiVA

By author/editor
He, QingDán, GyörgyFodor, Viktória
By organisation
Network and Systems engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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