SwePub - sökning: WFRF:(Leinonen Markus)

Numrering	Referens	Omslagsbild	Hitta
1.	Bridel, Claire, et al. (författare) Diagnostic Value of Cerebrospinal Fluid Neurofilament Light Protein in Neurology : A Systematic Review and Meta-analysis 2019 Ingår i: JAMA Neurology. - : American Medical Association (AMA). - 2168-6149 .- 2168-6157. ; 76:9, s. 1035-1048 Forskningsöversikt (refereegranskat)abstract Importance Neurofilament light protein (NfL) is elevated in cerebrospinal fluid (CSF) of a number of neurological conditions compared with healthy controls (HC) and is a candidate biomarker for neuroaxonal damage. The influence of age and sex is largely unknown, and levels across neurological disorders have not been compared systematically to date.Objectives To assess the associations of age, sex, and diagnosis with NfL in CSF (cNfL) and to evaluate its potential in discriminating clinically similar conditions.Data Sources PubMed was searched for studies published between January 1, 2006, and January 1, 2016, reporting cNfL levels (using the search terms neurofilament light and cerebrospinal fluid) in neurological or psychiatric conditions and/or in HC.Study Selection Studies reporting NfL levels measured in lumbar CSF using a commercially available immunoassay, as well as age and sex.Data Extraction and Synthesis Individual-level data were requested from study authors. Generalized linear mixed-effects models were used to estimate the fixed effects of age, sex, and diagnosis on log-transformed NfL levels, with cohort of origin modeled as a random intercept.Main Outcome and Measure The cNfL levels adjusted for age and sex across diagnoses.Results Data were collected for 10 059 individuals (mean [SD] age, 59.7 [18.8] years; 54.1% female). Thirty-five diagnoses were identified, including inflammatory diseases of the central nervous system (n = 2795), dementias and predementia stages (n = 4284), parkinsonian disorders (n = 984), and HC (n = 1332). The cNfL was elevated compared with HC in a majority of neurological conditions studied. Highest levels were observed in cognitively impaired HIV-positive individuals (iHIV), amyotrophic lateral sclerosis, frontotemporal dementia (FTD), and Huntington disease. In 33.3% of diagnoses, including HC, multiple sclerosis, Alzheimer disease (AD), and Parkinson disease (PD), cNfL was higher in men than women. The cNfL increased with age in HC and a majority of neurological conditions, although the association was strongest in HC. The cNfL overlapped in most clinically similar diagnoses except for FTD and iHIV, which segregated from other dementias, and PD, which segregated from atypical parkinsonian syndromes.Conclusions and Relevance These data support the use of cNfL as a biomarker of neuroaxonal damage and indicate that age-specific and sex-specific (and in some cases disease-specific) reference values may be needed. The cNfL has potential to assist the differentiation of FTD from AD and PD from atypical parkinsonian syndromes.
2.	Hatami, Mohammad, et al. (författare) Age-Aware Status Update Control for Energy Harvesting IoT Sensors via Reinforcement Learning 2020 Ingår i: 2020 IEEE 31ST ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (IEEE PIMRC). - : IEEE. - 9781728144900 Konferensbidrag (refereegranskat)abstract We consider an IoT sensing network with multiple users, multiple energy harvesting sensors, and a wireless edge node acting as a gateway between the users and sensors. The users request for updates about the value of physical processes, each of which is measured by one sensor. The edge node has a cache storage that stores the most recently received measurements from each sensor. Upon receiving a request, the edge node can either command the corresponding sensor to send a status update, or use the data in the cache. We aim to find the best action of the edge node to minimize the average long-term cost which trade-offs between the age of information and energy consumption. We propose a practical reinforcement learning approach that finds an optimal policy without knowing the exact battery levels of the sensors. Simulation results show that the proposed method significantly reduces the average cost compared to several baseline methods.
3.	Hatami, Mohammad, et al. (författare) AoI Minimization in Status Update Control With Energy Harvesting Sensors 2021 Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 69:12, s. 8335-8351 Tidskriftsartikel (refereegranskat)abstract Information freshness is crucial for time-critical IoT applications, e.g., monitoring and control. We consider an IoT status update system with users, energy harvesting sensors, and a cache-enabled edge node. The users receive time-sensitive information about physical quantities, each measured by a sensor. Users demand for the information from the edge node whose cache stores the most recently received measurements from each sensor. To serve a request, the edge node either commands the sensor to send an update or retrieves the aged measurement from the cache. We aim at finding the best actions of the edge node to minimize the average AoI of the served measurements at the users, termed on-demand AoI. We model this problem as a Markov decision process and develop reinforcement learning (RL) algorithms: model-based value iteration and model-free Q-learning. We also propose a Q-learning method for the realistic case where the edge node is informed about the sensors battery levels only via the status updates. The case under transmission limitations is also addressed. Furthermore, properties of an optimal policy are characterized. Simulation results show that an optimal policy is a threshold-based policy and that the proposed RL methods significantly reduce the average cost compared to several baselines.
4.	Hatami, Mohammad, et al. (författare) On-Demand AoI Minimization in Resource-Constrained Cache-Enabled IoT Networks With Energy Harvesting Sensors 2022 Ingår i: IEEE Transactions on Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0090-6778 .- 1558-0857. ; 70:11, s. 7446-7463 Tidskriftsartikel (refereegranskat)abstract We consider a resource-constrained IoT network, where multiple users make on-demand requests to a cache-enabled edge node to send status updates about various random processes, each monitored by an energy harvesting sensor. The edge node serves users requests by deciding whether to command the corresponding sensor to send a fresh status update or retrieve the most recently received measurement from the cache. Our objective is to find the best actions of the edge node to minimize the average age of information (AoI) of the received measurements upon request, i.e., average on-demand AoI, subject to per-slot transmission and energy constraints. First, we derive a Markov decision process model and propose an iterative algorithm that obtains an optimal policy. Then, we develop an asymptotically optimal low-complexity algorithm - termed relax-then-truncate - and prove that it is optimal as the number of sensors goes to infinity. Simulation results illustrate that the proposed relax-then-truncate approach significantly reduces the average on-demand AoI compared to a request-aware greedy policy and a weighted AoI policy, and also depict that it performs close to the optimal solution even for moderate numbers of sensors.
5.	Hatami, Mohammad, et al. (författare) Online Caching Policy with User Preferences and Time-Dependent Requests: A Reinforcement Learning Approach 2019 Ingår i: CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS. - : IEEE. - 9781728143002 ; , s. 1384-1388 Konferensbidrag (refereegranskat)abstract Content caching is a promising approach to reduce data traffic in the back-haul links. We consider a system where multiple users request items from a cache-enabled base station that is connected to a cloud. The users request items according to the user preferences in a time-dependent fashion, i.e., a user is likely to request the next chunk (item) of the file requested at a previous time slot. Whenever the requested item is not in the cache, the base station downloads it from the cloud and forwards it to the user. In the meanwhile, the base station decides whether to replace one item in the cache by the fetched item, or to discard it. We model the problem as a Markov decision process (MDP) and propose a novel state space that takes advantage of the dynamics of the users requests. We use reinforcement learning and propose a Q-learning algorithm to find an optimal cache replacement policy that maximizes the cache hit ratio without knowing the popularity profile distribution, probability distribution of items, and user preference model. Simulation results show that the proposed algorithm improves the cache hit ratio compared to other baseline policies.
6.	Hatami, Mohammad, et al. (författare) Status Updating with an Energy Harvesting Sensor under Partial Battery Knowledge 2022 Ingår i: 2022 IEEE 23RD INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATION (SPAWC). - : IEEE. - 9781665494557 - 9781665494564 Konferensbidrag (refereegranskat)abstract We consider status updating under inexact knowledge of the battery level of an energy harvesting (EH) sensor that sends status updates about a random process to users via a cache-enabled edge node. More precisely, the control decisions are performed by relying only on the battery level knowledge captured from the last received status update packet. Upon receiving on demand requests for fresh information from the users, the edge node uses the available information to decide whether to command the sensor to send a status update or to retrieve the most recently received measurement from the cache. We seek for the best actions of the edge node to minimize the average AoI of the served measurements, i.e., average on-demand AoI. Accounting for the partial battery knowledge, we model the problem as a partially observable Markov decision process (POMDP), and, through characterizing its key structures, develop a dynamic programming algorithm to obtain an optimal policy. Simulation results illustrate the threshold-based structure of an optimal policy and show the gains obtained by the proposed optimal POMDP-based policy compared to a request-aware greedy (myopic) policy.
7.	He, Jiguang, et al. (författare) Channel Estimation for RIS-Aided mmWave MIMO Systems 2020 Ingår i: 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings. ; 2020-January Konferensbidrag (refereegranskat)abstract A reconfigurable intelligent surface (RIS) can shape the radio propagation by passively changing the directions of impinging electromagnetic waves. The optimal control of the RIS requires perfect channel state information (CSI) of all the links connecting the base station (BS) and the mobile station (MS) via the RIS. Thereby the channel (parameter) estimation at the BS/MS and the related message feedback mechanism are needed. In this paper, we adopt a two-stage channel estimation scheme for the RIS-aided millimeter wave (mmWave) MIMO channels using an iterative reweighted method to sequentially estimate the channel parameters. We evaluate the average spectrum efficiency (SE) and the RIS beamforming gain of the proposed scheme and demonstrate that it achieves high-resolution estimation with the average SE comparable to that with perfect CSI.
8.	Jansen, Iris E, et al. (författare) Genome-wide meta-analysis for Alzheimer's disease cerebrospinal fluid biomarkers. 2022 Ingår i: Acta neuropathologica. - : Springer Science and Business Media LLC. - 1432-0533 .- 0001-6322. ; 144:5, s. 821-842 Tidskriftsartikel (refereegranskat)abstract Amyloid-beta 42 (Aβ42) and phosphorylated tau (pTau) levels in cerebrospinal fluid (CSF) reflect core features of the pathogenesis of Alzheimer's disease (AD) more directly than clinical diagnosis. Initiated by the European Alzheimer & Dementia Biobank (EADB), the largest collaborative effort on genetics underlying CSF biomarkers was established, including 31 cohorts with a total of 13,116 individuals (discovery n=8074; replication n=5042 individuals). Besides the APOE locus, novel associations with two other well-established AD risk loci were observed; CR1 was shown a locus for Aβ42 and BIN1 for pTau. GMNC and C16orf95 were further identified as loci for pTau, of which the latter is novel. Clustering methods exploring the influence of all known AD risk loci on the CSF protein levels, revealed 4 biological categories suggesting multiple Aβ42 and pTau related biological pathways involved in the etiology of AD. In functional follow-up analyses, GMNC and C16orf95 both associated with lateral ventricular volume, implying an overlap in genetic etiology for tau levels and brain ventricular volume.
9.	Leinonen, Markus, et al. (författare) Compressed Sensing with Applications in Wireless Networks 2019 Ingår i: FOUNDATIONS AND TRENDS IN SIGNAL PROCESSING. - : NOW PUBLISHERS INC. - 1932-8346 .- 1932-8354. ; 13:1-2 Tidskriftsartikel (refereegranskat)abstract Sparsity is an attribute present in a myriad of natural signals and systems, occurring either inherently or after a suitable projection. Such signals with lots of zeros possess minimal degrees of freedom and are thus attractive from an implementation perspective in wireless networks. While sparsity has appeared for decades in various mathematical fields, the emergence of compressed sensing (CS) - the joint sampling and compression paradigm - in 2006 gave rise to plethora of novel communication designs that can efficiently exploit sparsity. In this monograph, we review several CS frameworks where sparsity is exploited to improve the quality of signal reconstruction/detection while reducing the use of radio and energy resources by decreasing, e.g., the sampling rate, transmission rate, and number of computations. The first part focuses on several advanced CS signal reconstruction techniques along with wireless applications. The second part deals with efficient data gathering and lossy compression techniques in wireless sensor networks. Finally, the third part addresses CS-driven designs for spectrum sensing and multi-user detection for cognitive and wireless communications.
10.	Leinonen, Markus, et al. (författare) Low-Complexity Vector Quantized Compressed Sensing via Deep Neural Networks 2020 Ingår i: IEEE Open Journal of the Communications Society. - : Institute of Electrical and Electronics Engineers (IEEE). - 2644-125X. ; 1, s. 1278-1294 Tidskriftsartikel (refereegranskat)abstract Sparse signals, encountered in many wireless and signal acquisition applications, can be acquired via compressed sensing (CS) to reduce computations and transmissions, crucial for resource-limited devices, e.g., wireless sensors. Since the information signals are often continuous-valued, digital communication of compressive measurements requires quantization. In such a quantized compressed sensing (QCS) context, we address remote acquisition of a sparse source through vector quantized noisy compressive measurements. We propose a deep encoder-decoder architecture, consisting of an encoder deep neural network (DNN), a quantizer, and a decoder DNN, that realizes low-complexity vector quantization aiming at minimizing the mean-square error of the signal reconstruction for a given quantization rate. We devise a supervised learning method using stochastic gradient descent and backpropagation to train the system blocks. Strategies to overcome the vanishing gradient problem are proposed. Simulation results show that the proposed non-iterative DNN-based QCS method achieves higher rate-distortion performance with lower algorithm complexity as compared to standard QCS methods, conducive to delay-sensitive applications with large-scale signals.
11.	Leinonen, Markus, et al. (författare) Practical Compression Methods for Quantized Compressed Sensing 2019 Ingår i: IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (IEEE INFOCOM 2019 WKSHPS). - : IEEE. - 9781728118789 ; , s. 756-761 Konferensbidrag (refereegranskat)abstract In order to save energy of low-power sensors in Internet of Things applications, minimizing the number of bits to compress and communicate real-valued sources with a pre-defined distortion becomes crucial. In such a lossy source coding context, we study rate-distortion (RD) performance of various single-sensor quantized compressed sensing (QCS) schemes for compressing sparse signals via quantized/encoded noisy linear measurements. The paper combines and refines the recent advances of QCS algorithm designs and theoretical analysis. In particular, several practical symbol-by-symbol quantizer based QCS methods of different complexities relying on 1) compress-and-estimate, 2) estimate-and-compress, and 3) support-estimation-and-compress strategies are proposed. Simulation results demonstrate the RD performances of different schemes and compare them to the information-theoretic limits.
12.	Leinonen, Markus, et al. (författare) Quantized Compressed Sensing via Deep Neural Networks 2020 Ingår i: 2020 2ND 6G WIRELESS SUMMIT (6G SUMMIT). - : IEEE. - 9781728160474 - 9781728160481 Konferensbidrag (refereegranskat)abstract Compressed sensing (CS) is an efficient technique to acquire sparse signals in many wireless applications to, e.g., reduce the amount of data and save low-power sensors batteries. This paper addresses efficient acquisition of sparse sources through quantized noisy compressive measurements where the encoder and decoder are realized by deep neural networks (DNNs). We devise a DNN based quantized compressed sensing (QCS) method aiming at minimizing the mean-square error of the signal reconstruction. Once trained offline, the proposed method enjoys extremely fast and low complexity decoding in the online communication phase. Simulation results demonstrate the superior rate-distortion performance of the proposed method compared to a polynomial-complexity QCS reconstruction scheme.
13.	Leinonen, Markus, et al. (författare) Signal Reconstruction Performance under Quantized Noisy Compressed Sensing 2019 Ingår i: 2019 DATA COMPRESSION CONFERENCE (DCC). - : IEEE. - 9781728106571 ; , s. 586-586 Konferensbidrag (refereegranskat)abstract We study rate-distortion (RD) performance of various single-sensor compressed sensing (CS) schemes for acquiring sparse signals via quantized/encoded noisy linear measurements, motivated by low-power sensor applications. For such a quantized CS (QCS) context, the paper combines and refines our recent advances in algorithm designs and theoretical analysis. Practical symbol-by-symbol quantizer based QCS methods of different compression strategies are proposed. The compression limit of QCS - the remote RDF - is assessed through an analytical lower bound and a numerical approximation method. Simulation results compare the RD performances of different schemes.
14.	Leinonen, Ville, et al. (författare) Comparison of particle number size distribution trends in ground measurements and climate models 2022 Ingår i: Atmospheric Chemistry And Physics. - : Copernicus GmbH. - 1680-7316 .- 1680-7324. ; 22:19, s. 12873-12905 Tidskriftsartikel (refereegranskat)abstract Despite a large number of studies, out of all drivers of radiative forcing, the effect of aerosols has the largest uncertainty in global climate model radiative forcing estimates. There have been studies of aerosol optical properties in climate models, but the effects of particle number size distribution need a more thorough inspection. We investigated the trends and seasonality of particle number concentrations in nucleation, Aitken, and accumulation modes at 21 measurement sites in Europe and the Arctic. For 13 of those sites, with longer measurement time series, we compared the field observations with the results from five climate models, namely EC-Earth3, ECHAM-M7, ECHAM-SALSA, NorESM1.2, and UKESM1. This is the first extensive comparison of detailed aerosol size distribution trends between in situ observations from Europe and five earth system models (ESMs). We found that the trends of particle number concentrations were mostly consistent and decreasing in both measurements and models. However, for many sites, climate models showed weaker decreasing trends than the measurements. Seasonal variability in measured number concentrations, quantified by the ratio between maximum and minimum monthly number concentration, was typically stronger at northern measurement sites compared to other locations. Models had large differences in their seasonal representation, and they can be roughly divided into two categories: for EC-Earth and NorESM, the seasonal cycle was relatively similar for all sites, and for other models the pattern of seasonality varied between northern and southern sites. In addition, the variability in concentrations across sites varied between models, some having relatively similar concentrations for all sites, whereas others showed clear differences in concentrations between remote and urban sites. To conclude, although all of the model simulations had identical input data to describe anthropogenic mass emissions, trends in differently sized particles vary among the models due to assumptions in emission sizes and differences in how models treat size-dependent aerosol processes. The inter-model variability was largest in the accumulation mode, i.e. sizes which have implications for aerosol–cloud interactions. Our analysis also indicates that between models there is a large variation in efficiency of long-range transportation of aerosols to remote locations. The differences in model results are most likely due to the more complex effect of different processes instead of one specific feature (e.g. the representation of aerosol or emission size distributions). Hence, a more detailed characterization of microphysical processes and deposition processes affecting the long-range transport is needed to understand the model variability.
15.	Moltafet, Mohammad, et al. (författare) An Approximate Expression for the Average AoI in a Multi-Source M/G/1 Queueing Model 2020 Ingår i: 2020 2ND 6G WIRELESS SUMMIT (6G SUMMIT). - : IEEE. - 9781728160474 - 9781728160481 Konferensbidrag (refereegranskat)abstract Freshness of status update packets is essential for wide range of real-time Internet of things applications. In this paper, we study the information freshness of a single-server multi-source queueing model under a first-come first-served (FCFS) serving policy. In the considered model, each source independently generates status update packets according to a Poisson process. The information freshness of the status updates of each source is evaluated by the average age of information (AoI). We derive an approximate expression for the average AoI for a multi-source M/G/1 queueing model having a general service time distribution. Simulation results are provided to validate and assess the tightness of the proposed approximate expression for the average AoI in the M/G/1 queueing model where the service time follows a gamma distribution.
16.	Moltafet, Mohammad, et al. (författare) An Exact Expression for the Average AoI in a Multi-Source M/M/1 Queueing Model 2020 Ingår i: 2020 IEEE 31ST ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (IEEE PIMRC). - : IEEE. - 9781728144900 Konferensbidrag (refereegranskat)abstract Information freshness is crucial in a wide range of wireless applications where a destination needs the most recent measurements of a remotely observed random process. In this paper, we study the information freshness of a single-server multi-source M/M/1 queueing model under a first-come first-served (FCFS) serving policy. The information freshness of the status updates of each source is evaluated by the average age of information (AoI). We derive an exact expression for the average AoI for the multi-source M/M/1 queueing model. Simulation results are provided to validate the derived exact expression for the average AoI.
17.	Moltafet, Mohammad, et al. (författare) Average Age of Information for a Multi-Source M/M/1 Queueing Model with Packet Management and Self-Preemption in Service 2020 Ingår i: 2020 18TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT). - : IEEE. - 9783903176294 ; , s. 1765-1769 Konferensbidrag (refereegranskat)abstract We consider an M/M/1 status update system consisting of two independent sources and one server. We derive the average age of information (AoI) of each source using the stochastic hybrid systems (SHS) technique under the following packet management with self-preemptive serving policy. The system can contain at most two packets with different source indexes at the same time, i.e., one packet under service and one packet in the queue. When the system is empty, any arriving packet immediately enters the server. When the server is busy at an arrival of a packet, the possible packet of the same source in the system (either waiting in the queue or being served) is replaced by the fresh packet. Numerical results illustrate the effectiveness of the proposed packet management with self-preemptive serving policy compared to several baseline policies.
18.	Moltafet, Mohammad, et al. (författare) Average Age of Information in a Multi-Source M/M/1 Queueing Model with LCFS Prioritized Packet Management 2020 Ingår i: IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS). - : IEEE. - 9781728186955 ; , s. 303-308 Konferensbidrag (refereegranskat)abstract In this paper, we consider an M/M/1 status update system consisting of two independent sources, one server, and one sink. We consider the following last-come first-served (LCFS) prioritized packet management policy. When the system is empty, any arriving packet immediately enters the server; when the server is busy, a packet of a source waiting in the queue is replaced if a new packet of the same source arrives and the fresh packet goes at the head of the queue. We derive the average age of information (AoI) of the considered M/M/1 queueing model by using the stochastic hybrid systems (SHS) technique. Numerical results illustrate the effectiveness of the proposed packet management policy compared to several baseline policies.
19.	Moltafet, Mohammad, et al. (författare) Average AoI in Multi-Source Systems With Source-Aware Packet Management 2021 Ingår i: IEEE Transactions on Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0090-6778 .- 1558-0857. ; 69:2, s. 1121-1133 Tidskriftsartikel (refereegranskat)abstract We study the information freshness under three different source aware packet management policies in a status update system consisting of two independent sources and one server. The packets of each source are generated according to the Poisson process and the packets are served according to an exponentially distributed service time. We derive the average age of information (AoI) of each source using the stochastic hybrid systems (SHS) technique for each packet management policy. In Policy 1, the queue can contain at most two waiting packets at the same time (in addition to the packet under service), one packet of source 1 and one packet of source 2. When the server is busy at an arrival of a packet, the possible packet of the same source waiting in the queue (hence, source-aware) is replaced by the arrived fresh packet. In Policy 2, the system (i.e., the waiting queue and the server) can contain at most two packets, one from each source. When the server is busy at an arrival of a packet, the possible packet of the same source in the system is replaced by the fresh packet. Policy 3 is similar to Policy 2 but it does not permit preemption in service, i.e., while a packet is under service all new arrivals from the same source are blocked and cleared. Numerical results are provided to assess the fairness between sources and the sum average AoI of the proposed policies.
20.	Moltafet, Mohammad, et al. (författare) Closed-Form Expression for the Average Age of Information in a Multi-Source M/G/1 Queueing Model 2019 Ingår i: 2019 IEEE INFORMATION THEORY WORKSHOP (ITW). - : IEEE. - 9781538669006 - 9781538669013 ; , s. 599-603 Konferensbidrag (refereegranskat)abstract In the context of the next generation wireless networks, freshness of status update packets is essential for enabling the services where a destination needs the most recent measurements of various sensors. In this paper, we study the information freshness of a multi-source M/G/1 first-come first-served (FCFS) queueing model, where each source independently generates status update packets according to a Poisson process. The information freshness of the status updates of each source is evaluated using the average age of information (AoI). To this end, we derive a closed-form expression for the average AoI of each source. As particular cases of our general expressions, we also derive closed-form expressions of the average AoI for both multi-source M/M/1 and single-source M/G/1 queueing models.
21.	Moltafet, Mohammad, et al. (författare) Moment Generating Function of Age of Information in Multisource M/G/1/1 Queueing Systems 2022 Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 70:10, s. 6503-6516 Tidskriftsartikel (refereegranskat)abstract We consider a multi-source status update system, where each source generates status update packets according to a Poisson process which are then served according to a generally distributed service time. For this multi-source M/G/1/1 queueing model, we consider a self-preemptive packet management policy and derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI of each source. According to the policy, an arriving fresh packet preempts the possible packet of the same source in the system. Furthermore, we derive the MGFs of the AoI and peak AoI for the globally preemptive and non-preemptive policies, for which only the average AoI and peak AoI have been derived earlier. Finally, we use the MGFs to derive the average AoI and peak AoI in a two-source M/G/1/1 queueing model under each policy. Numerical results show the effect of the service time distribution parameters on the average AoI. The results also highlight the importance of higher moments of the AoI.
22.	Moltafet, Mohammad, et al. (författare) Moment Generating Function of the AoI in a Two-Source System With Packet Management 2021 Ingår i: IEEE Wireless Communications Letters. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 2162-2337 .- 2162-2345. ; 10:4, s. 882-886 Tidskriftsartikel (refereegranskat)abstract We consider a status update system consisting of two independent sources and one server in which packets of each source are generated according to the Poisson process and packets are served according to an exponentially distributed service time. We derive the moment generating function (MGF) of the age of information (AoI) for each source in the system by using the stochastic hybrid systems (SHS) under two existing source-aware packet management policies which we term self-preemptive and non-preemptive policies. In the both policies, the system (i.e., the waiting queue and the server) can contain at most two packets, one packet of each source; when the server is busy and a new packet arrives, the possible packet of the same source in the waiting queue is replaced by the fresh packet. The main difference between the policies is that in the self-preemptive policy, the packet under service is replaced upon the arrival of a new packet from the same source, whereas in the non-preemptive policy, this new arriving packet is blocked and cleared. We use the derived MGF to find the first and second moments of the AoI and show the importance of higher moments.
23.	Moltafet, Mohammad, et al. (författare) Moment Generating Function of the AoI in Multi-Source Systems with Computation-Intensive Status Updates 2021 Ingår i: 2021 IEEE INFORMATION THEORY WORKSHOP (ITW). - : IEEE. - 9781665403122 Konferensbidrag (refereegranskat)abstract We consider a multi-source status update system in which status updates are transmitted as packets containing the measured value of the monitored process and a time stamp representing the time when the sample was generated. The packets of each source are generated according to a Poisson process and served according to an exponentially distributed service time. We assume that the received status update packets need further processing before being used (hence, computation-intensive). This is mathematically modeled by an additional server at the sink. The sink server serves the packets according to an exponentially distributed service time. We introduce two packet management policies, a preemptive policy and a blocking policy, and derive the moment generating function (MGF) of the AoI of each source under the both policies. In the both policies, the system can contain at most two packets, one at the transmitter server and one at the sink server. In the preemptive policy, a new arriving packet preempts any possible packet that is currently under service regardless of the packets source index. In the blocking policy, when a server is busy at the arrival instant of a packet, the arriving packet is blocked and cleared. We assume that the same preemptive/blocking policy is employed in both the transmitter and sink server. Numerical results are provided to assess the results.
24.	Moltafet, Mohammad, et al. (författare) On the Age of Information in Multi-Source Queueing Models 2020 Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 68:8, s. 5003-5017 Tidskriftsartikel (refereegranskat)abstract Freshness of status update packets is essential for enabling services where a destination needs the most recent measurements of various sensors. In this paper, we study the information freshness of single-server multi-source queueing models under a first-come first-served (FCFS) serving policy. In the considered model, each source independently generates status update packets according to a Poisson process. The information freshness of the status updates of each source is evaluated by the average age of information (AoI). We derive an exact expression for the average AoI for the case with exponentially distributed service time, i.e., for a multi-source M/M/1 queueing model. Moreover, we derive three approximate expressions for the average AoI for a multi-source M/G/1 queueing model having a general service time distribution. Simulation results are provided to validate the derived exact average AoI expression, to assess the tightness of the proposed approximations, and to demonstrate the AoI behavior for different system parameters.
25.	Moltafet, Mohammad, et al. (författare) Power Minimization for Age of Information Constrained Dynamic Control in Wireless Sensor Networks 2022 Ingår i: IEEE Transactions on Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0090-6778 .- 1558-0857. ; 70:1, s. 419-432 Tidskriftsartikel (refereegranskat)abstract We consider a status update system where multiple sensors communicate timely information about various random processes to a sink. The sensors share orthogonal sub-channels to transmit such information in the form of status update packets. A central controller can control the sampling actions of the sensors to trade-off between the transmit power consumption and information freshness which is quantified by the Age of Information (AoI). We jointly optimize the sampling action of each sensor, the transmit power allocation, and the sub-channel assignment to minimize the average total transmit power of all sensors, subject to a maximum average AoI constraint for each sensor. To solve the problem, we develop a dynamic control algorithm using the Lyapunov drift-plus-penalty method and provide optimality analysis of the algorithm. According to the Lyapunov drift-plus-penalty method, to solve the main problem, we need to solve an optimization problem in each time slot which is a mixed integer non-convex optimization problem. We propose a low-complexity sub-optimal solution for this per-slot optimization problem that provides near-optimal performance and we evaluate the computational complexity of the solution. Numerical results illustrate the performance of the proposed dynamic control algorithm and the performance of the sub-optimal solution for the per-slot optimization problem versus the different parameters of the system. The results show that the proposed dynamic control algorithm achieves more than 60 % saving in the average total transmit power compared to a baseline policy.
26.	Moltafet, Mohammad, et al. (författare) Power Minimization in Wireless Sensor Networks With Constrained AoI Using Stochastic Optimization 2019 Ingår i: CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS. - : IEEE. - 9781728143002 ; , s. 406-410 Konferensbidrag (refereegranskat)abstract In this paper, we consider a system where multiple low-power sensors communicate timely information about a random process to a sink. The sensors share orthogonal subchannels to transmit such information in the form of status update packets. Freshness of the sensors information at the sink is characterized by the Age of Information (AoI), and the sensors can control the sampling policy by deciding whether to take a sample or not. We formulate an optimization problem to minimize the time average total transmit power of sensors by jointly optimizing the sampling action of each sensor, the transmit power allocation, and the subchannel assignment under the constraints on the maximum time average AoI and maximum power of each sensor. To solve the optimization problem, we use the Lyapunov drift-plus-penalty method. Numerical results show the performance of the proposed algorithm versus the different parameters of the system.
27.	Moltafet, Mohammad, et al. (författare) Status Update Control and Analysis Under Two-Way Delay 2023 Ingår i: IEEE/ACM Transactions on Networking. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1063-6692 .- 1558-2566. Tidskriftsartikel (refereegranskat)abstract We study status updating under two-way delay in a system consisting of a sampler, a sink, and a controller residing at the sink. The controller drives the sampling process by sending request packets to the sampler. Upon receiving a request, the sampler generates a sample and transmits the status update packet to the sink. Transmissions of both request and status update packets encounter random delays. We develop optimal control policies to minimize the average age of information (AoI) using the tools of Markov decision processes in two scenarios. We begin with the system having at most one active request, i.e., a generated request for which the sink has not yet received a status update packet. Then, as the main distinctive feature of this paper, we initiate pipelined-type status updating by studying a system having at most two active requests. Furthermore, we conduct AoI analysis by deriving the average AoI expressions for the Zero-Wait-1, Zero-Wait-2, and Wait-1 policies. According to the Zero-Wait-1 policy, whenever a status update packet is delivered to the sink, a new request packet is inserted into the system. The Zero-Wait-2 policy operates similarly, except that the system can hold two active requests. According to the Wait-1 policy, whenever a status update packet is delivered to the sink, a new request is sent after a waiting time which is a function of the current AoI. Numerical results illustrate the performance of each status updating policy under varying system parameter values.
28.	Moltafet, Mohammad, et al. (författare) Timely status updating via packet management in multisource systems 2023 Ingår i: Age of information. - Cambridge : Cambridge University Press. - 9781108943321 ; , s. 115-139 Bokkapitel (övrigt vetenskapligt/konstnärligt)
29.	Moltafet, Mohammad, et al. (författare) Worst Case Age of Information in Wireless Sensor Networks: A Multi-Access Channel 2020 Ingår i: IEEE Wireless Communications Letters. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 2162-2337 .- 2162-2345. ; 9:3, s. 321-325 Tidskriftsartikel (refereegranskat)abstract Freshness of status update packets is essential for enabling a wide range of applications in wireless sensor networks (WSNs). Accordingly, we consider a WSN where sensors communicate status updates to a destination by contending for the channel access based on a carrier sense multiple access (CSMA) method. We analyze the worst case average age of information (AoI) and average peak AoI from the view of one sensor in a system where all the other sensors have a saturated queue. Numerical results illustrate the importance of optimizing the contention window size and the packet arrival rate to maximize the information freshness.
30.	Moltafet, Mohammad, et al. (författare) Worst Case Analysis of Age of Information in a Shared-Access Channel 2019 Ingår i: 2019 16TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS (ISWCS). - : IEEE. - 9781728125275 ; , s. 613-617 Konferensbidrag (refereegranskat)abstract Freshness of status update packets is essential for enabling a wide range of Internet of Things (IoT) applications. In this paper, we consider a status update system in which various sensors are assigned to transmit status update packets of a physical process to a desired destination. We consider that the sensors share a wireless channel and contend for the channel access based on a carrier sense multiple access (CSMA) method. We study freshness of the status update system at the destination using the age of information (AoI) metric. To this end, we analyze the worst case average AoI for each sensor in the CSMA-based system. Numerical results show that the AoI in the CSMA-based system may dramatically increase when the number of sensors increases. Moreover, we observe that the contention window size and the packet arrival rate must be optimized since they have a critical role in the performance of the system.
31.	Niittykoski, Minna, et al. (författare) Immunohistochemical Characterization and Sensitivity to Human Adenovirus Serotypes 3, 5, and 11p of New Cell Lines Derived from Human Diffuse Grade II to IV Gliomas 2017 Ingår i: Translational Oncology. - : ELSEVIER SCIENCE INC. - 1944-7124 .- 1936-5233. ; 10:5, s. 772-779 Tidskriftsartikel (refereegranskat)abstract BACKGROUND: Oncolytic adenoviruses show promise in targeting gliomas because they do not replicate in normal brain cells. However, clinical responses occur only in a subset of patients. One explanation could be the heterogenic expression level of virus receptors. Another contributing factor could be variable activity of tumor antiviral defenses in different glioma subtypes. METHODS: We established a collection of primary low-passage cell lines from different glioma subtypes (3 glioblastomas, 3 oligoastrocytomas, and 2 oligodendrogliomas) and assessed them for receptor expression and sensitivity to human adenovirus (HAd) serotypes 3, 5, and 11p. To gauge the impact of antiviral defenses, we also compared the infectivity of the oncolytic adenoviruses in interferon (IFN)-pretreated cells with IFN-sensitive Semliki Forest virus (SFV). RESULTS: Immunostaining revealed generally low expression of HAd5 receptor CAR in both primary tumors and derived cell lines. HAd11p receptor CD46 levels were maintained at moderate levels in both primary tumor samples and derived cell lines. HAd3 receptor DSG-2 was reduced in the cell lines compared to the tumors. Yet, at equal multiplicities of infection, the oncolytic potency of HAd5 in vitro in tumor-derived cells was comparable to HAd11p, whereas HAd3 lysed fewer cells than either of the other two HAd serotypes in 72 hours. IFN blocked replication of SFV, while HAds were rather unaffected. CONCLUSIONS: Adenovirus receptor levels on glioma-derived cell lines did not correlate with infection efficacy and may not be a relevant indicator of clinical oncolytic potency. Adenovirus receptor analysis should be preferentially performed on biopsies obtained perioperatively.
32.	Schael, S., et al. (författare) Electroweak measurements in electron positron collisions at W-boson-pair energies at LEP 2013 Ingår i: Physics Reports. - : Elsevier BV. - 0370-1573 .- 1873-6270. ; 532:4, s. 119-244 Forskningsöversikt (refereegranskat)abstract Electroweak measurements performed with data taken at the electron positron collider LEP at CERN from 1995 to 2000 are reported. The combined data set considered in this report corresponds to a total luminosity of about 3 fb(-1) collected by the four LEP experiments ALEPH, DELPHI, 13 and OPAL, at centre-of-mass energies ranging from 130 GeV to 209 GeV. Combining the published results of the four LEP experiments, the measurements include total and differential cross-sections in photon-pair, fermion-pair and four-fermion production, the latter resulting from both double-resonant WW and ZZ production as well as singly resonant production. Total and differential cross-sections are measured precisely, providing a stringent test of the Standard Model at centre-of-mass energies never explored before in electron positron collisions. Final-state interaction effects in four-fermion production, such as those arising from colour reconnection and Bose Einstein correlations between the two W decay systems arising in WW production, are searched for and upper limits on the strength of possible effects are obtained. The data are used to determine fundamental properties of the W boson and the electroweak theory. Among others, the mass and width of the W boson, m(w) and Gamma(w), the branching fraction of W decays to hadrons, B(W -> had), and the trilinear gauge-boson self-couplings g(1)(Z), K-gamma and lambda(gamma), are determined to be: m(w) = 80.376 +/- 0.033 GeV Gamma(w) = 2.195 +/- 0.083 GeV B(W -> had) = 67.41 +/- 0.27% g(1)(Z) = 0.984(-0.020)(+0.018) K-gamma - 0.982 +/- 0.042 lambda(gamma) = 0.022 +/- 0.019. (C) 2013 Elsevier B.V. All rights reserved.
33.	Schael, S, et al. (författare) Precision electroweak measurements on the Z resonance 2006 Ingår i: Physics Reports. - : Elsevier BV. - 0370-1573 .- 1873-6270. ; 427:5-6, s. 257-454 Forskningsöversikt (refereegranskat)abstract We report on the final electroweak measurements performed with data taken at the Z resonance by the experiments operating at the electron-positron colliders SLC and LEP. The data consist of 17 million Z decays accumulated by the ALEPH, DELPHI, L3 and OPAL experiments at LEP, and 600 thousand Z decays by the SLID experiment using a polarised beam at SLC. The measurements include cross-sections, forward-backward asymmetries and polarised asymmetries. The mass and width of the Z boson, m(Z) and Gamma(Z), and its couplings to fermions, for example the p parameter and the effective electroweak mixing angle for leptons, are precisely measured: m(Z) = 91.1875 +/- 0.0021 GeV, Gamma(Z) = 2.4952 +/- 0.0023 GeV, rho(l) = 1.0050 +/- 0.0010, sin(2)theta(eff)(lept) = 0.23153 +/- 0.00016. The number of light neutrino species is determined to be 2.9840 +/- 0.0082, in agreement with the three observed generations of fundamental fermions. The results are compared to the predictions of the Standard Model (SM). At the Z-pole, electroweak radiative corrections beyond the running of the QED and QCD coupling constants are observed with a significance of five standard deviations, and in agreement with the Standard Model. Of the many Z-pole measurements, the forward-backward asymmetry in b-quark production shows the largest difference with respect to its SM expectation, at the level of 2.8 standard deviations. Through radiative corrections evaluated in the framework of the Standard Model, the Z-pole data are also used to predict the mass of the top quark, m(t) = 173(+10)(+13) GeV, and the mass of the W boson, m(W) = 80.363 +/- 0.032 GeV. These indirect constraints are compared to the direct measurements, providing a stringent test of the SM. Using in addition the direct measurements of m(t) and m(W), the mass of the as yet unobserved SM Higgs boson is predicted with a relative uncertainty of about 50% and found to be less than 285 GeV at 95% confidence level. (c) 2006 Elsevier B.V. All rights reserved.
34.	Vilni, Saeid Sadeghi, et al. (författare) AoI Analysis and Optimization in Systems with Computations-Intensive Updates 2023 Ingår i: Journal of Communications and Networks. - : KOREAN INST COMMUNICATIONS SCIENCES (K I C S). - 1229-2370 .- 1976-5541. ; 25:5, s. 585-597 Tidskriftsartikel (refereegranskat)abstract consider a status update system consisting of a sampler, a controller, a processing unit, a transmitter, and a sink. The sampler generates a sample upon receiving a request from the controller and the sample requires further processing before transmission, hence is computation-intensive. This is mathematically modeled by a server called process server. After processing the sample, the status update packet is generated and sent to the transmitter for delivery to the sink. This is mathematically modeled by a server called transmit server. The service time of each packet at the transmit and process servers follow geometric distributions. Moreover, we consider that the servers serve packets under the blocking policy, i.e., whenever a server is busy at the arrival time of a new packet, the new arriving packet is blocked and discarded. We analyze the average age of information (AoI) for two fixed policies, namely, 1) zero-wait-one policy and 2) zero-wait-blocking policy. According to the former policy, the controller requests sampling when there is no packet in the system. According to the zero-waitblocking policy, the controller requests a sample whenever the process server is idle. Furthermore, we develop an optimal control policy to minimize the average AoI using the tools of Markov decision process (MDP). In numerical results, we evaluate the performance of the policies under different system parameters. Moreover, we analyze the structure of the optimal policy.
35.	Vilni, Saeid Sadeghi, et al. (författare) Multi-Source AoI-Constrained Resource Minimization Under HARQ: Heterogeneous Sampling Processes 2024 Ingår i: IEEE Transactions on Vehicular Technology. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0018-9545 .- 1939-9359. ; 73:1, s. 1084-1099 Tidskriftsartikel (refereegranskat)abstract We consider a multi-source hybrid automatic repeat request (HARQ) based system, where a transmitter sends status update packets of random arrival (i.e., uncontrollable sampling) and generate-at-will (i.e., controllable sampling) sources to a destination through an error-prone channel. We develop transmission scheduling policies to minimize the average number of transmissions subject to an average age of information (AoI) constraint. First, we consider known environment (i.e., known system statistics) and develop a near-optimal deterministic transmission policy and a low-complexity dynamic transmission (LC-DT) policy. The former policy is derived by casting the main problem into a constrained Markov decision process (CMDP) problem, which is then solved using the Lagrangian relaxation, relative value iteration algorithm, and bisection. The LC-DT policy is developed via the drift-plus-penalty (DPP) method by transforming the main problem into a sequence of per-slot problems. Finally, we consider unknown environment and devise a learning-based transmission policy by relaxing the CMDP problem into an MDP problem using the DPP method and then adopting the deep Q-learning algorithm. Numerical results show that the proposed policies achieve near-optimal performance and illustrate the benefits of HARQ in status updating.
36.	Vogelezang, Suzanne, et al. (författare) Novel loci for childhood body mass index and shared heritability with adult cardiometabolic traits. 2020 Ingår i: PLoS genetics. - : Public Library of Science (PLoS). - 1553-7404. ; 16:10 Tidskriftsartikel (refereegranskat)abstract The genetic background of childhood body mass index (BMI), and the extent to which the well-known associations of childhood BMI with adult diseases are explained by shared genetic factors, are largely unknown. We performed a genome-wide association study meta-analysis of BMI in 61,111 children aged between 2 and 10 years. Twenty-five independent loci reached genome-wide significance in the combined discovery and replication analyses. Two of these, located near NEDD4L and SLC45A3, have not previously been reported in relation to either childhood or adult BMI. Positive genetic correlations of childhood BMI with birth weight and adult BMI, waist-to-hip ratio, diastolic blood pressure and type 2 diabetes were detected (Rg ranging from 0.11 to 0.76, P-values <0.002). A negative genetic correlation of childhood BMI with age at menarche was observed. Our results suggest that the biological processes underlying childhood BMI largely, but not completely, overlap with those underlying adult BMI. The well-known observational associations of BMI in childhood with cardio-metabolic diseases in adulthood may reflect partial genetic overlap, but in light of previous evidence, it is also likely that they are explained through phenotypic continuity of BMI from childhood into adulthood.
37.	Zakeri, Aholfaz, et al. (författare) Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals 2021 Ingår i: 2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM). - : IEEE. - 9781728181042 Konferensbidrag (refereegranskat)abstract We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a buffer-aided relay through unreliable links. We formulate a stochastic optimization problem aiming to minimize the sum average age of information (AAoI) of sources under per-slot transmission capacity constraints and a long-run average resource constraint. To solve the problem, we recast it as a constrained Markov decision process (CMDP) problem and adopt the Lagrangian method. We analyze the structure of an optimal policy for the resulting MDP problem that possesses a switching-type structure. We propose an algorithm that obtains a stationary deterministic near-optimal policy, establishing a benchmark for the system. Simulation results show the effectiveness of our algorithm compared to benchmark algorithms.
38.	Zakeri, Abolfazl, et al. (författare) Minimizing the AoI in Multi-Source Two-Hop Systems under an Average Resource Constraint 2022 Ingår i: 2022 IEEE 23RD INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATION (SPAWC). - : IEEE. - 9781665494557 - 9781665494564 Konferensbidrag (refereegranskat)abstract We develop online scheduling policies to minimize the sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints in a multi-source two-hop system, where independent sources randomly generate status update packets which are sent to the destination via a relay through error-prone links. A stochastic optimization problem is formulated and solved in known and unknown environments. For the known environment, an online nearoptimal low-complexity policy is developed using the drift-plus-penalty method. For the unknown environment, a deep reinforcement learning policy is developed by employing the Lyapunov optimization theory and a dueling double deep Q-network. Simulation results show up to 136% performance improvement of the proposed policy compared to a greedy-based baseline policy.
39.	Zakeri, Abolfazl, et al. (författare) Minimizing the AoI in Resource-Constrained Multi-Source Relaying Systems: Dynamic and Learning-Based Scheduling 2024 Ingår i: IEEE Transactions on Wireless Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1536-1276 .- 1558-2248. ; 23:1, s. 450-466 Tidskriftsartikel (refereegranskat)abstract We consider a multi-source relaying system where independent sources randomly generate status update packets which are sent to the destination with the aid of a relay through unreliable links. We develop transmission scheduling policies to minimize the weighted sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints. We formulate a stochastic control optimization problem and solve it using a constrained Markov decision process (CMDP) approach and a drift-plus-penalty method. The CMDP problem is solved by transforming it into an MDP problem using the Lagrangian relaxation method. We theoretically analyze the structure of optimal policies for the MDP problem and subsequently propose a structure-aware algorithm that returns a practical near-optimal policy. Using the drift-plus-penalty method, we devise a near-optimal low-complexity policy that performs the scheduling decisions dynamically. We also develop a model-free deep reinforcement learning policy for which the Lyapunov optimization theory and a dueling double deep Q-network are employed. The complexities of the proposed policies are analyzed. Simulation results are provided to assess the performance of our policies and validate the theoretical results. The results show up to 91% performance improvement compared to a baseline policy.
40.	Zakeri, Abolfazl, et al. (författare) Query-Age-Optimal Scheduling Under Sampling and Transmission Constraints 2023 Ingår i: IEEE Communications Letters. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1089-7798 .- 1558-2558. ; 27:4, s. 1205-1209 Tidskriftsartikel (refereegranskat)abstract This letter provides query-age-optimal joint sampling and transmission scheduling policies for a heterogeneous status update system, consisting of a stochastic arrival and a generate-at-will source, with an unreliable channel. Our main goal is to minimize the average query age of information (QAoI) subject to average sampling, average transmission, and per-slot transmission constraints. To this end, an optimization problem is formulated and solved by casting it into a linear program. We also provide a low-complexity near-optimal policy using the notion of weakly-coupled constrained Markov decision processes. The numerical results show up to 32% performance improvement by the proposed policies compared with a benchmark policy.

Skapa referenser, mejla, bekava och länka

Länka till träfflistan

Träfflista för sökning "WFRF:(Leinonen Markus) "

Avgränsa träffmängd

År