Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912353801469952 |
|---|---|
| author | Gholami, Nasrin Moghim, Neda Ghahfarokhi, Behrouz Shahgholi Salavati, Pouyan Thomas, Christo Kurisummoottil Shetty, Sachin Rahmati, Tahereh |
| author_facet | Gholami, Nasrin Moghim, Neda Ghahfarokhi, Behrouz Shahgholi Salavati, Pouyan Thomas, Christo Kurisummoottil Shetty, Sachin Rahmati, Tahereh |
| contents | Semantic communication (SemCom) aims to enhance the resource efficiency of next-generation networks by transmitting the underlying meaning of messages, focusing on information relevant to the end user. Existing literature on SemCom primarily emphasizes learning the encoder and decoder through end-to-end deep learning frameworks, with the objective of minimizing a task-specific semantic loss function. Beyond its influence on the physical and application layer design, semantic variability across users in multi-user systems enables the design of resource allocation schemes that incorporate user-specific semantic requirements. To this end, \emph{a semantic-aware resource allocation} scheme is proposed with the objective of maximizing transmission and semantic reliability, ultimately increasing the number of users whose semantic requirements are met. The resulting resource allocation problem is a non-convex mixed-integer nonlinear program (MINLP), which is known to be NP-hard. To make the problem tractable, it is decomposed into a set of sub-problems, each of which is efficiently solved via geometric programming techniques. Finally, simulations demonstrate that the proposed method improves user satisfaction by up to $17.1\%$ compared to state of the art methods based on quality of experience-aware SemCom methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_20939 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints Gholami, Nasrin Moghim, Neda Ghahfarokhi, Behrouz Shahgholi Salavati, Pouyan Thomas, Christo Kurisummoottil Shetty, Sachin Rahmati, Tahereh Networking and Internet Architecture Signal Processing Semantic communication (SemCom) aims to enhance the resource efficiency of next-generation networks by transmitting the underlying meaning of messages, focusing on information relevant to the end user. Existing literature on SemCom primarily emphasizes learning the encoder and decoder through end-to-end deep learning frameworks, with the objective of minimizing a task-specific semantic loss function. Beyond its influence on the physical and application layer design, semantic variability across users in multi-user systems enables the design of resource allocation schemes that incorporate user-specific semantic requirements. To this end, \emph{a semantic-aware resource allocation} scheme is proposed with the objective of maximizing transmission and semantic reliability, ultimately increasing the number of users whose semantic requirements are met. The resulting resource allocation problem is a non-convex mixed-integer nonlinear program (MINLP), which is known to be NP-hard. To make the problem tractable, it is decomposed into a set of sub-problems, each of which is efficiently solved via geometric programming techniques. Finally, simulations demonstrate that the proposed method improves user satisfaction by up to $17.1\%$ compared to state of the art methods based on quality of experience-aware SemCom methods. |
| title | Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints |
| topic | Networking and Internet Architecture Signal Processing |
| url | https://arxiv.org/abs/2504.20939 |