Literature Database Entry

zou2025stable

Yifei Zou, Peng Wang, Shikun Shen, Dongxiao Yu, Jorge Torres Gómez, Falko Dressler and Xiuzhen Cheng, "Stable Age of Information Scheduling with NOMA in Edge Networks," IEEE Transactions on Networking, 2025. (to appear)

Abstract

Many emerging applications in edge networks have a huge demand for the freshest information from end devices and sensors. In this paper, we study a stable Age-of-Information (AoI) scheduling problem to handle the massive packet aggregation from arbitrary total of n end devices (sensor nodes) to an edge device via a single hop wireless channel when information constantly arrives at the end side. Specifically, we consider the arrivals of the information with an online injection mode, i.e., information is injected to end devices with an unknown injection rate in each time slot. After the information is injected, the AoI with respect to those end devices constantly increases until their fresh messages are received by the edge device, which characterizes the freshness of the information at destination. Based on the online injection mode, we propose the first distributed stable AoI scheduling algorithm combining NOMA (Non-Orthogonal Multiple-Access) technique in this paper, to minimize the expected average peak AoI (EAP-AoI) of our end-to-edge information system. Adopting NOMA technique updates k messages decoded from a mixed signal by the edge device in our algorithm, with parameter k > 1. We prove that our algorithm is stable even under the asymptotically maximum injection rate of O(k/n) that any stable AoI scheduling algorithm may handle, and the EAP-AoI of our information system is bounded by O( 3 √nk) time slots under the injection rate of O(k/n). Comparing with two existing results, the EAP-AoI in our algorithm is O(n2/3 k4/3 ) and O(n2/3 k1/3 ) times smaller. Numerical results from simulations also indicate the stability and efficiency of our algorithm.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Yifei Zou
Peng Wang
Shikun Shen
Dongxiao Yu
Jorge Torres Gómez
Falko Dressler
Xiuzhen Cheng

BibTeX reference

@article{zou2025stable,
    author = {Zou, Yifei and Wang, Peng and Shen, Shikun and Yu, Dongxiao and Torres G{\'{o}}mez, Jorge and Dressler, Falko and Cheng, Xiuzhen},
    note = {to appear},
    title = {{Stable Age of Information Scheduling with NOMA in Edge Networks}},
    journal = {IEEE Transactions on Networking},
    issn = {2998-4157},
    publisher = {IEEE},
    year = {2025},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2025-04-17