The University of Southampton
University of Southampton Institutional Repository

Age of information in energy harvesting aided massive multiple access networks

Age of information in energy harvesting aided massive multiple access networks
Age of information in energy harvesting aided massive multiple access networks
Given the proliferation of the massive machine type
communication devices (MTCDs) in beyond 5G (B5G) wireless
networks, energy harvesting (EH) aided next generation multiple
access (NGMA) systems have drawn substantial attention in
the context of energy-efficient data sensing and transmission.
However, without adaptive time slot (TS) and power allocation
schemes, NGMA systems relying on stochastic sampling instants
might lead to tardy actions associated both with high age of
information (AoI) as well as high power consumption. For
mitigating the energy consumption, we exploit a pair of sleep scheduling policies, namely the multiple vacation (MV) policy
and start-up threshold (ST) policy, which are characterized in the
context of three typical multiple access protocols, including time division multiple access (TDMA), frequency-division multiple
access (FDMA) and non-orthogonal multiple access (NOMA).
Furthermore, we derive closed-form expressions for the MTCD
system’s peak AoI, which are formulated as the optimization
objective under the constraints of EH power, status update rate
and stability conditions. An exact linear search based algorithm
is proposed for finding the optimal solution by fixing the status
update rate. As a design alternative, a low complexity concave convex procedure (CCP) is also formulated for finding a near optimal solution relying on the original problem’s transformation
into a form represented by the difference of two convex problems.
Our simulation results show that the proposed algorithms are
beneficial in terms of yielding a lower peak AoI at a low power
consumption in the context of the multiple access protocols
considered.
1558-0008
Fang, Zhengru
c1ddc4f8-17ff-450e-9659-0ded03435165
Wang, Jingjing
45786e24-b847-4830-a2f3-18ba61a9fb29
Ren, Yong
ad146a10-75d8-401c-911b-fd4dcc44eb12
Han, Zhu
28e29deb-d470-4165-b198-0923aeac3689
Poor, H. Vincent
ace801ca-0c45-451f-9509-217ea29e32e1
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Fang, Zhengru
c1ddc4f8-17ff-450e-9659-0ded03435165
Wang, Jingjing
45786e24-b847-4830-a2f3-18ba61a9fb29
Ren, Yong
ad146a10-75d8-401c-911b-fd4dcc44eb12
Han, Zhu
28e29deb-d470-4165-b198-0923aeac3689
Poor, H. Vincent
ace801ca-0c45-451f-9509-217ea29e32e1
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Fang, Zhengru, Wang, Jingjing, Ren, Yong, Han, Zhu, Poor, H. Vincent and Hanzo, Lajos (2021) Age of information in energy harvesting aided massive multiple access networks. IEEE Journal on Selected Areas in Communications. (In Press)

Record type: Article

Abstract

Given the proliferation of the massive machine type
communication devices (MTCDs) in beyond 5G (B5G) wireless
networks, energy harvesting (EH) aided next generation multiple
access (NGMA) systems have drawn substantial attention in
the context of energy-efficient data sensing and transmission.
However, without adaptive time slot (TS) and power allocation
schemes, NGMA systems relying on stochastic sampling instants
might lead to tardy actions associated both with high age of
information (AoI) as well as high power consumption. For
mitigating the energy consumption, we exploit a pair of sleep scheduling policies, namely the multiple vacation (MV) policy
and start-up threshold (ST) policy, which are characterized in the
context of three typical multiple access protocols, including time division multiple access (TDMA), frequency-division multiple
access (FDMA) and non-orthogonal multiple access (NOMA).
Furthermore, we derive closed-form expressions for the MTCD
system’s peak AoI, which are formulated as the optimization
objective under the constraints of EH power, status update rate
and stability conditions. An exact linear search based algorithm
is proposed for finding the optimal solution by fixing the status
update rate. As a design alternative, a low complexity concave convex procedure (CCP) is also formulated for finding a near optimal solution relying on the original problem’s transformation
into a form represented by the difference of two convex problems.
Our simulation results show that the proposed algorithms are
beneficial in terms of yielding a lower peak AoI at a low power
consumption in the context of the multiple access protocols
considered.

Text
2112.12326 - Accepted Manuscript
Download (2MB)
Text
AoI_EH_mMTC - Version of Record
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 17 December 2021
Additional Information: arXiv:2112.12326

Identifiers

Local EPrints ID: 453269
URI: http://eprints.soton.ac.uk/id/eprint/453269
ISSN: 1558-0008
PURE UUID: 4de4a2c4-6942-45ae-8c84-5fa9a7b74158
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 11 Jan 2022 17:51
Last modified: 20 Dec 2024 05:01

Export record

Contributors

Author: Zhengru Fang
Author: Jingjing Wang
Author: Yong Ren
Author: Zhu Han
Author: H. Vincent Poor
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×