Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–50 of 355 results for author: <span class="mathjax">Popovski, P</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/cs" aria-role="search"> Searching in archive <strong>cs</strong>. <a href="/search/?searchtype=author&query=Popovski%2C+P">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Popovski, P"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Popovski%2C+P&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Popovski, P"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=100" class="pagination-link " aria-label="Page 3" aria-current="page">3 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=150" class="pagination-link " aria-label="Page 4" aria-current="page">4 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=200" class="pagination-link " aria-label="Page 5" aria-current="page">5 </a> </li> <li><span class="pagination-ellipsis">…</span></li> </ul> </nav> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2503.08340">arXiv:2503.08340</a> <span> [<a href="https://arxiv.org/pdf/2503.08340">pdf</a>, <a href="https://arxiv.org/ps/2503.08340">ps</a>, <a href="https://arxiv.org/format/2503.08340">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Online Conformal Compression for Zero-Delay Communication with Distortion Guarantees </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ganesan%2C+U+K">Unnikrishnan Kunnath Ganesan</a>, <a href="/search/cs?searchtype=author&query=Durisi%2C+G">Giuseppe Durisi</a>, <a href="/search/cs?searchtype=author&query=Zecchin%2C+M">Matteo Zecchin</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Simeone%2C+O">Osvaldo Simeone</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2503.08340v1-abstract-short" style="display: inline;"> We investigate a lossy source compression problem in which both the encoder and decoder are equipped with a pre-trained sequence predictor. We propose an online lossy compression scheme that, under a 0-1 loss distortion function, ensures a deterministic, per-sequence upper bound on the distortion (outage) level for any time instant. The outage guarantees apply irrespective of any assumption on the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.08340v1-abstract-full').style.display = 'inline'; document.getElementById('2503.08340v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2503.08340v1-abstract-full" style="display: none;"> We investigate a lossy source compression problem in which both the encoder and decoder are equipped with a pre-trained sequence predictor. We propose an online lossy compression scheme that, under a 0-1 loss distortion function, ensures a deterministic, per-sequence upper bound on the distortion (outage) level for any time instant. The outage guarantees apply irrespective of any assumption on the distribution of the sequences to be encoded or on the quality of the predictor at the encoder and decoder. The proposed method, referred to as online conformal compression (OCC), is built upon online conformal prediction--a novel method for constructing confidence intervals for arbitrary predictors. Numerical results show that OCC achieves a compression rate comparable to that of an idealized scheme in which the encoder, with hindsight, selects the optimal subset of symbols to describe to the decoder, while satisfying the overall outage constraint. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2503.08340v1-abstract-full').style.display = 'none'; document.getElementById('2503.08340v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages, 3 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.18996">arXiv:2502.18996</a> <span> [<a href="https://arxiv.org/pdf/2502.18996">pdf</a>, <a href="https://arxiv.org/format/2502.18996">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Sequential Entanglement-Swapping assisted by Quantum Protocol over Ethernet Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Chen-Hu%2C+K">Kun Chen-Hu</a>, <a href="/search/cs?searchtype=author&query=Jensen%2C+K+S">Kristian S. Jensen</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.18996v1-abstract-short" style="display: inline;"> The integration of quantum communication protocols over Ethernet networks is proposed, showing the potential of combining classical and quantum technologies for efficient, scalable quantum networking. By leveraging the inherent strengths of Ethernet, such as addressing, MAC layer functionality, and scalability; we propose a practical framework to support the rigorous requirements of quantum commun… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.18996v1-abstract-full').style.display = 'inline'; document.getElementById('2502.18996v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.18996v1-abstract-full" style="display: none;"> The integration of quantum communication protocols over Ethernet networks is proposed, showing the potential of combining classical and quantum technologies for efficient, scalable quantum networking. By leveraging the inherent strengths of Ethernet, such as addressing, MAC layer functionality, and scalability; we propose a practical framework to support the rigorous requirements of quantum communication. Some novel protocols given in this study enable reliable end-to-end quantum entanglement over Ethernet, ensuring the adaptability needed for implementing a stable quantum internet. Detailed time-delay analyses confirm that our protocols offer superior performance compared to existing methods, with total time delay kept within the decoherence threshold of qubits. These results suggest that our approach is well-suited for deployment in realistic environments, meeting both the immediate needs of quantum networking and laying the groundwork for future advances in data exchange and quantum computational capabilities. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.18996v1-abstract-full').style.display = 'none'; document.getElementById('2502.18996v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted in QCNC 2025 Nara, Japan</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.16374">arXiv:2502.16374</a> <span> [<a href="https://arxiv.org/pdf/2502.16374">pdf</a>, <a href="https://arxiv.org/ps/2502.16374">ps</a>, <a href="https://arxiv.org/format/2502.16374">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Preserving Simultaneity and Chronology for Sensing in Wireless Perceptive Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=de+Souza%2C+J+H+I">Jo茫o Henrique Inacio de Souza</a>, <a href="/search/cs?searchtype=author&query=Saggese%2C+F">Fabio Saggese</a>, <a href="/search/cs?searchtype=author&query=Soret%2C+B">Beatriz Soret</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.16374v1-abstract-short" style="display: inline;"> We address the challenge of preserving the simultaneity and chronology of sensing events in multi-sensory systems with wireless links. The network uses temporal windows of integration (TWIs), borrowed multi-sensory perception, to preserve the temporal structure of the sensing data at the application side. We introduce a composite latency model for propagation, sensing, and communication that leads… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.16374v1-abstract-full').style.display = 'inline'; document.getElementById('2502.16374v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.16374v1-abstract-full" style="display: none;"> We address the challenge of preserving the simultaneity and chronology of sensing events in multi-sensory systems with wireless links. The network uses temporal windows of integration (TWIs), borrowed multi-sensory perception, to preserve the temporal structure of the sensing data at the application side. We introduce a composite latency model for propagation, sensing, and communication that leads to the derivation of the probability of simultaneity violation. This is used to select the TWI duration aiming to achieve the desired degrees of chronological preservation, while maintaining the throughput of events. The letter provides important insights and analytical tools about the TWI impact on the event registration. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.16374v1-abstract-full').style.display = 'none'; document.getElementById('2502.16374v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">This work has been submitted to the IEEE for possible publication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2502.10777">arXiv:2502.10777</a> <span> [<a href="https://arxiv.org/pdf/2502.10777">pdf</a>, <a href="https://arxiv.org/ps/2502.10777">ps</a>, <a href="https://arxiv.org/format/2502.10777">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Fast Transmission Control Adaptation for URLLC via Channel Knowledge Map and Meta-Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Peng%2C+H">Hongsen Peng</a>, <a href="/search/cs?searchtype=author&query=Kallehauge%2C+T">Tobias Kallehauge</a>, <a href="/search/cs?searchtype=author&query=Tao%2C+M">Meixia Tao</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2502.10777v1-abstract-short" style="display: inline;"> This paper considers methods for delivering ultra reliable low latency communication (URLLC) to enable mission-critical Internet of Things (IoT) services in wireless environments with unknown channel distribution. The methods rely upon the historical channel gain samples of a few locations in a target area. We formulate a non-trivial transmission control adaptation problem across the target area u… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.10777v1-abstract-full').style.display = 'inline'; document.getElementById('2502.10777v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2502.10777v1-abstract-full" style="display: none;"> This paper considers methods for delivering ultra reliable low latency communication (URLLC) to enable mission-critical Internet of Things (IoT) services in wireless environments with unknown channel distribution. The methods rely upon the historical channel gain samples of a few locations in a target area. We formulate a non-trivial transmission control adaptation problem across the target area under the URLLC constraints. Then we propose two solutions to solve this problem. The first is a power scaling scheme in conjunction with the deep reinforcement learning (DRL) algorithm with the help of the channel knowledge map (CKM) without retraining, where the CKM employs the spatial correlation of the channel characteristics from the historical channel gain samples. The second solution is model agnostic meta-learning (MAML) based metareinforcement learning algorithm that is trained from the known channel gain samples following distinct channel distributions and can quickly adapt to the new environment within a few steps of gradient update. Simulation results indicate that the DRL-based algorithm can effectively meet the reliability requirement of URLLC under various quality-of-service (QoS) constraints. Then the adaptation capabilities of the power scaling scheme and meta-reinforcement learning algorithm are also validated. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2502.10777v1-abstract-full').style.display = 'none'; document.getElementById('2502.10777v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">14 pages, 7 figures. This paper has been submitted to IEEE Internet of Things Journal for possible publication (Second revision completed)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.14522">arXiv:2501.14522</a> <span> [<a href="https://arxiv.org/pdf/2501.14522">pdf</a>, <a href="https://arxiv.org/ps/2501.14522">ps</a>, <a href="https://arxiv.org/format/2501.14522">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Information Age and Correctness for Energy Harvesting Devices with Random Access </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ngo%2C+K">Khac-Hoang Ngo</a>, <a href="/search/cs?searchtype=author&query=Durisi%2C+G">Giuseppe Durisi</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.14522v1-abstract-short" style="display: inline;"> We study a large network of energy-harvesting devices that monitor two-state Markov processes and send status updates to a gateway using the slotted ALOHA protocol without feedback. We let the devices adjust their transmission probabilities according to their process state transitions and current battery levels. Using a Markovian framework, we analyze the average value of a generic state-dependent… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.14522v1-abstract-full').style.display = 'inline'; document.getElementById('2501.14522v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.14522v1-abstract-full" style="display: none;"> We study a large network of energy-harvesting devices that monitor two-state Markov processes and send status updates to a gateway using the slotted ALOHA protocol without feedback. We let the devices adjust their transmission probabilities according to their process state transitions and current battery levels. Using a Markovian framework, we analyze the average value of a generic state-dependent penalty function that grows whenever there is a state estimation error. The age of incorrect information (AoII) is an example of such penalty function. We propose an accurate and easy-to-compute approximation for the average penalty. Numerical results demonstrate the benefits of optimizing the transmission probabilities to minimize the average penalty. The average-AoII-minimizing strategy can be highly suboptimal in terms of average penalty when one of the process states is critical, i.e., entails a high penalty if wrongly estimated. Furthermore, minimizing the average penalty does not guarantee a low probability of misdetecting a critical state period. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.14522v1-abstract-full').style.display = 'none'; document.getElementById('2501.14522v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">submitted to the International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt) 2025</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.12751">arXiv:2412.12751</a> <span> [<a href="https://arxiv.org/pdf/2412.12751">pdf</a>, <a href="https://arxiv.org/format/2412.12751">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Experimental Study of Low-Latency Video Streaming in an ORAN Setup with Generative AI </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Casparsen%2C+A">Andreas Casparsen</a>, <a href="/search/cs?searchtype=author&query=Bui%2C+V">Van-Phuc Bui</a>, <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Nielsen%2C+J+J">Jimmy Jessen Nielsen</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.12751v1-abstract-short" style="display: inline;"> Video streaming services depend on the underlying communication infrastructure and available network resources to offer ultra-low latency, high-quality content delivery. Open Radio Access Network (ORAN) provides a dynamic, programmable, and flexible RAN architecture that can be configured to support the requirements of time-critical applications. This work considers a setup in which the constraine… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.12751v1-abstract-full').style.display = 'inline'; document.getElementById('2412.12751v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.12751v1-abstract-full" style="display: none;"> Video streaming services depend on the underlying communication infrastructure and available network resources to offer ultra-low latency, high-quality content delivery. Open Radio Access Network (ORAN) provides a dynamic, programmable, and flexible RAN architecture that can be configured to support the requirements of time-critical applications. This work considers a setup in which the constrained network resources are supplemented by \gls{GAI} and \gls{MEC} {techniques} in order to reach a satisfactory video quality. Specifically, we implement a novel semantic control channel that enables \gls{MEC} to support low-latency applications by tight coupling among the ORAN xApp, \gls{MEC}, and the control channel. The proposed concepts are experimentally verified with an actual ORAN setup that supports video streaming. The performance evaluation includes the \gls{PSNR} metric and end-to-end latency. Our findings reveal that latency adjustments can yield gains in image \gls{PSNR}, underscoring the trade-off potential for optimized video quality in resource-limited environments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.12751v1-abstract-full').style.display = 'none'; document.getElementById('2412.12751v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2412.07503">arXiv:2412.07503</a> <span> [<a href="https://arxiv.org/pdf/2412.07503">pdf</a>, <a href="https://arxiv.org/ps/2412.07503">ps</a>, <a href="https://arxiv.org/format/2412.07503">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Goal-Oriented Medium Access with Distributed Belief Processing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Chiariotti%2C+F">Federico Chiariotti</a>, <a href="/search/cs?searchtype=author&query=Munari%2C+A">Andrea Munari</a>, <a href="/search/cs?searchtype=author&query=Badia%2C+L">Leonardo Badia</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2412.07503v2-abstract-short" style="display: inline;"> Goal-oriented communication entails the timely transmission of updates related to a specific goal defined by the application. In a distributed setup with multiple sensors, each individual sensor knows its own observation and can determine its freshness, as measured by Age of Incorrect Information (AoII). This local knowledge is suited for distributed medium access, where the transmission strategie… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.07503v2-abstract-full').style.display = 'inline'; document.getElementById('2412.07503v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.07503v2-abstract-full" style="display: none;"> Goal-oriented communication entails the timely transmission of updates related to a specific goal defined by the application. In a distributed setup with multiple sensors, each individual sensor knows its own observation and can determine its freshness, as measured by Age of Incorrect Information (AoII). This local knowledge is suited for distributed medium access, where the transmission strategies have to deal with collisions. We present Dynamic Epistemic Logic for Tracking Anomalies (DELTA), a medium access protocol that limits collisions and minimizes AoII in anomaly reporting over dense networks. Each sensor knows its own AoII, while it can compute the belief about the AoII for all other sensors, based on their Age of Information (AoI), which is inferred from the acknowledgments. This results in a goal-oriented approach based on dynamic epistemic logic emerging from public information. We analyze the resulting DELTA protocol both from a theoretical standpoint and with Monte Carlo simulations, showing that it is significantly more efficient and robust than classical random access, while outperforming state-of-the-art scheduled schemes by at least 30%, even with imperfect feedback. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.07503v2-abstract-full').style.display = 'none'; document.getElementById('2412.07503v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Conference version: to be presented at IEEE INFOCOM 2025. Extension: submitted for review to the IEEE/ACM Transactions on Networking</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 94-06 <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> C.2.2; H.1.1 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.13360">arXiv:2411.13360</a> <span> [<a href="https://arxiv.org/pdf/2411.13360">pdf</a>, <a href="https://arxiv.org/format/2411.13360">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Geometry-informed Channel Statistics Prediction Based upon Uncalibrated Digital Twins </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Abouamer%2C+M+S">Mahmoud Saad Abouamer</a>, <a href="/search/cs?searchtype=author&query=Williams%2C+R+J">Robin J. Williams</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.13360v1-abstract-short" style="display: inline;"> Digital twins (DTs) of wireless environments can be utilized to predict the propagation channel and reduce the overhead of required to estimate the channel statistics. However, direct channel prediction requires data-intensive calibration of the DT to capture the environment properties relevant for propagation of electromagnetic signals. We introduce a framework that starts from a satellite image… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13360v1-abstract-full').style.display = 'inline'; document.getElementById('2411.13360v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.13360v1-abstract-full" style="display: none;"> Digital twins (DTs) of wireless environments can be utilized to predict the propagation channel and reduce the overhead of required to estimate the channel statistics. However, direct channel prediction requires data-intensive calibration of the DT to capture the environment properties relevant for propagation of electromagnetic signals. We introduce a framework that starts from a satellite image of the environment to produce an uncalibrated DT, which has no or imprecise information about the materials and their electromagnetic properties. The key idea is to use the uncalibrated DT to implicitly provide a geometric prior for the environment. This is utilized to inform a Gaussian process (GP), which permits the use of few channel measurements to attain an accurate prediction of the channel statistics. Additionally, the framework is able to quantify the uncertainty in channel statistics prediction and select rate in ultra-reliable low-latency communication (URLLC) that complies with statistical guarantees. The efficacy of the proposed geometry-informed GP is validated using experimental data obtained through a measurement campaign. Furthermore, the proposed prediction framework is shown to provide significant improvements compared to the benchmarks where i) direct channel statistics prediction is obtained using an uncalibrated DT and (ii) the GP predicts channel statistics using information about the location. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.13360v1-abstract-full').style.display = 'none'; document.getElementById('2411.13360v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages, 10 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.08487">arXiv:2411.08487</a> <span> [<a href="https://arxiv.org/pdf/2411.08487">pdf</a>, <a href="https://arxiv.org/ps/2411.08487">ps</a>, <a href="https://arxiv.org/format/2411.08487">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Peak Age of Incorrect Information of Reactive ALOHA Reporting Under Imperfect Feedback </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Chiariotti%2C+F">Federico Chiariotti</a>, <a href="/search/cs?searchtype=author&query=Munari%2C+A">Andrea Munari</a>, <a href="/search/cs?searchtype=author&query=Badia%2C+L">Leonardo Badia</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.08487v1-abstract-short" style="display: inline;"> Age of Incorrect Information (AoII) is particularly relevant in systems where real time responses to anomalies are required, such as natural disaster alerts, cybersecurity warnings, or medical emergency notifications. Keeping system control with wrong information for too long can lead to inappropriate responses. In this paper, we study the Peak AoII (PAoII) for multi-source status reporting by ind… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.08487v1-abstract-full').style.display = 'inline'; document.getElementById('2411.08487v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.08487v1-abstract-full" style="display: none;"> Age of Incorrect Information (AoII) is particularly relevant in systems where real time responses to anomalies are required, such as natural disaster alerts, cybersecurity warnings, or medical emergency notifications. Keeping system control with wrong information for too long can lead to inappropriate responses. In this paper, we study the Peak AoII (PAoII) for multi-source status reporting by independent devices over a collision channel, following a zero-threshold ALOHA access where nodes observing an anomaly immediately start transmitting about it. If a collision occurs, nodes reduce the transmission probability to allow for a resolution. Finally, wrong or lost feedback messages may lead a node that successfully updated the destination to believe a collision happened. The PAoII for this scenario is computed in closed-form. We are eventually able to derive interesting results concerning the minimization of PAoII, which can be traded against the overall goodput and energy efficiency, but may push the system to the edge of congestion collapse. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.08487v1-abstract-full').style.display = 'none'; document.getElementById('2411.08487v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for publication to the IEEE International Conference on Communications (ICC) 2025</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2410.17754">arXiv:2410.17754</a> <span> [<a href="https://arxiv.org/pdf/2410.17754">pdf</a>, <a href="https://arxiv.org/ps/2410.17754">ps</a>, <a href="https://arxiv.org/format/2410.17754">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Rings and Algebras">math.RA</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Puncturing Quantum Stabilizer Codes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Gundersen%2C+J+S">Jaron Skovsted Gundersen</a>, <a href="/search/cs?searchtype=author&query=Christensen%2C+R+B">Ren茅 B酶dker Christensen</a>, <a href="/search/cs?searchtype=author&query=Grassl%2C+M">Markus Grassl</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Wisniewski%2C+R">Rafa艂 Wisniewski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2410.17754v2-abstract-short" style="display: inline;"> Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. For quantum codes, a form of puncturing is known, but its description is based on the code space rather than its generators. In this work, we generalize the puncturing procedure to allow more freedom in the choice of which coded states are kept and which are removed. We de… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2410.17754v2-abstract-full').style.display = 'inline'; document.getElementById('2410.17754v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2410.17754v2-abstract-full" style="display: none;"> Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. For quantum codes, a form of puncturing is known, but its description is based on the code space rather than its generators. In this work, we generalize the puncturing procedure to allow more freedom in the choice of which coded states are kept and which are removed. We describe this puncturing by focusing on the stabilizer matrix containing the generators of the code. In this way, we are able to explicitly describe the stabilizer matrix of the punctured code given the stabilizer matrix of the original stabilizer code. The additional freedom in the procedure also opens up new ways to construct new codes from old, and we present several ways to utilize this for the search of codes with good or even optimal parameters. In particular, we use the construction to obtain codes whose parameters exceed the best previously known. Lastly, we generalize the proof of the Griesmer bound from the classical setting to stabilizer codes since the proof relies heavily on the puncturing technique. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2410.17754v2-abstract-full').style.display = 'none'; document.getElementById('2410.17754v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 23 October, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Preprint</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2410.06026">arXiv:2410.06026</a> <span> [<a href="https://arxiv.org/pdf/2410.06026">pdf</a>, <a href="https://arxiv.org/format/2410.06026">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Content-based Wake-up for Energy-efficient and Timely Top-k IoT Sensing Data Retrieval </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shiraishi%2C+J">Junya Shiraishi</a>, <a href="/search/cs?searchtype=author&query=Kal%C3%B8r%2C+A+E">Anders E. Kal酶r</a>, <a href="/search/cs?searchtype=author&query=Leyva-Mayorga%2C+I">Israel Leyva-Mayorga</a>, <a href="/search/cs?searchtype=author&query=Chiariotti%2C+F">Federico Chiariotti</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Yomo%2C+H">Hiroyuki Yomo</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2410.06026v2-abstract-short" style="display: inline;"> Energy efficiency and information freshness are key requirements for sensor nodes serving Industrial Internet of Things (IIoT) applications, where a sink node collects informative and fresh data before a deadline, e.g., to control an external actuator. Content-based wake-up (CoWu) activates a subset of nodes that hold data relevant for the sink's goal, thereby offering an energy-efficient way to a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2410.06026v2-abstract-full').style.display = 'inline'; document.getElementById('2410.06026v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2410.06026v2-abstract-full" style="display: none;"> Energy efficiency and information freshness are key requirements for sensor nodes serving Industrial Internet of Things (IIoT) applications, where a sink node collects informative and fresh data before a deadline, e.g., to control an external actuator. Content-based wake-up (CoWu) activates a subset of nodes that hold data relevant for the sink's goal, thereby offering an energy-efficient way to attain objectives related to information freshness. This paper focuses on a scenario where the sink collects fresh information on top-k values, defined as data from the nodes observing the k highest readings at the deadline. We introduce a new metric called top-k Query Age of Information (k-QAoI), which allows us to characterize the performance of CoWu by considering the characteristics of the physical process. Further, we show how to select the CoWu parameters, such as its timing and threshold, to attain both information freshness and energy efficiency. The numerical results reveal the effectiveness of the CoWu approach, which is able to collect top-k data with higher energy efficiency while reducing k-QAoI when compared to round-robin scheduling, especially when the number of nodes is large and the required size of k is small. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2410.06026v2-abstract-full').style.display = 'none'; document.getElementById('2410.06026v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 8 October, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted to IEEE Transactions on Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2409.14832">arXiv:2409.14832</a> <span> [<a href="https://arxiv.org/pdf/2409.14832">pdf</a>, <a href="https://arxiv.org/ps/2409.14832">ps</a>, <a href="https://arxiv.org/format/2409.14832">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Energy-Aware Federated Learning in Satellite Constellations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Razmi%2C+N">Nasrin Razmi</a>, <a href="/search/cs?searchtype=author&query=Matthiesen%2C+B">Bho Matthiesen</a>, <a href="/search/cs?searchtype=author&query=Dekorsy%2C+A">Armin Dekorsy</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2409.14832v1-abstract-short" style="display: inline;"> Federated learning in satellite constellations, where the satellites collaboratively train a machine learning model, is a promising technology towards enabling globally connected intelligence and the integration of space networks into terrestrial mobile networks. The energy required for this computationally intensive task is provided either by solar panels or by an internal battery if the satellit… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.14832v1-abstract-full').style.display = 'inline'; document.getElementById('2409.14832v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2409.14832v1-abstract-full" style="display: none;"> Federated learning in satellite constellations, where the satellites collaboratively train a machine learning model, is a promising technology towards enabling globally connected intelligence and the integration of space networks into terrestrial mobile networks. The energy required for this computationally intensive task is provided either by solar panels or by an internal battery if the satellite is in Earth's shadow. Careful management of this battery and system's available energy resources is not only necessary for reliable satellite operation, but also to avoid premature battery aging. We propose a novel energy-aware computation time scheduler for satellite FL, which aims to minimize battery usage without any impact on the convergence speed. Numerical results indicate an increase of more than 3x in battery lifetime can be achieved over energy-agnostic task scheduling. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.14832v1-abstract-full').style.display = 'none'; document.getElementById('2409.14832v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">This paper is accepted for the IEEE Global Communications Conference (GLOBECOM Workshops), 2024</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2409.07902">arXiv:2409.07902</a> <span> [<a href="https://arxiv.org/pdf/2409.07902">pdf</a>, <a href="https://arxiv.org/format/2409.07902">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraints </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Zhu%2C+M">Meiyi Zhu</a>, <a href="/search/cs?searchtype=author&query=Zecchin%2C+M">Matteo Zecchin</a>, <a href="/search/cs?searchtype=author&query=Park%2C+S">Sangwoo Park</a>, <a href="/search/cs?searchtype=author&query=Guo%2C+C">Caili Guo</a>, <a href="/search/cs?searchtype=author&query=Feng%2C+C">Chunyan Feng</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Simeone%2C+O">Osvaldo Simeone</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2409.07902v3-abstract-short" style="display: inline;"> This paper presents communication-constrained distributed conformal risk control (CD-CRC) framework, a novel decision-making framework for sensor networks under communication constraints. Targeting multi-label classification problems, such as segmentation, CD-CRC dynamically adjusts local and global thresholds used to identify significant labels with the goal of ensuring a target false negative ra… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.07902v3-abstract-full').style.display = 'inline'; document.getElementById('2409.07902v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2409.07902v3-abstract-full" style="display: none;"> This paper presents communication-constrained distributed conformal risk control (CD-CRC) framework, a novel decision-making framework for sensor networks under communication constraints. Targeting multi-label classification problems, such as segmentation, CD-CRC dynamically adjusts local and global thresholds used to identify significant labels with the goal of ensuring a target false negative rate (FNR), while adhering to communication capacity limits. CD-CRC builds on online exponentiated gradient descent to estimate the relative quality of the observations of different sensors, and on online conformal risk control (CRC) as a mechanism to control local and global thresholds. CD-CRC is proved to offer deterministic worst-case performance guarantees in terms of FNR and communication overhead, while the regret performance in terms of false positive rate (FPR) is characterized as a function of the key hyperparameters. Simulation results highlight the effectiveness of CD-CRC, particularly in communication resource-constrained environments, making it a valuable tool for enhancing the performance and reliability of distributed sensor networks. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.07902v3-abstract-full').style.display = 'none'; document.getElementById('2409.07902v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">15 pages, 24 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2408.15639">arXiv:2408.15639</a> <span> [<a href="https://arxiv.org/pdf/2408.15639">pdf</a>, <a href="https://arxiv.org/format/2408.15639">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Semantic and goal-oriented edge computing for satellite Earth Observation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Soret%2C+B">Beatriz Soret</a>, <a href="/search/cs?searchtype=author&query=Leyva-Mayorga%2C+I">Israel Leyva-Mayorga</a>, <a href="/search/cs?searchtype=author&query=Mercado-Mart%C3%ADnez%2C+A+M">Antonio M. Mercado-Mart铆nez</a>, <a href="/search/cs?searchtype=author&query=Moretti%2C+M">Marco Moretti</a>, <a href="/search/cs?searchtype=author&query=Jurado-Navas%2C+A">Antonio Jurado-Navas</a>, <a href="/search/cs?searchtype=author&query=Martinez-Gost%2C+M">Marc Martinez-Gost</a>, <a href="/search/cs?searchtype=author&query=de+Miguel%2C+C+S">Celia S谩nchez de Miguel</a>, <a href="/search/cs?searchtype=author&query=Salas-Prendes%2C+A">Ainoa Salas-Prendes</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2408.15639v1-abstract-short" style="display: inline;"> The integration of Semantic Communications (SemCom) and edge computing in space networks enables the optimal allocation of the scarce energy, computing, and communication resources for data-intensive applications. We use Earth Observation (EO) as a canonical functionality of satellites and review its main characteristics and challenges. We identify the potential of the space segment, represented b… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.15639v1-abstract-full').style.display = 'inline'; document.getElementById('2408.15639v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.15639v1-abstract-full" style="display: none;"> The integration of Semantic Communications (SemCom) and edge computing in space networks enables the optimal allocation of the scarce energy, computing, and communication resources for data-intensive applications. We use Earth Observation (EO) as a canonical functionality of satellites and review its main characteristics and challenges. We identify the potential of the space segment, represented by a low Earth orbit (LEO) satellite constellation, to serve as an edge layer for distributed intelligence. Based on that, propose a system architecture that supports semantic and goal-oriented applications for image reconstruction and object detection and localization. The simulation results show the intricate trade-offs among energy, time, and task-performance using a real dataset and State-of-the-Art (SoA) processing and communication parameters. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.15639v1-abstract-full').style.display = 'none'; document.getElementById('2408.15639v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 August, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for publication to IEEE Communications Magazine</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2407.18200">arXiv:2407.18200</a> <span> [<a href="https://arxiv.org/pdf/2407.18200">pdf</a>, <a href="https://arxiv.org/ps/2407.18200">ps</a>, <a href="https://arxiv.org/format/2407.18200">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Sparse Incremental Aggregation in Multi-Hop Federated Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Mukherjee%2C+S">Sourav Mukherjee</a>, <a href="/search/cs?searchtype=author&query=Razmi%2C+N">Nasrin Razmi</a>, <a href="/search/cs?searchtype=author&query=Dekorsy%2C+A">Armin Dekorsy</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Matthiesen%2C+B">Bho Matthiesen</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2407.18200v1-abstract-short" style="display: inline;"> This paper investigates federated learning (FL) in a multi-hop communication setup, such as in constellations with inter-satellite links. In this setup, part of the FL clients are responsible for forwarding other client's results to the parameter server. Instead of using conventional routing, the communication efficiency can be improved significantly by using in-network model aggregation at each i… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.18200v1-abstract-full').style.display = 'inline'; document.getElementById('2407.18200v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2407.18200v1-abstract-full" style="display: none;"> This paper investigates federated learning (FL) in a multi-hop communication setup, such as in constellations with inter-satellite links. In this setup, part of the FL clients are responsible for forwarding other client's results to the parameter server. Instead of using conventional routing, the communication efficiency can be improved significantly by using in-network model aggregation at each intermediate hop, known as incremental aggregation (IA). Prior works [1] have indicated diminishing gains for IA under gradient sparsification. Here we study this issue and propose several novel correlated sparsification methods for IA. Numerical results show that, for some of these algorithms, the full potential of IA is still available under sparsification without impairing convergence. We demonstrate a 15x improvement in communication efficiency over conventional routing and a 11x improvement over state-of-the-art (SoA) sparse IA. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.18200v1-abstract-full').style.display = 'none'; document.getElementById('2407.18200v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">This paper is accepted for the 25th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) conference</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2407.14092">arXiv:2407.14092</a> <span> [<a href="https://arxiv.org/pdf/2407.14092">pdf</a>, <a href="https://arxiv.org/format/2407.14092">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Multiagent Systems">cs.MA</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Integrated Push-and-Pull Update Model for Goal-Oriented Effective Communication </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Agheli%2C+P">Pouya Agheli</a>, <a href="/search/cs?searchtype=author&query=Pappas%2C+N">Nikolaos Pappas</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Kountouris%2C+M">Marios Kountouris</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2407.14092v2-abstract-short" style="display: inline;"> This paper studies decision-making for goal-oriented effective communication. We consider an end-to-end status update system where a sensing agent (SA) observes a source, generates and transmits updates to an actuation agent (AA), while the AA takes actions to accomplish a goal at the endpoint. We integrate the push- and pull-based update communication models to obtain a push-and-pull model, which… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.14092v2-abstract-full').style.display = 'inline'; document.getElementById('2407.14092v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2407.14092v2-abstract-full" style="display: none;"> This paper studies decision-making for goal-oriented effective communication. We consider an end-to-end status update system where a sensing agent (SA) observes a source, generates and transmits updates to an actuation agent (AA), while the AA takes actions to accomplish a goal at the endpoint. We integrate the push- and pull-based update communication models to obtain a push-and-pull model, which allows the transmission controller at the SA to decide to push an update to the AA and the query controller at the AA to pull updates by raising queries at specific time instances. To gauge effectiveness, we utilize a grade of effectiveness (GoE) metric incorporating updates' freshness, usefulness, and timeliness of actions as qualitative attributes. We then derive effect-aware policies to maximize the expected discounted sum of updates' effectiveness subject to induced costs. The effect-aware policy at the SA considers the potential effectiveness of communicated updates at the endpoint, while at the AA, it accounts for the probabilistic evolution of the source and importance of generated updates. Our results show the proposed push-and-pull model outperforms models solely based on push- or pull-based updates both in terms of efficiency and effectiveness. Additionally, using effect-aware policies at both agents enhances effectiveness compared to periodic and/or probabilistic effect-agnostic policies at either or both agents. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.14092v2-abstract-full').style.display = 'none'; document.getElementById('2407.14092v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 19 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for possible publication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2407.06705">arXiv:2407.06705</a> <span> [<a href="https://arxiv.org/pdf/2407.06705">pdf</a>, <a href="https://arxiv.org/format/2407.06705">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Integrating Atmospheric Sensing and Communications for Resource Allocation in NTNs </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Leyva-Mayorga%2C+I">Israel Leyva-Mayorga</a>, <a href="/search/cs?searchtype=author&query=Saggese%2C+F">Fabio Saggese</a>, <a href="/search/cs?searchtype=author&query=Li%2C+L">Lintao Li</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2407.06705v2-abstract-short" style="display: inline;"> The integration of Non-Terrestrial Networks (NTNs) with Low Earth Orbit (LEO) satellite constellations into 5G and Beyond is essential to achieve truly global connectivity. A distinctive characteristic of LEO mega constellations is that they constitute a global infrastructure with predictable dynamics, which enables the pre-planned allocation of radio resources. However, the different bands that c… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.06705v2-abstract-full').style.display = 'inline'; document.getElementById('2407.06705v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2407.06705v2-abstract-full" style="display: none;"> The integration of Non-Terrestrial Networks (NTNs) with Low Earth Orbit (LEO) satellite constellations into 5G and Beyond is essential to achieve truly global connectivity. A distinctive characteristic of LEO mega constellations is that they constitute a global infrastructure with predictable dynamics, which enables the pre-planned allocation of radio resources. However, the different bands that can be used for ground-to-satellite communication are affected differently by atmospheric conditions such as precipitation, which introduces uncertainty on the attenuation of the communication links at high frequencies. Based on this, we present a compelling case for applying integrated sensing and communications (ISAC) in heterogeneous and multi-layer LEO satellite constellations over wide areas. Specifically, we propose a sensing-assisted communications framework and frame structure that not only enables the accurate estimation of the atmospheric attenuation in the communication links through sensing but also leverages this information to determine the optimal serving satellites and allocate resources efficiently for downlink communication with users on the ground. The results show that, by dedicating an adequate amount of resources for sensing and solving the association and resource allocation problems jointly, it is feasible to increase the average throughput by 59% and the fairness by 700% when compared to solving these problems separately. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.06705v2-abstract-full').style.display = 'none'; document.getElementById('2407.06705v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 9 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for publication to IEEE Transactions on Wireless Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2407.01544">arXiv:2407.01544</a> <span> [<a href="https://arxiv.org/pdf/2407.01544">pdf</a>, <a href="https://arxiv.org/format/2407.01544">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Decentralized Multi-Party Multi-Network AI for Global Deployment of 6G Wireless Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Dzaferagic%2C+M">Merim Dzaferagic</a>, <a href="/search/cs?searchtype=author&query=Ruffini%2C+M">Marco Ruffini</a>, <a href="/search/cs?searchtype=author&query=Slamnik-Krijestorac%2C+N">Nina Slamnik-Krijestorac</a>, <a href="/search/cs?searchtype=author&query=Santos%2C+J+F">Joao F. Santos</a>, <a href="/search/cs?searchtype=author&query=Marquez-Barja%2C+J">Johann Marquez-Barja</a>, <a href="/search/cs?searchtype=author&query=Tranoris%2C+C">Christos Tranoris</a>, <a href="/search/cs?searchtype=author&query=Denazis%2C+S">Spyros Denazis</a>, <a href="/search/cs?searchtype=author&query=Kyriakakis%2C+T">Thomas Kyriakakis</a>, <a href="/search/cs?searchtype=author&query=Karafotis%2C+P">Panagiotis Karafotis</a>, <a href="/search/cs?searchtype=author&query=DaSilva%2C+L">Luiz DaSilva</a>, <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Shiraishi%2C+J">Junya Shiraishi</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Jensen%2C+S+K">Soren Kejser Jensen</a>, <a href="/search/cs?searchtype=author&query=Thomsen%2C+C">Christian Thomsen</a>, <a href="/search/cs?searchtype=author&query=Pedersen%2C+T+B">Torben Bach Pedersen</a>, <a href="/search/cs?searchtype=author&query=Claussen%2C+H">Holger Claussen</a>, <a href="/search/cs?searchtype=author&query=Du%2C+J">Jinfeng Du</a>, <a href="/search/cs?searchtype=author&query=Zussman%2C+G">Gil Zussman</a>, <a href="/search/cs?searchtype=author&query=Chen%2C+T">Tingjun Chen</a>, <a href="/search/cs?searchtype=author&query=Chen%2C+Y">Yiran Chen</a>, <a href="/search/cs?searchtype=author&query=Tirupathi%2C+S">Seshu Tirupathi</a>, <a href="/search/cs?searchtype=author&query=Seskar%2C+I">Ivan Seskar</a>, <a href="/search/cs?searchtype=author&query=Kilper%2C+D">Daniel Kilper</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2407.01544v1-abstract-short" style="display: inline;"> Multiple visions of 6G networks elicit Artificial Intelligence (AI) as a central, native element. When 6G systems are deployed at a large scale, end-to-end AI-based solutions will necessarily have to encompass both the radio and the fiber-optical domain. This paper introduces the Decentralized Multi-Party, Multi-Network AI (DMMAI) framework for integrating AI into 6G networks deployed at scale. DM… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.01544v1-abstract-full').style.display = 'inline'; document.getElementById('2407.01544v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2407.01544v1-abstract-full" style="display: none;"> Multiple visions of 6G networks elicit Artificial Intelligence (AI) as a central, native element. When 6G systems are deployed at a large scale, end-to-end AI-based solutions will necessarily have to encompass both the radio and the fiber-optical domain. This paper introduces the Decentralized Multi-Party, Multi-Network AI (DMMAI) framework for integrating AI into 6G networks deployed at scale. DMMAI harmonizes AI-driven controls across diverse network platforms and thus facilitates networks that autonomously configure, monitor, and repair themselves. This is particularly crucial at the network edge, where advanced applications meet heightened functionality and security demands. The radio/optical integration is vital due to the current compartmentalization of AI research within these domains, which lacks a comprehensive understanding of their interaction. Our approach explores multi-network orchestration and AI control integration, filling a critical gap in standardized frameworks for AI-driven coordination in 6G networks. The DMMAI framework is a step towards a global standard for AI in 6G, aiming to establish reference use cases, data and model management methods, and benchmarking platforms for future AI/ML solutions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.01544v1-abstract-full').style.display = 'none'; document.getElementById('2407.01544v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2405.16047">arXiv:2405.16047</a> <span> [<a href="https://arxiv.org/pdf/2405.16047">pdf</a>, <a href="https://arxiv.org/format/2405.16047">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Unified Timing Analysis for Closed-Loop Goal-Oriented Wireless Communication </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Li%2C+L">Lintao Li</a>, <a href="/search/cs?searchtype=author&query=Kal%C3%B8r%2C+A+E">Anders E. Kal酶r</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Chen%2C+W">Wei Chen</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2405.16047v2-abstract-short" style="display: inline;"> Goal-oriented communication has become one of the focal concepts in sixth-generation communication systems owing to its potential to provide intelligent, immersive, and real-time mobile services. The emerging paradigms of goal-oriented communication constitute closed loops integrating communication, computation, and sensing. However, challenges arise for closed-loop timing analysis due to multiple… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.16047v2-abstract-full').style.display = 'inline'; document.getElementById('2405.16047v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2405.16047v2-abstract-full" style="display: none;"> Goal-oriented communication has become one of the focal concepts in sixth-generation communication systems owing to its potential to provide intelligent, immersive, and real-time mobile services. The emerging paradigms of goal-oriented communication constitute closed loops integrating communication, computation, and sensing. However, challenges arise for closed-loop timing analysis due to multiple random factors that affect the communication/computation latency, as well as the heterogeneity of feedback mechanisms across multi-modal sensing data. To tackle these problems, we aim to provide a unified timing analysis framework for closed-loop goal-oriented communication (CGC) systems over fading channels. The proposed framework is unified as it considers computation, compression, and communication latency in the loop with different configurations. To capture the heterogeneity across multi-modal feedback, we categorize the sensory data into the periodic-feedback and event-triggered, respectively. We formulate timing constraints based on average and tail performance, covering timeliness, jitter, and reliability of CGC systems. A method based on saddlepoint approximation is proposed to obtain the distribution of closed-loop latency. The results show that the modified saddlepoint approximation is capable of accurately characterizing the latency distribution of the loop with analytically tractable expressions. This sets the basis for low-complexity co-design of communication and computation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.16047v2-abstract-full').style.display = 'none'; document.getElementById('2405.16047v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 October, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 25 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2405.12308">arXiv:2405.12308</a> <span> [<a href="https://arxiv.org/pdf/2405.12308">pdf</a>, <a href="https://arxiv.org/format/2405.12308">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Continual Deep Reinforcement Learning for Decentralized Satellite Routing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Lozano-Cuadra%2C+F">Federico Lozano-Cuadra</a>, <a href="/search/cs?searchtype=author&query=Soret%2C+B">Beatriz Soret</a>, <a href="/search/cs?searchtype=author&query=Leyva-Mayorga%2C+I">Israel Leyva-Mayorga</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2405.12308v1-abstract-short" style="display: inline;"> This paper introduces a full solution for decentralized routing in Low Earth Orbit satellite constellations based on continual Deep Reinforcement Learning (DRL). This requires addressing multiple challenges, including the partial knowledge at the satellites and their continuous movement, and the time-varying sources of uncertainty in the system, such as traffic, communication links, or communicati… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.12308v1-abstract-full').style.display = 'inline'; document.getElementById('2405.12308v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2405.12308v1-abstract-full" style="display: none;"> This paper introduces a full solution for decentralized routing in Low Earth Orbit satellite constellations based on continual Deep Reinforcement Learning (DRL). This requires addressing multiple challenges, including the partial knowledge at the satellites and their continuous movement, and the time-varying sources of uncertainty in the system, such as traffic, communication links, or communication buffers. We follow a multi-agent approach, where each satellite acts as an independent decision-making agent, while acquiring a limited knowledge of the environment based on the feedback received from the nearby agents. The solution is divided into two phases. First, an offline learning phase relies on decentralized decisions and a global Deep Neural Network (DNN) trained with global experiences. Then, the online phase with local, on-board, and pre-trained DNNs requires continual learning to evolve with the environment, which can be done in two different ways: (1) Model anticipation, where the predictable conditions of the constellation are exploited by each satellite sharing local model with the next satellite; and (2) Federated Learning (FL), where each agent's model is merged first at the cluster level and then aggregated in a global Parameter Server. The results show that, without high congestion, the proposed Multi-Agent DRL framework achieves the same E2E performance as a shortest-path solution, but the latter assumes intensive communication overhead for real-time network-wise knowledge of the system at a centralized node, whereas ours only requires limited feedback exchange among first neighbour satellites. Importantly, our solution adapts well to congestion conditions and exploits less loaded paths. Moreover, the divergence of models over time is easily tackled by the synergy between anticipation, applied in short-term alignment, and FL, utilized for long-term alignment. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.12308v1-abstract-full').style.display = 'none'; document.getElementById('2405.12308v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">30 pages, 11 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2405.06372">arXiv:2405.06372</a> <span> [<a href="https://arxiv.org/pdf/2405.06372">pdf</a>, <a href="https://arxiv.org/format/2405.06372">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Systems and Control">eess.SY</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Intelligent Duty Cycling Management and Wake-up for Energy Harvesting IoT Networks with Correlated Activity </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ru%C3%ADz-Guirola%2C+D+E">David E. Ru铆z-Guirola</a>, <a href="/search/cs?searchtype=author&query=L%C3%B3pez%2C+O+L+A">Onel L. A. L贸pez</a>, <a href="/search/cs?searchtype=author&query=Montejo-S%C3%A1nchez%2C+S">Samuel Montejo-S谩nchez</a>, <a href="/search/cs?searchtype=author&query=Mayorga%2C+I+L">Israel Leyva Mayorga</a>, <a href="/search/cs?searchtype=author&query=Han%2C+Z">Zhu Han</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2405.06372v1-abstract-short" style="display: inline;"> This paper presents an approach for energy-neutral Internet of Things (IoT) scenarios where the IoT devices (IoTDs) rely entirely on their energy harvesting capabilities to sustain operation. We use a Markov chain to represent the operation and transmission states of the IoTDs, a modulated Poisson process to model their energy harvesting process, and a discrete-time Markov chain to model their bat… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.06372v1-abstract-full').style.display = 'inline'; document.getElementById('2405.06372v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2405.06372v1-abstract-full" style="display: none;"> This paper presents an approach for energy-neutral Internet of Things (IoT) scenarios where the IoT devices (IoTDs) rely entirely on their energy harvesting capabilities to sustain operation. We use a Markov chain to represent the operation and transmission states of the IoTDs, a modulated Poisson process to model their energy harvesting process, and a discrete-time Markov chain to model their battery state. The aim is to efficiently manage the duty cycling of the IoTDs, so as to prolong their battery life and reduce instances of low-energy availability. We propose a duty-cycling management based on K- nearest neighbors, aiming to strike a trade-off between energy efficiency and detection accuracy. This is done by incorporating spatial and temporal correlations among IoTDs' activity, as well as their energy harvesting capabilities. We also allow the base station to wake up specific IoTDs if more information about an event is needed upon initial detection. Our proposed scheme shows significant improvements in energy savings and performance, with up to 11 times lower misdetection probability and 50\% lower energy consumption for high-density scenarios compared to a random duty cycling benchmark. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.06372v1-abstract-full').style.display = 'none'; document.getElementById('2405.06372v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2404.14236">arXiv:2404.14236</a> <span> [<a href="https://arxiv.org/pdf/2404.14236">pdf</a>, <a href="https://arxiv.org/format/2404.14236">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> EcoPull: Sustainable IoT Image Retrieval Empowered by TinyML Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Thorsager%2C+M">Mathias Thorsager</a>, <a href="/search/cs?searchtype=author&query=Croisfelt%2C+V">Victor Croisfelt</a>, <a href="/search/cs?searchtype=author&query=Shiraishi%2C+J">Junya Shiraishi</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2404.14236v2-abstract-short" style="display: inline;"> This paper introduces EcoPull, a sustainable Internet of Things (IoT) framework empowered by tiny machine learning (TinyML) models for fetching images from wireless visual sensor networks. Two types of learnable TinyML models are installed in the IoT devices: i) a behavior model and ii) an image compressor model. The first filters out irrelevant images for the current task, reducing unnecessary tr… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.14236v2-abstract-full').style.display = 'inline'; document.getElementById('2404.14236v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2404.14236v2-abstract-full" style="display: none;"> This paper introduces EcoPull, a sustainable Internet of Things (IoT) framework empowered by tiny machine learning (TinyML) models for fetching images from wireless visual sensor networks. Two types of learnable TinyML models are installed in the IoT devices: i) a behavior model and ii) an image compressor model. The first filters out irrelevant images for the current task, reducing unnecessary transmission and resource competition among the devices. The second allows IoT devices to communicate with the receiver via latent representations of images, reducing communication bandwidth usage. However, integrating learnable modules into IoT devices comes at the cost of increased energy consumption due to inference. The numerical results show that the proposed framework can save > 70% energy compared to the baseline while maintaining the quality of the retrieved images at the ES. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.14236v2-abstract-full').style.display = 'none'; document.getElementById('2404.14236v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Paper submitted to IEEE GLOBECOM 2024. Copyright may be transferred without further notice</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2404.12816">arXiv:2404.12816</a> <span> [<a href="https://arxiv.org/pdf/2404.12816">pdf</a>, <a href="https://arxiv.org/format/2404.12816">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Coexistence of Push Wireless Access with Pull Communication for Content-based Wake-up Radios </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shiraishi%2C+J">Junya Shiraishi</a>, <a href="/search/cs?searchtype=author&query=Cavallero%2C+S">Sara Cavallero</a>, <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Saggese%2C+F">Fabio Saggese</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2404.12816v1-abstract-short" style="display: inline;"> This paper considers energy-efficient connectivity for Internet of Things (IoT) devices in a coexistence scenario between two distinctive communication models: pull- and push-based. In pull-based, the base station (BS) decides when to retrieve a specific type of data from the IoT devices, while in push-based, the IoT device decides when and which data to transmit. To this end, this paper advocates… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.12816v1-abstract-full').style.display = 'inline'; document.getElementById('2404.12816v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2404.12816v1-abstract-full" style="display: none;"> This paper considers energy-efficient connectivity for Internet of Things (IoT) devices in a coexistence scenario between two distinctive communication models: pull- and push-based. In pull-based, the base station (BS) decides when to retrieve a specific type of data from the IoT devices, while in push-based, the IoT device decides when and which data to transmit. To this end, this paper advocates introducing the content-based wake-up (CoWu), which enables the BS to remotely activate only a subset of pull-based nodes equipped with wake-up receivers, observing the relevant data. In this setup, a BS pulls data with CoWu at a specific time instance to fulfill its tasks while collecting data from the nodes operating with a push-based communication model. The resource allocation plays an important role: longer data collection duration for pull-based nodes can lead to high retrieval accuracy while decreasing the probability of data transmission success for push-based nodes, and vice versa. Numerical results show that CoWu can manage communication requirements for both pull-based and push-based nodes while realizing the high energy efficiency (up to 38%) of IoT devices, compared to the baseline scheduling method. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.12816v1-abstract-full').style.display = 'none'; document.getElementById('2404.12816v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Paper submitted to Globecom 2024. Copyright may be transferred without further notice</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2404.01815">arXiv:2404.01815</a> <span> [<a href="https://arxiv.org/pdf/2404.01815">pdf</a>, <a href="https://arxiv.org/format/2404.01815">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</span> </div> </div> <p class="title is-5 mathjax"> Neuromorphic Split Computing with Wake-Up Radios: Architecture and Design via Digital Twinning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Chen%2C+J">Jiechen Chen</a>, <a href="/search/cs?searchtype=author&query=Park%2C+S">Sangwoo Park</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Poor%2C+H+V">H. Vincent Poor</a>, <a href="/search/cs?searchtype=author&query=Simeone%2C+O">Osvaldo Simeone</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2404.01815v3-abstract-short" style="display: inline;"> Neuromorphic computing leverages the sparsity of temporal data to reduce processing energy by activating a small subset of neurons and synapses at each time step. When deployed for split computing in edge-based systems, remote neuromorphic processing units (NPUs) can reduce the communication power budget by communicating asynchronously using sparse impulse radio (IR) waveforms. This way, the input… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.01815v3-abstract-full').style.display = 'inline'; document.getElementById('2404.01815v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2404.01815v3-abstract-full" style="display: none;"> Neuromorphic computing leverages the sparsity of temporal data to reduce processing energy by activating a small subset of neurons and synapses at each time step. When deployed for split computing in edge-based systems, remote neuromorphic processing units (NPUs) can reduce the communication power budget by communicating asynchronously using sparse impulse radio (IR) waveforms. This way, the input signal sparsity translates directly into energy savings both in terms of computation and communication. However, with IR transmission, the main contributor to the overall energy consumption remains the power required to maintain the main radio on. This work proposes a novel architecture that integrates a wake-up radio mechanism within a split computing system consisting of remote, wirelessly connected, NPUs. A key challenge in the design of a wake-up radio-based neuromorphic split computing system is the selection of thresholds for sensing, wake-up signal detection, and decision making. To address this problem, as a second contribution, this work proposes a novel methodology that leverages the use of a digital twin (DT), i.e., a simulator, of the physical system, coupled with a sequential statistical testing approach known as Learn Then Test (LTT) to provide theoretical reliability guarantees. The proposed DT-LTT methodology is broadly applicable to other design problems, and is showcased here for neuromorphic communications. Experimental results validate the design and the analysis, confirming the theoretical reliability guarantees and illustrating trade-offs among reliability, energy consumption, and informativeness of the decisions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.01815v3-abstract-full').style.display = 'none'; document.getElementById('2404.01815v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 2 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Published on IEEE Transactions on Signal Processing</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2403.00349">arXiv:2403.00349</a> <span> [<a href="https://arxiv.org/pdf/2403.00349">pdf</a>, <a href="https://arxiv.org/ps/2403.00349">ps</a>, <a href="https://arxiv.org/format/2403.00349">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Impact of Inter-Operator Interference via Reconfigurable Intelligent Surfaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Miridakis%2C+N+I">Nikolaos I. Miridakis</a>, <a href="/search/cs?searchtype=author&query=Tsiftsis%2C+T+A">Theodoros A. Tsiftsis</a>, <a href="/search/cs?searchtype=author&query=Karkazis%2C+P+A">Panagiotis A. Karkazis</a>, <a href="/search/cs?searchtype=author&query=Leligou%2C+H+C">Helen C. Leligou</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2403.00349v1-abstract-short" style="display: inline;"> A wireless communication system is studied that operates in the presence of multiple reconfigurable intelligent surfaces (RISs). In particular, a multi-operator environment is considered where each operator utilizes an RIS to enhance its communication quality. Although out-of-band interference does not exist (since each operator uses isolated spectrum resources), RISs controlled by different opera… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2403.00349v1-abstract-full').style.display = 'inline'; document.getElementById('2403.00349v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2403.00349v1-abstract-full" style="display: none;"> A wireless communication system is studied that operates in the presence of multiple reconfigurable intelligent surfaces (RISs). In particular, a multi-operator environment is considered where each operator utilizes an RIS to enhance its communication quality. Although out-of-band interference does not exist (since each operator uses isolated spectrum resources), RISs controlled by different operators do affect the system performance of one another due to the inherently rapid phase shift adjustments that occur on an independent basis. The system performance of such a communication scenario is analytically studied for the practical case where discrete-only phase shifts occur at RIS. The proposed framework is quite general since it is valid under arbitrary channel fading conditions as well as the presence (or not) of the transceiver's direct link. Finally, the derived analytical results are verified via numerical and simulation trial as well as some novel and useful engineering outcomes are manifested. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2403.00349v1-abstract-full').style.display = 'none'; document.getElementById('2403.00349v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 March, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2402.09105">arXiv:2402.09105</a> <span> [<a href="https://arxiv.org/pdf/2402.09105">pdf</a>, <a href="https://arxiv.org/format/2402.09105">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Scheduling for On-Board Federated Learning with Satellite Clusters </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Razmi%2C+N">Nasrin Razmi</a>, <a href="/search/cs?searchtype=author&query=Matthiesen%2C+B">Bho Matthiesen</a>, <a href="/search/cs?searchtype=author&query=Dekorsy%2C+A">Armin Dekorsy</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2402.09105v1-abstract-short" style="display: inline;"> Mega-constellations of small satellites have evolved into a source of massive amount of valuable data. To manage this data efficiently, on-board federated learning (FL) enables satellites to train a machine learning (ML) model collaboratively without having to share the raw data. This paper introduces a scheme for scheduling on-board FL for constellations connected with intra-orbit inter-satellite… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2402.09105v1-abstract-full').style.display = 'inline'; document.getElementById('2402.09105v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2402.09105v1-abstract-full" style="display: none;"> Mega-constellations of small satellites have evolved into a source of massive amount of valuable data. To manage this data efficiently, on-board federated learning (FL) enables satellites to train a machine learning (ML) model collaboratively without having to share the raw data. This paper introduces a scheme for scheduling on-board FL for constellations connected with intra-orbit inter-satellite links. The proposed scheme utilizes the predictable visibility pattern between satellites and ground station (GS), both at the individual satellite level and cumulatively within the entire orbit, to mitigate intermittent connectivity and best use of available time. To this end, two distinct schedulers are employed: one for coordinating the FL procedures among orbits, and the other for controlling those within each orbit. These two schedulers cooperatively determine the appropriate time to perform global updates in GS and then allocate suitable duration to satellites within each orbit for local training, proportional to usable time until next global update. This scheme leads to improved test accuracy within a shorter time. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2402.09105v1-abstract-full').style.display = 'none'; document.getElementById('2402.09105v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 February, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">2023 IEEE GLOBECOM</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.08258">arXiv:2401.08258</a> <span> [<a href="https://arxiv.org/pdf/2401.08258">pdf</a>, <a href="https://arxiv.org/format/2401.08258">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Time, Simultaneity, and Causality in Wireless Networks with Sensing and Communications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.08258v2-abstract-short" style="display: inline;"> Wireless systems beyond 5G evolve towards embracing both sensing and communication, resulting in increased convergence of the digital and the physical world. The existence of fused digital-physical realms raises critical questions regarding temporal ordering, causality, and the synchronization of events. This paper addresses the temporal challenges arising from the fact that the wireless infrastru… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.08258v2-abstract-full').style.display = 'inline'; document.getElementById('2401.08258v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.08258v2-abstract-full" style="display: none;"> Wireless systems beyond 5G evolve towards embracing both sensing and communication, resulting in increased convergence of the digital and the physical world. The existence of fused digital-physical realms raises critical questions regarding temporal ordering, causality, and the synchronization of events. This paper addresses the temporal challenges arising from the fact that the wireless infrastructure becomes an entity with multisensory perception. With the growing reliance on real-time interactions and applications such as digital twins, extended reality, and the metaverse, the need for accurate timestamping and temporal forensics becomes crucial. The paper introduces a model that incorporates Temporal Windows of Integration (TWI) to emulate human multisensory perception and discusses the implications for setting timing constraints in real-time applications and enabling temporal forensics. The analysis explores trade-offs, probabilities, and bounds for simultaneity and causality violation in the context of wireless systems evolving towards perceptive networks. This work underscores the significance of timestamping in the evolving wireless landscape, provide insights into system-level implications, and points out new research avenues for systems that combine sensing and communications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.08258v2-abstract-full').style.display = 'none'; document.getElementById('2401.08258v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 February, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 16 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for possible publication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.07446">arXiv:2401.07446</a> <span> [<a href="https://arxiv.org/pdf/2401.07446">pdf</a>, <a href="https://arxiv.org/format/2401.07446">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Quantized RIS-aided mmWave Massive MIMO Channel Estimation with Uniform Planar Arrays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Wang%2C+R">Ruizhe Wang</a>, <a href="/search/cs?searchtype=author&query=Ren%2C+H">Hong Ren</a>, <a href="/search/cs?searchtype=author&query=Pan%2C+C">Cunhua Pan</a>, <a href="/search/cs?searchtype=author&query=Jin%2C+S">Shi Jin</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Wang%2C+J">Jiangzhou Wang</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.07446v1-abstract-short" style="display: inline;"> In this paper, we investigate a cascaded channel estimation method for a millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) system aided by a reconfigurable intelligent surface (RIS) with the BS equipped with low-resolution analog-to-digital converters (ADCs), where the BS and the RIS are both equipped with a uniform planar array (UPA). Due to the sparse property of mmWave chan… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.07446v1-abstract-full').style.display = 'inline'; document.getElementById('2401.07446v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.07446v1-abstract-full" style="display: none;"> In this paper, we investigate a cascaded channel estimation method for a millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) system aided by a reconfigurable intelligent surface (RIS) with the BS equipped with low-resolution analog-to-digital converters (ADCs), where the BS and the RIS are both equipped with a uniform planar array (UPA). Due to the sparse property of mmWave channel, the channel estimation can be solved as a compressed sensing (CS) problem. However, the low-resolution quantization cause severe information loss of signals, and traditional CS algorithms are unable to work well. To recovery the signal and the sparse angular domain channel from quantization, we introduce Bayesian inference and efficient vector approximate message passing (VAMP) algorithm to solve the quantize output CS problem. To further improve the efficiency of the VAMP algorithm, a Fast Fourier Transform (FFT) based fast computation method is derived. Simulation results demonstrate the effectiveness and the accuracy of the proposed cascaded channel estimation method for the RIS-aided mmWave massive MIMO system with few-bit ADCs. Furthermore, the proposed channel estimation method can reach an acceptable performance gap between the low-resolution ADCs and the infinite ADCs for the low signal-to-noise ratio (SNR), which implies the applicability of few-bit ADCs in practice. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.07446v1-abstract-full').style.display = 'none'; document.getElementById('2401.07446v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.03189">arXiv:2401.03189</a> <span> [<a href="https://arxiv.org/pdf/2401.03189">pdf</a>, <a href="https://arxiv.org/format/2401.03189">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Applications">stat.AP</span> </div> </div> <p class="title is-5 mathjax"> Assessing the Potential of Space-Time-Coding Metasurfaces for Sensing and Localization </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Santos%2C+H+L+d">Herman L. dos Santos</a>, <a href="/search/cs?searchtype=author&query=Vejling%2C+M+V">Martin Voigt Vejling</a>, <a href="/search/cs?searchtype=author&query=Abr%C3%A3o%2C+T">Taufik Abr茫o</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.03189v1-abstract-short" style="display: inline;"> Intelligent metasurfaces are one of the favorite technologies for integrating sixth-generation (6G) networks, especially the reconfigurable intelligent surface (RIS) that has been extensively researched in various applications. In this context, a feature that deserves further exploration is the frequency scattering that occurs when the elements are periodically switched, referred to as Space-Time-… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.03189v1-abstract-full').style.display = 'inline'; document.getElementById('2401.03189v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.03189v1-abstract-full" style="display: none;"> Intelligent metasurfaces are one of the favorite technologies for integrating sixth-generation (6G) networks, especially the reconfigurable intelligent surface (RIS) that has been extensively researched in various applications. In this context, a feature that deserves further exploration is the frequency scattering that occurs when the elements are periodically switched, referred to as Space-Time-Coding metasurface (STCM) topology. This type of topology causes impairments to the established communication methods by generating undesirable interference both in frequency and space, which is worsened when using wideband signals. Nevertheless, it has the potential to bring forward useful features for sensing and localization. This work exploits STCM sensing capabilities in target detection, localization, and classification using narrowband downlink pilot signals at the base station (BS). The results of this novel approach reveal the ability to retrieve a scattering point (SP) localization within the sub-centimeter and sub-decimeter accuracy depending on the SP position in space. We also analyze the associated detection and classification probabilities, which show reliable detection performance in the whole analyzed environment. In contrast, the classification is bounded by physical constraints, and we conclude that this method presents a promising approach for future integrated sensing and communications (ISAC) protocols by providing a tool to perform sensing and localization services using legacy communication signals. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.03189v1-abstract-full').style.display = 'none'; document.getElementById('2401.03189v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages, 9 figures, 1 table. Manuscript submitted to IEEE-TWC on January 6th, 2024</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.01652">arXiv:2401.01652</a> <span> [<a href="https://arxiv.org/pdf/2401.01652">pdf</a>, <a href="https://arxiv.org/format/2401.01652">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Near Real-Time Data-Driven Control of Virtual Reality Traffic in Open Radio Access Network </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Casparsen%2C+A">Andreas Casparsen</a>, <a href="/search/cs?searchtype=author&query=Soret%2C+B">Beatriz Soret</a>, <a href="/search/cs?searchtype=author&query=Nielsen%2C+J+J">Jimmy Jessen Nielsen</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.01652v1-abstract-short" style="display: inline;"> In mobile networks, Open Radio Access Network (ORAN) provides a framework for implementing network slicing that interacts with the resources at the lower layers. Both monitoring and Radio Access Network (RAN) control is feasible for both 4G and 5G systems. In this work, we consider how data-driven resource allocation in a 4G context can enable adaptive slice allocation to steer the experienced lat… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.01652v1-abstract-full').style.display = 'inline'; document.getElementById('2401.01652v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.01652v1-abstract-full" style="display: none;"> In mobile networks, Open Radio Access Network (ORAN) provides a framework for implementing network slicing that interacts with the resources at the lower layers. Both monitoring and Radio Access Network (RAN) control is feasible for both 4G and 5G systems. In this work, we consider how data-driven resource allocation in a 4G context can enable adaptive slice allocation to steer the experienced latency of Virtual Reality (VR) traffic towards a requested latency. We develop an xApp for the near real-time RAN Intelligent Controller (RIC) that embeds a heuristic algorithm for latency control, aiming to: (1) maintain latency of a VR stream around a requested value; and (2) improve the available RAN allocation to offer higher bit rate to another user. We have experimentally demonstrated the proposed approach in an ORAN testbed. Our results show that the data-driven approach can dynamically follow the variation of the traffic load while satisfying the required latency. This results in 15.8% more resources to secondary users than a latency-equivalent static allocation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.01652v1-abstract-full').style.display = 'none'; document.getElementById('2401.01652v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">IEEE GLOBECOM 2023</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.01127">arXiv:2401.01127</a> <span> [<a href="https://arxiv.org/pdf/2401.01127">pdf</a>, <a href="https://arxiv.org/format/2401.01127">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/JPROC.2024.3484529">10.1109/JPROC.2024.3484529 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Wireless 6G Connectivity for Massive Number of Devices and Critical Services </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Kal%C3%B8r%2C+A+E">Anders E. Kal酶r</a>, <a href="/search/cs?searchtype=author&query=Durisi%2C+G">Giuseppe Durisi</a>, <a href="/search/cs?searchtype=author&query=Coleri%2C+S">Sinem Coleri</a>, <a href="/search/cs?searchtype=author&query=Parkvall%2C+S">Stefan Parkvall</a>, <a href="/search/cs?searchtype=author&query=Yu%2C+W">Wei Yu</a>, <a href="/search/cs?searchtype=author&query=Mueller%2C+A">Andreas Mueller</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.01127v5-abstract-short" style="display: inline;"> Compared to the generations up to 4G, whose main focus was on broadband and coverage aspects, 5G has expanded the scope of wireless cellular systems towards embracing two new types of connectivity: massive machine-type communication (mMTC) and ultra-reliable low-latency communications (URLLC). This paper discusses the possible evolution of these two types of connectivity within the umbrella of 6G… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.01127v5-abstract-full').style.display = 'inline'; document.getElementById('2401.01127v5-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.01127v5-abstract-full" style="display: none;"> Compared to the generations up to 4G, whose main focus was on broadband and coverage aspects, 5G has expanded the scope of wireless cellular systems towards embracing two new types of connectivity: massive machine-type communication (mMTC) and ultra-reliable low-latency communications (URLLC). This paper discusses the possible evolution of these two types of connectivity within the umbrella of 6G wireless systems. The paper consists of three parts. The first part deals with the connectivity for a massive number of devices. While mMTC research in 5G predominantly focuses on the problem of uncoordinated access in the uplink for a large number of devices, the traffic patterns in 6G may become more symmetric, leading to closed-loop massive connectivity. One of the drivers for this is distributed learning/inference. The second part of the paper discusses the evolution of wireless connectivity for critical services. While latency and reliability are tightly coupled in 5G, 6G will support a variety of safety critical control applications with different types of timing requirements, as evidenced by the emergence of metrics related to information freshness and information value. Additionally, ensuring ultra-high reliability for safety critical control applications requires modeling and estimation of the tail statistics of the wireless channel, queue length, and delay. The fulfillment of these stringent requirements calls for the development of novel AI-based techniques, incorporating optimization theory, explainable AI, generative AI and digital twins. The third part analyzes the coexistence of massive connectivity and critical services. We will consider scenarios in which a massive number of devices need to support traffic patterns of mixed criticality. This is followed by a discussion about the management of wireless resources shared by services with different criticality. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.01127v5-abstract-full').style.display = 'none'; document.getElementById('2401.01127v5-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 2 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted to Proceedings of the IEEE. 19 pages, 8 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2312.16064">arXiv:2312.16064</a> <span> [<a href="https://arxiv.org/pdf/2312.16064">pdf</a>, <a href="https://arxiv.org/format/2312.16064">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Goal-Oriented Integration of Sensing, Communication, Computing, and Control for Mission-Critical Internet-of-Things </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Cao%2C+J">Jie Cao</a>, <a href="/search/cs?searchtype=author&query=Kurniawan%2C+E">Ernest Kurniawan</a>, <a href="/search/cs?searchtype=author&query=Boonkajay%2C+A">Amnart Boonkajay</a>, <a href="/search/cs?searchtype=author&query=Sun%2C+S">Sumei Sun</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Zhu%2C+X">Xu Zhu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2312.16064v2-abstract-short" style="display: inline;"> Driven by the development goal of network paradigm and demand for various functions in the sixth-generation (6G) mission-critical Internet-of-Things (MC-IoT), we foresee a goal-oriented integration of sensing, communication, computing, and control (GIS3C) in this paper. We first provide an overview of the tasks, requirements, and challenges of MC-IoT. Then we introduce an end-to-end GIS3C architec… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.16064v2-abstract-full').style.display = 'inline'; document.getElementById('2312.16064v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2312.16064v2-abstract-full" style="display: none;"> Driven by the development goal of network paradigm and demand for various functions in the sixth-generation (6G) mission-critical Internet-of-Things (MC-IoT), we foresee a goal-oriented integration of sensing, communication, computing, and control (GIS3C) in this paper. We first provide an overview of the tasks, requirements, and challenges of MC-IoT. Then we introduce an end-to-end GIS3C architecture, in which goal-oriented communication is leveraged to bridge and empower sensing, communication, control, and computing functionalities. By revealing the interplay among multiple subsystems in terms of key performance indicators and parameters, this paper introduces unified metrics, i.e., task completion effectiveness and cost, to facilitate S3C co-design in MC-IoT. The preliminary results demonstrate the benefits of GIS3C in improving task completion effectiveness while reducing costs. We also identify and highlight the gaps and challenges in applying GIS3C in the future 6G networks. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.16064v2-abstract-full').style.display = 'none'; document.getElementById('2312.16064v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 26 December, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2312.09108">arXiv:2312.09108</a> <span> [<a href="https://arxiv.org/pdf/2312.09108">pdf</a>, <a href="https://arxiv.org/ps/2312.09108">ps</a>, <a href="https://arxiv.org/format/2312.09108">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/LNET.2024.3363620">10.1109/LNET.2024.3363620 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Greedy Shapley Client Selection for Communication-Efficient Federated Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Singhal%2C+P">Pranava Singhal</a>, <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2312.09108v3-abstract-short" style="display: inline;"> The standard client selection algorithms for Federated Learning (FL) are often unbiased and involve uniform random sampling of clients. This has been proven sub-optimal for fast convergence under practical settings characterized by significant heterogeneity in data distribution, computing, and communication resources across clients. For applications having timing constraints due to limited communi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.09108v3-abstract-full').style.display = 'inline'; document.getElementById('2312.09108v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2312.09108v3-abstract-full" style="display: none;"> The standard client selection algorithms for Federated Learning (FL) are often unbiased and involve uniform random sampling of clients. This has been proven sub-optimal for fast convergence under practical settings characterized by significant heterogeneity in data distribution, computing, and communication resources across clients. For applications having timing constraints due to limited communication opportunities with the parameter server (PS), the client selection strategy is critical to complete model training within the fixed budget of communication rounds. To address this, we develop a biased client selection strategy, GreedyFed, that identifies and greedily selects the most contributing clients in each communication round. This method builds on a fast approximation algorithm for the Shapley Value at the PS, making the computation tractable for real-world applications with many clients. Compared to various client selection strategies on several real-world datasets, GreedyFed demonstrates fast and stable convergence with high accuracy under timing constraints and when imposing a higher degree of heterogeneity in data distribution, systems constraints, and privacy requirements. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.09108v3-abstract-full').style.display = 'none'; document.getElementById('2312.09108v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 February, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 14 December, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted for publication in IEEE Networking Letters</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2312.05398">arXiv:2312.05398</a> <span> [<a href="https://arxiv.org/pdf/2312.05398">pdf</a>, <a href="https://arxiv.org/ps/2312.05398">ps</a>, <a href="https://arxiv.org/format/2312.05398">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Generative Network Layer for Communication Systems with Artificial Intelligence </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Thorsager%2C+M">Mathias Thorsager</a>, <a href="/search/cs?searchtype=author&query=Leyva-Mayorga%2C+I">Israel Leyva-Mayorga</a>, <a href="/search/cs?searchtype=author&query=Soret%2C+B">Beatriz Soret</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2312.05398v3-abstract-short" style="display: inline;"> The traditional role of the network layer is the transfer of packet replicas from source to destination through intermediate network nodes. We present a generative network layer that uses Generative AI (GenAI) at intermediate or edge network nodes and analyze its impact on the required data rates in the network. We conduct a case study where the GenAI-aided nodes generate images from prompts that… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.05398v3-abstract-full').style.display = 'inline'; document.getElementById('2312.05398v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2312.05398v3-abstract-full" style="display: none;"> The traditional role of the network layer is the transfer of packet replicas from source to destination through intermediate network nodes. We present a generative network layer that uses Generative AI (GenAI) at intermediate or edge network nodes and analyze its impact on the required data rates in the network. We conduct a case study where the GenAI-aided nodes generate images from prompts that consist of substantially compressed latent representations. The results from network flow analyses under image quality constraints show that the generative network layer can achieve an improvement of more than 100% in terms of the required data rate. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.05398v3-abstract-full').style.display = 'none'; document.getElementById('2312.05398v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 8 December, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted for publication in IEEE Networking Letters</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2312.03131">arXiv:2312.03131</a> <span> [<a href="https://arxiv.org/pdf/2312.03131">pdf</a>, <a href="https://arxiv.org/format/2312.03131">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Heterogeneous radio access with multiple latency targets </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Leyva-Mayorga%2C+I">Israel Leyva-Mayorga</a>, <a href="/search/cs?searchtype=author&query=Gimenez-Guzman%2C+J+M">Jose Manuel Gimenez-Guzman</a>, <a href="/search/cs?searchtype=author&query=Valentini%2C+L">Lorenzo Valentini</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2312.03131v1-abstract-short" style="display: inline;"> Since the advent of ultra-reliable and low-latency communications (URLLC), the requirements of low-latency applications tend to be completely characterized by a single pre-defined latency-reliability target. That is, operation is optimal whenever the pre-defined latency threshold is met but the system is assumed to be in error when the latency threshold is violated. This vision is severely limited… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.03131v1-abstract-full').style.display = 'inline'; document.getElementById('2312.03131v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2312.03131v1-abstract-full" style="display: none;"> Since the advent of ultra-reliable and low-latency communications (URLLC), the requirements of low-latency applications tend to be completely characterized by a single pre-defined latency-reliability target. That is, operation is optimal whenever the pre-defined latency threshold is met but the system is assumed to be in error when the latency threshold is violated. This vision is severely limited and does not capture the real requirements of most applications, where multiple latency thresholds can be defined, together with incentives or rewards associated with meeting each of them. Such formulation is a generalization of the single-threshold case popularized by URLLC and, in the asymptotic case, approximates to defining a cost for each point in the support of the latency distribution. In this paper, we explore the implications of defining multiple latency targets on the design of access protocols and on the optimization of repetition-based access strategies in orthogonal and non-orthogonal multiple access scenarios with users that present heterogeneous traffic characteristics and requirements. We observe that the access strategies of the users can be effectively adapted to the requirements of the application by carefully defining the latency targets and the associated rewards. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.03131v1-abstract-full').style.display = 'none'; document.getElementById('2312.03131v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 5 December, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">To be published in Proceedings of Asilomar conference 2023</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2312.02611">arXiv:2312.02611</a> <span> [<a href="https://arxiv.org/pdf/2312.02611">pdf</a>, <a href="https://arxiv.org/format/2312.02611">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computer Science and Game Theory">cs.GT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TNNLS.2024.3521056">10.1109/TNNLS.2024.3521056 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Privacy-Aware Data Acquisition under Data Similarity in Regression Markets </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Pinson%2C+P">Pierre Pinson</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2312.02611v2-abstract-short" style="display: inline;"> Data markets facilitate decentralized data exchange for applications such as prediction, learning, or inference. The design of these markets is challenged by varying privacy preferences as well as data similarity among data owners. Related works have often overlooked how data similarity impacts pricing and data value through statistical information leakage. We demonstrate that data similarity and… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.02611v2-abstract-full').style.display = 'inline'; document.getElementById('2312.02611v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2312.02611v2-abstract-full" style="display: none;"> Data markets facilitate decentralized data exchange for applications such as prediction, learning, or inference. The design of these markets is challenged by varying privacy preferences as well as data similarity among data owners. Related works have often overlooked how data similarity impacts pricing and data value through statistical information leakage. We demonstrate that data similarity and privacy preferences are integral to market design and propose a query-response protocol using local differential privacy for a two-party data acquisition mechanism. In our regression data market model, we analyze strategic interactions between privacy-aware owners and the learner as a Stackelberg game over the asked price and privacy factor. Finally, we numerically evaluate how data similarity affects market participation and traded data value. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.02611v2-abstract-full').style.display = 'none'; document.getElementById('2312.02611v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 December, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted to IEEE Transactions on Neural Networks and Learning Systems</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2312.02176">arXiv:2312.02176</a> <span> [<a href="https://arxiv.org/pdf/2312.02176">pdf</a>, <a href="https://arxiv.org/format/2312.02176">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Probability">math.PR</span> </div> </div> <p class="title is-5 mathjax"> Channel Scheduling for IoT Access with Spatial Correlation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Raghuwanshi%2C+P">Prasoon Raghuwanshi</a>, <a href="/search/cs?searchtype=author&query=L%C3%B3pez%2C+O+L+A">Onel Luis Alcaraz L贸pez</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Latva-aho%2C+M">Matti Latva-aho</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2312.02176v1-abstract-short" style="display: inline;"> Spatially correlated device activation is a typical feature of the Internet of Things (IoT). This motivates the development of channel scheduling (CS) methods that mitigate device collisions efficiently in such scenarios, which constitutes the scope of this work. Specifically, we present a quadratic program (QP) formulation for the CS problem considering the joint activation probabilities among de… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.02176v1-abstract-full').style.display = 'inline'; document.getElementById('2312.02176v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2312.02176v1-abstract-full" style="display: none;"> Spatially correlated device activation is a typical feature of the Internet of Things (IoT). This motivates the development of channel scheduling (CS) methods that mitigate device collisions efficiently in such scenarios, which constitutes the scope of this work. Specifically, we present a quadratic program (QP) formulation for the CS problem considering the joint activation probabilities among devices. This formulation allows the devices to stochastically select the transmit channels, thus, leading to a soft-clustering approach. We prove that the optimal QP solution can only be attained when it is transformed into a hard-clustering problem, leading to a pure integer QP, which we transform into a pure integer linear program (PILP). We leverage the branch-and-cut (B&C) algorithm to solve PILP optimally. Due to the high computational cost of B&C, we resort to some sub-optimal clustering methods with low computational costs to tackle the clustering problem in CS. Our findings demonstrate that the CS strategy, sourced from B&C, significantly outperforms those derived from sub-optimal clustering methods, even amidst increased device correlation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2312.02176v1-abstract-full').style.display = 'none'; document.getElementById('2312.02176v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2311.12809">arXiv:2311.12809</a> <span> [<a href="https://arxiv.org/pdf/2311.12809">pdf</a>, <a href="https://arxiv.org/format/2311.12809">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Emerging Technologies">cs.ET</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> High-Power and Safe RF Wireless Charging: Cautious Deployment and Operation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=L%C3%B3pez%2C+O+L+A">Onel L. A. L贸pez</a>, <a href="/search/cs?searchtype=author&query=Rosabal%2C+O+M">Osmel M. Rosabal</a>, <a href="/search/cs?searchtype=author&query=Azarbahram%2C+A">Amirhossein Azarbahram</a>, <a href="/search/cs?searchtype=author&query=Khattak%2C+A+B">A. Basit Khattak</a>, <a href="/search/cs?searchtype=author&query=Monemi%2C+M">Mehdi Monemi</a>, <a href="/search/cs?searchtype=author&query=Souza%2C+R+D">Richard D. Souza</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Latva-aho%2C+M">Matti Latva-aho</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2311.12809v1-abstract-short" style="display: inline;"> The wired charging and the need for battery replacements are critical barriers to unlimited, scalable, and sustainable mobile connectivity, motivating the interest in radio frequency (RF) wireless power transfer (WPT) technology. However, the inherently low end-to-end power transfer efficiency (PTE) and health/safety-related apprehensions about the technology are critical obstacles. Indeed, RF-WPT… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.12809v1-abstract-full').style.display = 'inline'; document.getElementById('2311.12809v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2311.12809v1-abstract-full" style="display: none;"> The wired charging and the need for battery replacements are critical barriers to unlimited, scalable, and sustainable mobile connectivity, motivating the interest in radio frequency (RF) wireless power transfer (WPT) technology. However, the inherently low end-to-end power transfer efficiency (PTE) and health/safety-related apprehensions about the technology are critical obstacles. Indeed, RF-WPT implementation and operation require efficient and cautious strategies and protocols, especially when targeting high-power charging, which constitutes the scope of this work. Herein, we overview the main factors affecting the end-to-end PTE of RF-WPT systems and their multiplicative effect and interdependencies. Moreover, we discuss key electromagnetic field (EMF) exposure metrics, safety limits, and approaches for efficient and EMF-aware deployment and operation. Quantitatively, we show that near-field RF charging may significantly reduce EMF exposure, and thus must be promoted. We also present our vision of a cyber-physical system for efficient and safe wireless charging, specify key components and their interrelation, and illustrate numerically the PTE attained by two modern low-power multi-antenna architectures in a simple setup. Throughout the paper, we highlight the need for high end-to-end PTE architectures and charging protocols transparently complying with EMF exposure regulations and outline relevant challenges and research directions. This work expands the vision and understanding of modern RF-WPT technology and constitutes a step towards making the technology attractive for worldwide commercial exploitation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.12809v1-abstract-full').style.display = 'none'; document.getElementById('2311.12809v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages, 5 figures, 1 table</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> C.2.1; C.2.m; C.3; J.2; J.m </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2311.08053">arXiv:2311.08053</a> <span> [<a href="https://arxiv.org/pdf/2311.08053">pdf</a>, <a href="https://arxiv.org/format/2311.08053">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Batch Selection and Communication for Active Learning with Edge Labeling </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Croisfelt%2C+V">Victor Croisfelt</a>, <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Simeone%2C+O">Osvaldo Simeone</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2311.08053v4-abstract-short" style="display: inline;"> Conventional retransmission (ARQ) protocols are designed with the goal of ensuring the correct reception of all the individual transmitter's packets at the receiver. When the transmitter is a learner communicating with a teacher, this goal is at odds with the actual aim of the learner, which is that of eliciting the most relevant label information from the teacher. Taking an active learning perspe… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.08053v4-abstract-full').style.display = 'inline'; document.getElementById('2311.08053v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2311.08053v4-abstract-full" style="display: none;"> Conventional retransmission (ARQ) protocols are designed with the goal of ensuring the correct reception of all the individual transmitter's packets at the receiver. When the transmitter is a learner communicating with a teacher, this goal is at odds with the actual aim of the learner, which is that of eliciting the most relevant label information from the teacher. Taking an active learning perspective, this paper addresses the following key protocol design questions: (i) Active batch selection: Which batch of inputs should be sent to the teacher to acquire the most useful information and thus reduce the number of required communication rounds? (ii) Batch encoding: Can batches of data points be combined to reduce the communication resources required at each communication round? Specifically, this work introduces Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD), a novel protocol that integrates Bayesian active learning with compression via a linear mix-up mechanism. Comparisons with existing active learning protocols demonstrate the advantages of the proposed approach. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.08053v4-abstract-full').style.display = 'none'; document.getElementById('2311.08053v4-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 14 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages, 4 figures, conference version, accepted in IEEE ICC 2024, Workshop on Task-Oriented and Generative Communications For 6G</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2311.06432">arXiv:2311.06432</a> <span> [<a href="https://arxiv.org/pdf/2311.06432">pdf</a>, <a href="https://arxiv.org/ps/2311.06432">ps</a>, <a href="https://arxiv.org/format/2311.06432">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Effective Communication: When to Pull Updates? </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Agheli%2C+P">Pouya Agheli</a>, <a href="/search/cs?searchtype=author&query=Pappas%2C+N">Nikolaos Pappas</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Kountouris%2C+M">Marios Kountouris</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2311.06432v2-abstract-short" style="display: inline;"> We study a pull-based communication system where a sensing agent updates an actuation agent using a query control policy, which is adjusted in the evolution of an observed information source and the usefulness of each update for achieving a specific goal. For that, a controller decides whether to pull an update at each slot, predicting what is probably occurring at the source and how much effectiv… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.06432v2-abstract-full').style.display = 'inline'; document.getElementById('2311.06432v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2311.06432v2-abstract-full" style="display: none;"> We study a pull-based communication system where a sensing agent updates an actuation agent using a query control policy, which is adjusted in the evolution of an observed information source and the usefulness of each update for achieving a specific goal. For that, a controller decides whether to pull an update at each slot, predicting what is probably occurring at the source and how much effective impact that update could have at the endpoint. Thus, temporal changes in the source evolution could modify the query arrivals so as to capture important updates. The amount of impact is determined by a grade of effectiveness (GoE) metric, which incorporates both freshness and usefulness attributes of the communicated updates. Applying an iterative algorithm, we derive query decisions that maximize the long-term average GoE for the communicated packets, subject to cost constraints. Our analytical and numerical results show that the proposed query policy exhibits higher effectiveness than existing periodic and probabilistic query policies for a wide range of query arrival rates. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.06432v2-abstract-full').style.display = 'none'; document.getElementById('2311.06432v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 February, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted to be presented in the IEEE ICC 2024</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2311.04788">arXiv:2311.04788</a> <span> [<a href="https://arxiv.org/pdf/2311.04788">pdf</a>, <a href="https://arxiv.org/format/2311.04788">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> TinyAirNet: TinyML Model Transmission for Energy-efficient Image Retrieval from IoT Devices </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shiraishi%2C+J">Junya Shiraishi</a>, <a href="/search/cs?searchtype=author&query=Thorsager%2C+M">Mathias Thorsager</a>, <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2311.04788v3-abstract-short" style="display: inline;"> This letter introduces an energy-efficient pull-based data collection framework for Internet of Things (IoT) devices that use Tiny Machine Learning (TinyML) to interpret data queries. A TinyML model is transmitted from the edge server to the IoT devices. The devices employ the model to facilitate the subsequent semantic queries. This reduces the transmission of irrelevant data, but receiving the M… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.04788v3-abstract-full').style.display = 'inline'; document.getElementById('2311.04788v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2311.04788v3-abstract-full" style="display: none;"> This letter introduces an energy-efficient pull-based data collection framework for Internet of Things (IoT) devices that use Tiny Machine Learning (TinyML) to interpret data queries. A TinyML model is transmitted from the edge server to the IoT devices. The devices employ the model to facilitate the subsequent semantic queries. This reduces the transmission of irrelevant data, but receiving the ML model and its processing at the IoT devices consume additional energy. We consider the specific instance of image retrieval in a single device scenario and investigate the gain brought by the proposed scheme in terms of energy efficiency and retrieval accuracy, while considering the cost of computation and communication, as well as memory constraints. Numerical evaluation shows that, compared to a baseline scheme, the proposed scheme reaches up to 67% energy reduction under the accuracy constraint when many images are stored. Although focused on image retrieval, our analysis is indicative of a broader set of communication scenarios in which the preemptive transmission of an ML model can increase communication efficiency. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.04788v3-abstract-full').style.display = 'none'; document.getElementById('2311.04788v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 June, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 8 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">5 pages, 3 figures, Submitted for possible publication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2309.12803">arXiv:2309.12803</a> <span> [<a href="https://arxiv.org/pdf/2309.12803">pdf</a>, <a href="https://arxiv.org/format/2309.12803">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Performance Analysis of Uplink Rate-Splitting Multiple Access with Hybrid ARQ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Liu%2C+Y">Yuanwen Liu</a>, <a href="/search/cs?searchtype=author&query=Clerckx%2C+B">Bruno Clerckx</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2309.12803v2-abstract-short" style="display: inline;"> Rate-splitting multiple access (RSMA) has attracted a lot of attention as a general and powerful multiple access scheme. In the uplink, instead of encoding the whole message into one stream, a user can split its message into two parts and encode them into two streams before transmitting a superposition of these two streams. The base station (BS) uses successive interference cancellation (SIC) to d… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.12803v2-abstract-full').style.display = 'inline'; document.getElementById('2309.12803v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2309.12803v2-abstract-full" style="display: none;"> Rate-splitting multiple access (RSMA) has attracted a lot of attention as a general and powerful multiple access scheme. In the uplink, instead of encoding the whole message into one stream, a user can split its message into two parts and encode them into two streams before transmitting a superposition of these two streams. The base station (BS) uses successive interference cancellation (SIC) to decode the streams and reconstruct the original messages. Focusing on the packet transmission reliability, we investigate the features of RSMA in the context of hybrid automatic repeat request (HARQ), a well-established mechanism for enhancing reliability. This work proposes a HARQ scheme for uplink RSMA with different retransmission times for a two-user scenario and introduces a power allocation strategy for the two split streams. The results show that compared with non-orthogonal multiple access (NOMA) and frequency division multiple access (FDMA), RSMA outperforms them in terms of error probability and power consumption. The results show that RSMA with HARQ has the potential to improve the reliability and efficiency of wireless communication systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.12803v2-abstract-full').style.display = 'none'; document.getElementById('2309.12803v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 June, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2309.06769">arXiv:2309.06769</a> <span> [<a href="https://arxiv.org/pdf/2309.06769">pdf</a>, <a href="https://arxiv.org/format/2309.06769">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TIT.2024.3485173">10.1109/TIT.2024.3485173 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Reliability-Latency-Rate Tradeoff in Low-Latency Communications with Finite-Blocklength Coding </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Li%2C+L">Lintao Li</a>, <a href="/search/cs?searchtype=author&query=Chen%2C+W">Wei Chen</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a>, <a href="/search/cs?searchtype=author&query=Letaief%2C+K+B">Khaled B. Letaief</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2309.06769v4-abstract-short" style="display: inline;"> Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency is challenging. In this paper, we investigate the reliability-latency-rate tradeoff in low-latency communication systems with finite-blocklength coding (FBC). Sp… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.06769v4-abstract-full').style.display = 'inline'; document.getElementById('2309.06769v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2309.06769v4-abstract-full" style="display: none;"> Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency is challenging. In this paper, we investigate the reliability-latency-rate tradeoff in low-latency communication systems with finite-blocklength coding (FBC). Specifically, we are interested in the fundamental tradeoff between error probability, delay-violation probability (DVP), and service rate. Based on the effective capacity (EC), we present the gain-conservation equations to characterize the reliability-latency-rate tradeoffs in low-latency communication systems. In particular, we investigate the low-latency transmissions over an additive white Gaussian noise (AWGN) channel and a Nakagami-$m$ fading channel. By defining the service rate gain, reliability gain, and real-time gain, we conduct an asymptotic analysis to reveal the fundamental reliability-latency-rate tradeoff of ultra-reliable and low-latency communications in the high signal-to-noise-ratio (SNR) regime. To analytically evaluate and optimize the quality-of-service-constrained throughput of low-latency communication systems adopting FBC, an EC-approximation method is conceived to derive the closed-form expression of that throughput. Our results may offer some insights into the efficient scheduling of low-latency wireless communications, in which statistical latency and reliability metrics are crucial. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.06769v4-abstract-full').style.display = 'none'; document.getElementById('2309.06769v4-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 October, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 13 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted by IEEE Transactions on Information Theory, 2024. DOI: 10.1109/TIT.2024.3485173. URL: https://ieeexplore.ieee.org/document/10731885</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2309.02837">arXiv:2309.02837</a> <span> [<a href="https://arxiv.org/pdf/2309.02837">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TQE.2025.3528238">10.1109/TQE.2025.3528238 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Valentini%2C+L">Lorenzo Valentini</a>, <a href="/search/cs?searchtype=author&query=Jensen%2C+K+S">Kristian Skafte Jensen</a>, <a href="/search/cs?searchtype=author&query=Christensen%2C+R+B">Ren茅 B酶dker Christensen</a>, <a href="/search/cs?searchtype=author&query=Chiani%2C+M">Marco Chiani</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2309.02837v2-abstract-short" style="display: inline;"> In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.02837v2-abstract-full').style.display = 'inline'; document.getElementById('2309.02837v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2309.02837v2-abstract-full" style="display: none;"> In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyze this both in an ideal setting with no decoherence and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the NetSquid framework. We compare the simulation results with the theoretical values. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2309.02837v2-abstract-full').style.display = 'none'; document.getElementById('2309.02837v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 6 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages. Identical to published journal paper</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 81P45; 94A40 </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Trans. Quant. Eng., Vol. 6 (2025) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2308.14416">arXiv:2308.14416</a> <span> [<a href="https://arxiv.org/pdf/2308.14416">pdf</a>, <a href="https://arxiv.org/format/2308.14416">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> On the Statistical Relation of Ultra-Reliable Wireless and Location Estimation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Kallehauge%2C+T">Tobias Kallehauge</a>, <a href="/search/cs?searchtype=author&query=Vejling%2C+M+V">Martin Voigt Vejling</a>, <a href="/search/cs?searchtype=author&query=Ram%C3%ACrez-Espinosa%2C+P">Pablo Ram矛rez-Espinosa</a>, <a href="/search/cs?searchtype=author&query=Kansanen%2C+K">Kimmo Kansanen</a>, <a href="/search/cs?searchtype=author&query=Wymeersch%2C+H">Henk Wymeersch</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2308.14416v1-abstract-short" style="display: inline;"> Location information is often used as a proxy to guarantee the performance of a wireless communication link. However, localization errors can result in a significant mismatch with the guarantees, particularly detrimental to users operating the ultra-reliable low-latency communication (URLLC) regime. This paper unveils the fundamental statistical relations between location estimation uncertainty an… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.14416v1-abstract-full').style.display = 'inline'; document.getElementById('2308.14416v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2308.14416v1-abstract-full" style="display: none;"> Location information is often used as a proxy to guarantee the performance of a wireless communication link. However, localization errors can result in a significant mismatch with the guarantees, particularly detrimental to users operating the ultra-reliable low-latency communication (URLLC) regime. This paper unveils the fundamental statistical relations between location estimation uncertainty and wireless link reliability, specifically in the context of rate selection for ultra-reliable communication. We start with a simple one-dimensional narrowband Rayleigh fading scenario and build towards a two-dimensional scenario in a rich scattering environment. The wireless link reliability is characterized by the meta-probability, the probability with respect to localization error of exceeding the outage capacity, and by removing other sources of errors in the system, we show that reliability is sensitive to localization errors. The $蔚$-outage coherence radius is defined and shown to provide valuable insight into the problem of location-based rate selection. However, it is generally challenging to guarantee reliability without accurate knowledge of the propagation environment. Finally, several rate-selection schemes are proposed, showcasing the problem's dynamics and revealing that properly accounting for the localization error is critical to ensure good performance in terms of reliability and achievable throughput. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.14416v1-abstract-full').style.display = 'none'; document.getElementById('2308.14416v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 August, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for IEEE Transactions of Wireless Communications on July 16th 2023</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2307.08346">arXiv:2307.08346</a> <span> [<a href="https://arxiv.org/pdf/2307.08346">pdf</a>, <a href="https://arxiv.org/format/2307.08346">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TCOMM.2024.3356429">10.1109/TCOMM.2024.3356429 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> On-board Federated Learning for Satellite Clusters with Inter-Satellite Links </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Razmi%2C+N">Nasrin Razmi</a>, <a href="/search/cs?searchtype=author&query=Matthiesen%2C+B">Bho Matthiesen</a>, <a href="/search/cs?searchtype=author&query=Dekorsy%2C+A">Armin Dekorsy</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2307.08346v2-abstract-short" style="display: inline;"> The emergence of mega-constellations of interconnected satellites has a major impact on the integration of cellular wireless and non-terrestrial networks, while simultaneously offering previously inconceivable data gathering capabilities. This paper studies the problem of running a federated learning (FL) algorithm within low Earth orbit satellite constellations connected with intra-orbit inter-sa… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.08346v2-abstract-full').style.display = 'inline'; document.getElementById('2307.08346v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2307.08346v2-abstract-full" style="display: none;"> The emergence of mega-constellations of interconnected satellites has a major impact on the integration of cellular wireless and non-terrestrial networks, while simultaneously offering previously inconceivable data gathering capabilities. This paper studies the problem of running a federated learning (FL) algorithm within low Earth orbit satellite constellations connected with intra-orbit inter-satellite links (ISL), aiming to efficiently process collected data in situ. Satellites apply on-board machine learning and transmit local parameters to the parameter server (PS). The main contribution is a novel approach to enhance FL in satellite constellations using intra-orbit ISLs. The key idea is to rely on predictability of satellite visits to create a system design in which ISLs mitigate the impact of intermittent connectivity and transmit aggregated parameters to the PS. We first devise a synchronous FL, which is extended towards an asynchronous FL for the case of sparse satellite visits to the PS. An efficient use of the satellite resources is attained by sparsification-based compression the aggregated parameters within each orbit. Performance is evaluated in terms of accuracy and required data transmission size. We observe a sevenfold increase in convergence speed over the state-of-the-art using ISLs, and $10\times$ reduction in communication load through the proposed in-network aggregation strategy. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.08346v2-abstract-full').style.display = 'none'; document.getElementById('2307.08346v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 December, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Transactions on Communications ( Volume: 72, Issue: 6, June 2024) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2306.17580">arXiv:2306.17580</a> <span> [<a href="https://arxiv.org/pdf/2306.17580">pdf</a>, <a href="https://arxiv.org/format/2306.17580">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Timely and Massive Communication in 6G: Pragmatics, Learning, and Inference </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=G%C3%BCnd%C3%BCz%2C+D">Deniz G眉nd眉z</a>, <a href="/search/cs?searchtype=author&query=Chiariotti%2C+F">Federico Chiariotti</a>, <a href="/search/cs?searchtype=author&query=Huang%2C+K">Kaibin Huang</a>, <a href="/search/cs?searchtype=author&query=Kal%C3%B8r%2C+A+E">Anders E. Kal酶r</a>, <a href="/search/cs?searchtype=author&query=Kobus%2C+S">Szymon Kobus</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2306.17580v2-abstract-short" style="display: inline;"> 5G has expanded the traditional focus of wireless systems to embrace two new connectivity types: ultra-reliable low latency and massive communication. The technology context at the dawn of 6G is different from the past one for 5G, primarily due to the growing intelligence at the communicating nodes. This has driven the set of relevant communication problems beyond reliable transmission towards sem… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.17580v2-abstract-full').style.display = 'inline'; document.getElementById('2306.17580v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2306.17580v2-abstract-full" style="display: none;"> 5G has expanded the traditional focus of wireless systems to embrace two new connectivity types: ultra-reliable low latency and massive communication. The technology context at the dawn of 6G is different from the past one for 5G, primarily due to the growing intelligence at the communicating nodes. This has driven the set of relevant communication problems beyond reliable transmission towards semantic and pragmatic communication. This paper puts the evolution of low-latency and massive communication towards 6G in the perspective of these new developments. At first, semantic/pragmatic communication problems are presented by drawing parallels to linguistics. We elaborate upon the relation of semantic communication to the information-theoretic problems of source/channel coding, while generalized real-time communication is put in the context of cyber-physical systems and real-time inference. The evolution of massive access towards massive closed-loop communication is elaborated upon, enabling interactive communication, learning, and cooperation among wireless sensors and actuators. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.17580v2-abstract-full').style.display = 'none'; document.getElementById('2306.17580v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 30 June, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted for publication to IEEE BITS (revised version preprint)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2306.03750">arXiv:2306.03750</a> <span> [<a href="https://arxiv.org/pdf/2306.03750">pdf</a>, <a href="https://arxiv.org/format/2306.03750">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TCOMM.2023.3282256">10.1109/TCOMM.2023.3282256 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Goal-Oriented Scheduling in Sensor Networks with Application Timing Awareness </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Holm%2C+J">Josefine Holm</a>, <a href="/search/cs?searchtype=author&query=Chiariotti%2C+F">Federico Chiariotti</a>, <a href="/search/cs?searchtype=author&query=Kal%C3%B8r%2C+A+E">Anders E. Kal酶r</a>, <a href="/search/cs?searchtype=author&query=Soret%2C+B">Beatriz Soret</a>, <a href="/search/cs?searchtype=author&query=Pedersen%2C+T+B">Torben Bach Pedersen</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2306.03750v1-abstract-short" style="display: inline;"> Taking inspiration from linguistics, the communications theoretical community has recently shown a significant recent interest in pragmatic , or goal-oriented, communication. In this paper, we tackle the problem of pragmatic communication with multiple clients with different, and potentially conflicting, objectives. We capture the goal-oriented aspect through the metric of Value of Information (Vo… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.03750v1-abstract-full').style.display = 'inline'; document.getElementById('2306.03750v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2306.03750v1-abstract-full" style="display: none;"> Taking inspiration from linguistics, the communications theoretical community has recently shown a significant recent interest in pragmatic , or goal-oriented, communication. In this paper, we tackle the problem of pragmatic communication with multiple clients with different, and potentially conflicting, objectives. We capture the goal-oriented aspect through the metric of Value of Information (VoI), which considers the estimation of the remote process as well as the timing constraints. However, the most common definition of VoI is simply the Mean Square Error (MSE) of the whole system state, regardless of the relevance for a specific client. Our work aims to overcome this limitation by including different summary statistics, i.e., value functions of the state, for separate clients, and a diversified query process on the client side, expressed through the fact that different applications may request different functions of the process state at different times. A query-aware Deep Reinforcement Learning (DRL) solution based on statically defined VoI can outperform naive approaches by 15-20%. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.03750v1-abstract-full').style.display = 'none'; document.getElementById('2306.03750v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 June, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Transactions on Communications, 2023 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2306.02726">arXiv:2306.02726</a> <span> [<a href="https://arxiv.org/pdf/2306.02726">pdf</a>, <a href="https://arxiv.org/format/2306.02726">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Learning-Based Rich Feedback HARQ for Energy-Efficient Uplink Short Packet Transmission </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Vejling%2C+M+V">Martin Voigt Vejling</a>, <a href="/search/cs?searchtype=author&query=Chiariotti%2C+F">Federico Chiariotti</a>, <a href="/search/cs?searchtype=author&query=Kal%C3%B8r%2C+A+E">Anders Ellersgaard Kal酶r</a>, <a href="/search/cs?searchtype=author&query=G%C3%BCnd%C3%BCz%2C+D">Deniz G眉nd眉z</a>, <a href="/search/cs?searchtype=author&query=Liva%2C+G">Gianluigi Liva</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2306.02726v2-abstract-short" style="display: inline;"> The trade-off between reliability, latency, and energy efficiency is a central problem in communication systems. Advanced hybrid automated repeat request (HARQ) techniques reduce retransmissions required for reliable communication but incur high computational costs. Strict energy constraints apply mainly to devices, while the access point receiving their packets is usually connected to the electri… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.02726v2-abstract-full').style.display = 'inline'; document.getElementById('2306.02726v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2306.02726v2-abstract-full" style="display: none;"> The trade-off between reliability, latency, and energy efficiency is a central problem in communication systems. Advanced hybrid automated repeat request (HARQ) techniques reduce retransmissions required for reliable communication but incur high computational costs. Strict energy constraints apply mainly to devices, while the access point receiving their packets is usually connected to the electrical grid. Therefore, moving the computational complexity from the transmitter to the receiver may provide a way to improve this trade-off. We propose the reinforcement-based adaptive feedback (RAF) scheme, a departure from traditional single-bit feedback HARQ, introducing adaptive rich feedback where the receiver requests the coded retransmission of specific symbols. Simulation results show that RAF achieves a better trade-off between energy efficiency, reliability, and latency, compared to existing HARQ solutions. Our RAF scheme can easily adapt to different modulation schemes and can also generalize to different channel statistics. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.02726v2-abstract-full').style.display = 'none'; document.getElementById('2306.02726v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 February, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 June, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted for ICMLCN'25</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2305.11633">arXiv:2305.11633</a> <span> [<a href="https://arxiv.org/pdf/2305.11633">pdf</a>, <a href="https://arxiv.org/format/2305.11633">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Goal-Oriented Communications in Federated Learning via Feedback on Risk-Averse Participation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Pandey%2C+S+R">Shashi Raj Pandey</a>, <a href="/search/cs?searchtype=author&query=Bui%2C+V+P">Van Phuc Bui</a>, <a href="/search/cs?searchtype=author&query=Popovski%2C+P">Petar Popovski</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2305.11633v1-abstract-short" style="display: inline;"> We treat the problem of client selection in a Federated Learning (FL) setup, where the learning objective and the local incentives of the participants are used to formulate a goal-oriented communication problem. Specifically, we incorporate the risk-averse nature of participants and obtain a communication-efficient on-device performance, while relying on feedback from the Parameter Server (\texttt… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.11633v1-abstract-full').style.display = 'inline'; document.getElementById('2305.11633v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2305.11633v1-abstract-full" style="display: none;"> We treat the problem of client selection in a Federated Learning (FL) setup, where the learning objective and the local incentives of the participants are used to formulate a goal-oriented communication problem. Specifically, we incorporate the risk-averse nature of participants and obtain a communication-efficient on-device performance, while relying on feedback from the Parameter Server (\texttt{PS}). A client has to decide its transmission plan on when not to participate in FL. This is based on its intrinsic incentive, which is the value of the trained global model upon participation by this client. Poor updates not only plunge the performance of the global model with added communication cost but also propagate the loss in performance on other participating devices. We cast the relevance of local updates as \emph{semantic information} for developing local transmission strategies, i.e., making a decision on when to ``not transmit". The devices use feedback about the state of the PS and evaluate their contributions in training the learning model in each aggregation period, which eventually lowers the number of occupied connections. Simulation results validate the efficacy of our proposed approach, with up to $1.4\times$ gain in communication links utilization as compared with the baselines. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.11633v1-abstract-full').style.display = 'none'; document.getElementById('2305.11633v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 May, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> PIMRC 2023, WS NAISC </p> </li> </ol> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=100" class="pagination-link " aria-label="Page 3" aria-current="page">3 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=150" class="pagination-link " aria-label="Page 4" aria-current="page">4 </a> </li> <li> <a href="/search/?searchtype=author&query=Popovski%2C+P&start=200" class="pagination-link " aria-label="Page 5" aria-current="page">5 </a> </li> <li><span class="pagination-ellipsis">…</span></li> </ul> </nav> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository