Bandwidth-Constrained Sensor Scheduling: A Trade-off between Fairness and Efficiency
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918144305528832 |
|---|---|
| author | Zhong, Yuxing Wu, Yuchi Quevedo, Daniel E. Shi, Ling |
| author_facet | Zhong, Yuxing Wu, Yuchi Quevedo, Daniel E. Shi, Ling |
| contents | We address fair sensor scheduling over bandwidth-constrained communication channels. While existing literature on fair scheduling overlooks overall system efficiency, we introduce a novel $q$-fairness framework to balance efficiency and fairness by adjusting the parameter $q$. Specifically, for two communication scenarios, we: (i) derive the optimal schedule under limited communication rates, and (ii) propose two suboptimal algorithms under limited simultaneous sensor transmissions and analyze their performance gaps relative to the optimal strategy. Simulations demonstrate that our algorithms effectively balance efficiency and fairness in both cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_15820 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bandwidth-Constrained Sensor Scheduling: A Trade-off between Fairness and Efficiency Zhong, Yuxing Wu, Yuchi Quevedo, Daniel E. Shi, Ling Systems and Control We address fair sensor scheduling over bandwidth-constrained communication channels. While existing literature on fair scheduling overlooks overall system efficiency, we introduce a novel $q$-fairness framework to balance efficiency and fairness by adjusting the parameter $q$. Specifically, for two communication scenarios, we: (i) derive the optimal schedule under limited communication rates, and (ii) propose two suboptimal algorithms under limited simultaneous sensor transmissions and analyze their performance gaps relative to the optimal strategy. Simulations demonstrate that our algorithms effectively balance efficiency and fairness in both cases. |
| title | Bandwidth-Constrained Sensor Scheduling: A Trade-off between Fairness and Efficiency |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2509.15820 |