{
  "abstract": "Meeting hard task-completion deadlines for many simultaneously offloading users is the binding challenge in mobile-edge computing (MEC). As the user count grows, the transmit power required to satisfy every deadline within per-user budgets rises until no feasible allocation exists. We take a \\emph{feasibility-first} view of this $K$-user problem in an uplink non-orthogonal multiple access (NOMA) MEC system served by a pinching-antenna system (PASS), whose radiating points establish strong line-of-sight (LoS) links that lower the received-power requirement. We formulate a latency-constrained joint optimization of transmit powers, CPU frequencies, and antenna configuration. We then derive a \\emph{closed-form least-power feasibility test}: the componentwise-least allocation meeting every deadline. It certifies feasibility with the largest attainable margin to the power budgets and defines a practical \\emph{quality-of-service (QoS)-feasibility outage} metric, the probability that no allocation meets all deadlines within budget. We solve the problem with a three-block alternating-optimization algorithm that is provably monotone-convergent and has polynomial complexity. Numerical results show that the proposed scheme sustains deadline feasibility at user loads where equal-power, orthogonal multiple access (OMA), and single-antenna baselines fail or degrade sharply, each by a mechanism predicted directly from the system model, whereas the proposed design degrades gracefully. Stress tests further show that feasibility is sustained under order-of-magnitude budget reductions, and that the pinching-antenna array itself enables constrained-budget operation. The result is a scalable, closed-form-initialized design for deadline-feasible offloading.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.17949",
  "author_total": 4,
  "authors": [
    {
      "name": "Sepehr Abolhasani"
    },
    {
      "name": "Saba Asaad"
    },
    {
      "name": "S. Mohammad Razavizadeh"
    },
    {
      "name": "Jiguang He"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/crd84tdbp3pvy.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.17949",
  "fulltext_url": null,
  "id": "crd84tdbp3pvy",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.17949",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1705|IoT and Edge/Fog Computing"
    ]
  ],
  "openalex": "W7221808416",
  "pdf_url": "https://arxiv.org/pdf/2610.17949",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-13",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/crd84tdbp3pvy.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:29:19Z",
      "native_id": "2610.17949",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.17949"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Latency-Aware Uplink NOMA-MEC with PASS: A Feasibility-First Resource Allocation Framework",
  "title_text": "Latency-Aware Uplink NOMA-MEC with PASS: A Feasibility-First Resource Allocation Framework",
  "type": "preprint",
  "updated_at": "2026-10-30T12:29:19Z",
  "url": "https://research.draconitic.com/paper/crd84tdbp3pvy",
  "venue": "arXiv",
  "versions": []
}