Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.00355v1

Help | Advanced Search

Computer Science > Networking and Internet Architecture

arXiv:2506.00355v1 (cs)
[Submitted on 31 May 2025 (this version) , latest version 15 Jul 2025 (v2) ]

Title: Sum Rate Maximization for Wireless Powered Pinching-Antenna Systems (PASS)

Title: 无线供电夹角天线系统(PASS)的和速率最大化

Authors:Yixuan Li, Ji Wang, Ming Zeng, Yuanwei Liu
Abstract: In this letter, we investigate a novel wireless powered communication network (WPCN) enabled by a pinching-antenna system (PASS), in which multiple pinching antennas (PAs) are activated on a waveguide to establish strong line-of-sight (LoS) links with multiple devices. In this system, time division multiple access (TDMA) and non-orthogonal multiple access (NOMA) protocols are adopted to fully explore the potential of the wireless information transmission. To maximize the sum rate of the PASS-WPCN, we formulate the problems under both protocols by jointly optimizing the time slot allocation, transmit powers of the devices, and activation positions of the PAs. Firstly, the intractable non-convex original problems are both decoupled into two tractable subproblems, termed resource allocation and PAs position optimization. Specifically, a closed-form solution to the resource allocation subproblem is derived, and it is proven that the TDMA and NOMA protocols achieve identical maximum sum rate. Then, an element-wise algorithm is developed to obtain high-precision PAs activation positions. Numerical results reveal that 1) the performance of PASS-WPCNs significantly outperforms conventional WPCNs, and 2) in PASS-WPCNs, TDMA and NOMA protocols exhibit identical achievable sum rate performance.
Abstract: 本文研究了一种由夹波天线系统(PASS)支持的新型无线供能通信网络(WPCN),在此系统中,多个夹波天线(PA)被激活以在波导上建立与多个设备的强视距(LoS)链路。 在这个系统中,采用时分多址(TDMA)和非正交多址(NOMA)协议以充分挖掘无线信息传输的潜力。为了使PASS-WPCN的总速率最大化,我们通过联合优化时隙分配、设备发射功率以及PA的激活位置来构建这两个协议下的问题。 首先,这两个难以处理的非凸原始问题都被分解为两个易于处理的子问题,称为资源分配和PA位置优化。 具体而言,推导出了资源分配子问题的闭式解,并证明了TDMA和NOMA协议实现了相同的最大总速率。 然后,开发了一种元素级算法以获得高精度的PA激活位置。 数值结果表明:1)PASS-WPCN的性能显著优于传统WPCN;2)在PASS-WPCN中,TDMA和NOMA协议表现出相同的可实现总速率性能。
Subjects: Networking and Internet Architecture (cs.NI)
Cite as: arXiv:2506.00355 [cs.NI]
  (or arXiv:2506.00355v1 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2506.00355
arXiv-issued DOI via DataCite

Submission history

From: Yixuan Li [view email]
[v1] Sat, 31 May 2025 02:37:31 UTC (1,216 KB)
[v2] Tue, 15 Jul 2025 09:03:15 UTC (1,750 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • Other Formats
view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号