Age-Aware Utility Maximization in Relay-Assisted Wireless Powered Communication Networks.

Entropy (Basel)

Department of Electrical and Computer Engineering, University of Maryland at College Park, College Park, MD 20742, USA.

Published: September 2021

This article investigates a relay-assisted wireless powered communication network (WPCN), where the access point (AP) inspires the auxiliary nodes to participate together in charging the sensor, and then the sensor uses its harvested energy to send status update packets to the AP. An incentive mechanism is designed to overcome the selfishness of the auxiliary node. In order to further improve the system performance, we establish a Stackelberg game to model the efficient cooperation between the AP-sensor pair and auxiliary node. Specifically, we formulate two utility functions for the AP-sensor pair and the auxiliary node, and then formulate two maximization problems respectively. As the former problem is non-convex, we transform it into a convex problem by introducing an extra slack variable, and then by using the Lagrangian method, we obtain the optimal solution with closed-form expressions. Numerical experiments show that the larger the transmit power of the AP, the smaller the age of information (AoI) of the AP-sensor pair and the less the influence of the location of the auxiliary node on AoI. In addition, when the distance between the AP and the sensor node exceeds a certain threshold, employing the relay can achieve better AoI performance than non-relaying systems.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC8472745PMC
http://dx.doi.org/10.3390/e23091177DOI Listing

Publication Analysis

Top Keywords

auxiliary node
16
ap-sensor pair
12
relay-assisted wireless
8
wireless powered
8
powered communication
8
pair auxiliary
8
node formulate
8
auxiliary
5
node
5
age-aware utility
4

Similar Publications

Single-incision plus one-port laparoscopic proximal gastrectomy with double-channel anastomosis (SILT-DT) is a minimally invasive surgical approach for treating proximal gastric cancer. This technique includes comprehensive laparoscopic resection of the proximal stomach, lymph node dissection, and double-tract anastomosis. By integrating single-port laparoscopic surgery with an auxiliary operating hole, SILT-DT reduces procedural difficulty while facilitating the placement of an abdominal drainage tube.

View Article and Find Full Text PDF

Background: Previous studies have demonstrated that PNI can predict the prognosis of gastric cancer (GC) patients. However, few studies have focused on the auxiliary role of miRNA in predicting the prognosis of GC.

Objective: This research seeks to clarify the role of the combined use of miR-132-3p and PNI in predicting the prognosis of GC patients.

View Article and Find Full Text PDF

Objective: This study aimed to investigate the diagnostic value of 7-tumor associated autoantibodies (7-TAAB) and to evaluate the relationship between 7-TAAB and clinical features in esophageal squamous cell carcinoma (ESCC), which can be used to guide clinical diagnosis and treatment and achieve its clinical value.

Methods: (1) Blood specimens were collected from patients with ESCC who had not previously received antitumor therapy (ESCC group) and those who had normal medical check-ups in the hospital during the same period (control group). The concentrations of 7-TAAB (P53, PGP9.

View Article and Find Full Text PDF

Background: The Resection and Partial Liver Transplantation with Delayed Total Hepatectomy (RAPID) procedure for unresectable colorectal liver metastases (uCRLM) has renewed interest by increasing, in selected cases, patients' long-term survival. Initially described using deceased donor graft, this technique evolved to living donors, tackling organ-shortage issues, allowing better scheduling, and reducing liver failure risk.

Methods: A 50-year-old patient presented 18 months earlier with a colic adenocarcinoma with synchronous uCRLM.

View Article and Find Full Text PDF

Structure changes or transitions are common in growing networks (complex networks, graphs, etc.) and must be precisely determined. The introduced quantitative measure of the structural complexity of the network based on a procedure similar to the renormalization process allows one to reveal such changes.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!