Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 47 tok/s
Gemini 2.5 Pro 37 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 11 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 195 tok/s Pro
GPT OSS 120B 465 tok/s Pro
Claude Sonnet 4 30 tok/s Pro
2000 character limit reached

Semantic-Aware Resource Allocation in Constrained Networks with Limited User Participation (2401.10766v1)

Published 19 Jan 2024 in cs.IT and math.IT

Abstract: Semantic communication has gained attention as a key enabler for intelligent and context-aware communication. However, one of the key challenges of semantic communications is the need to tailor the resource allocation to meet the specific requirements of semantic transmission. In this paper, we focus on networks with limited resources where devices are constrained to transmit with limited bandwidth and power over large distance. Specifically, we devise an efficient strategy to select the most pertinent semantic features and participating users, taking into account the channel quality, the transmission time, and the recovery accuracy. To this end, we formulate an optimization problem with the goal of selecting the most relevant and accurate semantic features over devices while satisfying constraints on transmission time and quality of the channel. This involves optimizing communication resources, identifying participating users, and choosing specific semantic information for transmission. The underlying problem is inherently complex due to its non-convex nature and combinatorial constraints. To overcome this challenge, we efficiently approximate the optimal solution by solving a series of integer linear programming problems. Our numerical findings illustrate the effectiveness and efficiency of our approach in managing semantic communications in networks with limited resources.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. “Client selection in federated learning based on gradients importance,” arXiv preprint arXiv:2111.11204, 2021.
  2. H. Xie and Z. Qin, “A lite distributed semantic communication system for internet of things,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 1, pp. 142–153, 2021.
  3. “Resource allocation for text semantic communications,” IEEE Wireless Communications Letters, vol. 11, no. 7, pp. 1394–1398, 2022.
  4. “Performance optimization for semantic communications: An attention-based reinforcement learning approach,” IEEE Journal on Selected Areas in Communications, vol. 40, no. 9, pp. 2598–2613, 2022.
  5. Z. Weng and Z. Qin, “Semantic communication systems for speech transmission,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 8, pp. 2434–2444, 2021.
  6. “Optimization of image transmission in semantic communication networks,” Globecom, 2022.
  7. “Reliable semantic communication system enabled by knowledge graph,” Entropy, vol. 24, no. 6, 2022.
  8. “A theory for semantic communications,” arXiv:2303.05181, 2023.
  9. “Wireless semantic communication: A networking perspective,” arXiv preprint arXiv:2212.14142,, 2022.
  10. “Bert: Pre-training of deep bidirectional transformers for language understanding,” Proceedings of naacL-HLT, 2019.
  11. “Solving linear programs in the current matrix multiplication time,” Journal of the ACM (JACM), vol. 68, no. 1, pp. 1–39, 2021.
  12. H C. Pere-Lluís and R. Navigli, “REBEL: Relation extraction by end-to-end language generation,” in Findings of the Association for Computational Linguistics: EMNLP, 2021, pp. 2370–2381.
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.