Marian Codreanu

ORCID: 0000-0003-0210-4375
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Age of Information Optimization
  • Advanced MIMO Systems Optimization
  • Cooperative Communication and Network Coding
  • Congenital Heart Disease Studies
  • Advanced Wireless Network Optimization
  • IoT Networks and Protocols
  • Sparse and Compressive Sensing Techniques
  • Distributed Sensor Networks and Detection Algorithms
  • Advanced Wireless Communication Techniques
  • Energy Harvesting in Wireless Networks
  • Atomic and Subatomic Physics Research
  • Blind Source Separation Techniques
  • Full-Duplex Wireless Communications
  • Wireless Communication Networks Research
  • Cognitive Radio Networks and Spectrum Sensing
  • Cognitive Functions and Memory
  • Retirement, Disability, and Employment
  • Image and Signal Denoising Methods
  • Microwave Imaging and Scattering Analysis
  • Photoacoustic and Ultrasonic Imaging
  • Wireless Networks and Protocols
  • Advanced Queuing Theory Analysis
  • Wireless Communication Security Techniques
  • Health, Environment, Cognitive Aging
  • Indoor and Outdoor Localization Technologies

University of Oulu
2012-2024

Linköping University
2019-2024

University of California, Santa Cruz
2024

University of Maryland, College Park
2014

Universitatea Națională de Știință și Tehnologie Politehnica București
2002

We consider a communication system in which status updates arrive at source node, and should be transmitted through network to the intended destination node. The are samples of random process under observation, as packets, also contain time stamp identify when sample was generated. age information available node is elapsed, since last received update In this paper, we model source-destination link using queuing theory, assume that it takes successfully transmit packet an exponentially...

10.1109/tit.2016.2533395 article EN publisher-specific-oa IEEE Transactions on Information Theory 2016-02-23

We consider a system in which random status updates arrive at source node, and should be transmitted through wireless network to the intended destination node. The are samples of process, as packets, containing time stamp identify moment sample was generated. it takes successfully transmit packet is modeled an exponentially distributed service time. update age receiver elapsed since last received In this paper, we analyze case that node has capability manage arriving decide packets will...

10.1109/isit.2014.6875100 article EN 2014-06-01

We present our vision for a departure from the established way of architecting and assessing communication networks, by incorporating semantics information, defined not necessarily as meaning messages, but their significance, possibly within real-time constraint, relative to purpose data exchange. argue that research efforts must focus on laying theoretical foundations redesign entire process information generation, transmission, usage networked systems in unison developing advanced semantic...

10.1109/mnet.106.2100636 article EN IEEE Network 2022-07-01

We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter equipped with scheduler using simple opportunistic beamforming strategy, which associates an intended user for each of the transmitted data streams. For case when scheduled users available at BS, we propose general method joint design transmit receive beamformers according to different optimization criteria, including...

10.1109/tsp.2007.896292 article EN IEEE Transactions on Signal Processing 2007-08-22

Cooperative processing of transmitted signal from several multiple-input multiple-output (MIMO) base stations (BS) is considered for users located within a soft handover (SHO) region. The downlink resource allocation problem with different BS power constraints studied the orthogonal frequency division multiplexing system adaptive MIMO transmission. Joint design linear transmit and receive beamformers in multiuser transmission subject to per considered. A solution weighted sum rate...

10.1109/twc.2008.061124 article EN IEEE Transactions on Wireless Communications 2008-04-01

Freshness of status update packets is essential for enabling services where a destination needs the most recent measurements various sensors. In this paper, we study information freshness single-server multi-source queueing models under first-come first-served (FCFS) serving policy. considered model, each source independently generates according to Poisson process. The updates evaluated by average age (AoI). We derive an exact expression AoI case with exponentially distributed service time,...

10.1109/tcomm.2020.2997414 article EN IEEE Transactions on Communications 2020-05-25

We provide distributed algorithms for the radio resource allocation problem in multicell downlink multi-input single-output systems. Specifically, problems of (1) minimizing total transmit power subject to signal-to-interference-plus-noise ratio (SINR) constraints each user and (2) SINR balancing are considered. propose a consensus-based algorithm fast solution method via alternating direction multipliers. First, we derive minimization power. Then, conjunction with bracketing method, is...

10.1186/1687-1499-2014-1 article EN cc-by EURASIP Journal on Wireless Communications and Networking 2014-01-04

Information freshness is crucial for time-critical IoT applications, e.g., monitoring and control systems. We consider an status update system with multiple users, energy harvesting sensors, a wireless edge node. The users receive time-sensitive information about physical quantities, each measured by sensor. Users send requests to the node where cache contains most recently received measurements from To serve request, either commands sensor or retrieves aged measurement cache. aim at finding...

10.1109/tcomm.2021.3114681 article EN cc-by IEEE Transactions on Communications 2021-09-22

We consider the problem of weighted sum-rate maximization (WSRMax) for a set interfering links. It plays central role in resource allocation, link scheduling or finding achievable rate regions both wireline and wireless networks. This is known to be NP-hard. propose solution method, based on branch bound technique, which solves globally nonconvex WSRMax with an optimality certificate. Efficient analytic bounding techniques are introduced their impact convergence numerically evaluated. The...

10.1109/tsp.2011.2152397 article EN IEEE Transactions on Signal Processing 2011-05-10

The cross-layer utility maximization problem, which is subject to stability constraints for a multicommodity wireless network where all links share the same number of orthogonal channels, considered in this paper. We assume time-slotted network, channel gains randomly change from one slot another. optimal control policy can be decomposed into folloing three subproblems: 1) flow control; 2) next-hop routing and -node scheduling; 3) power rate control, also known as resource allocation (RA)....

10.1109/tvt.2011.2157544 article EN IEEE Transactions on Vehicular Technology 2011-05-27

This paper considers sequential compressed acquisition and progressive reconstruction of spatially temporally correlated sensor data streams in wireless networks (WSNs) via sensing (CS). We develop a framework based on sliding window processing, which the sink can efficiently reconstruct current sensors' readings from sequence periodically delivered CS measurements by exploiting joint compressibility Kronecker sparsifying bases. Specifically, we derive recursive recovery method utilizes...

10.1109/twc.2014.2371017 article EN IEEE Transactions on Wireless Communications 2014-11-15

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 each are generated according to Poisson process served an exponentially distributed service time. derive average age (AoI) using stochastic hybrid systems (SHS) technique for policy. In Policy 1, queue can contain at most waiting same time (in addition service), 1 2. When server is busy arrival packet,...

10.1109/tcomm.2020.3036672 article EN IEEE Transactions on Communications 2020-11-09

We consider a resource-constrained IoT network, where multiple users make on-demand requests to cache-enabled edge node send status updates about various random processes, each monitored by an energy harvesting sensor. The serves users' deciding whether command the corresponding sensor fresh update or retrieve most recently received measurement from cache. Our objective is find best actions of minimize average age information (AoI) measurements upon request, i.e., AoI, subject per-slot...

10.1109/tcomm.2022.3208873 article EN cc-by IEEE Transactions on Communications 2022-09-22

The problem of weighted sum-rate maximization (WSRMax) in multicell downlink multiple-input single-output (MISO) systems is considered. known to be NP-hard. We propose a method, based on branch and bound technique, which solves globally the nonconvex WSRMax with an optimality certificate. Specifically, algorithm computes sequence asymptotically tight upper lower bounds it terminates when difference between them falls below pre-specified tolerance. Novel bounding techniques via conic...

10.1109/tsp.2011.2182346 article EN IEEE Transactions on Signal Processing 2012-01-04

We consider a distributed total transmit power minimization in multi-hop single-sink data gathering wireless sensor network by jointly optimizing the resource allocation and routing with given source rates. An inherent coupling optimal is taken into account via cross-layer optimization to increase energy efficiency of network. Instead distributing solution process horizontally commonly used dual decomposition, we apply consensus conjunction alternating direction method multipliers (ADMM). By...

10.1109/twc.2013.100213.121227 article EN IEEE Transactions on Wireless Communications 2013-10-22

We consider a status update system consisting of two independent sources, one server, and sink. The packets different sources are generated according to the Poisson process served an exponentially distributed service time. following packet management policy. When is empty, any arriving immediately enters server; when server busy, source waiting in queue replaced if new same arrives. derive average age information (AoI) considered M/M/1 queueing model by using stochastic hybrid systems (SHS)...

10.1109/isit44484.2020.9174099 article EN 2022 IEEE International Symposium on Information Theory (ISIT) 2020-06-01

We consider a status update system where multiple sensors communicate timely information about various random processes to sink. The share orthogonal sub-channels transmit such in the form of packets. A central controller can control sampling actions trade-off between power consumption and freshness which is quantified by Age Information (AoI). jointly optimize action each sensor, allocation, sub-channel assignment minimize average total all sensors, subject maximum AoI constraint for...

10.1109/tcomm.2021.3124949 article EN IEEE Transactions on Communications 2021-11-02

Joint design of linear multiuser multiple-input-multiple-output (MIMO) transceiver subject to different quality service (QoS) constraints per user and with per-antenna or antenna group power is considered. Solutions for two optimization problems are proposed, i.e., balancing the weighted signal-to-interference-plus-noise ratio (SINR) data stream rate each scheduled minimum requirements user. The proposed joint algorithms compared corresponding optimal nonlinear transmission methods as well...

10.1109/tsp.2008.917034 article EN IEEE Transactions on Signal Processing 2008-06-16

We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter equipped with scheduler using simple opportunistic beamforming strategy, which associates an intended user for each of the transmitted data streams. For case when scheduled users available at BS, we propose general method joint design transmit receive beamformers according to different optimization criteria. proposed...

10.1109/icc.2007.825 article EN IEEE International Conference on Communications 2007-06-01

This paper addresses lossy distributed source coding for acquiring correlated sparse sources via compressed sensing (CS) in wireless sensor networks. Noisy CS measurements are separately encoded at a finite rate by each sensor, followed the joint reconstruction of decoder. We develop novel complexity-constrained variable-rate quantized method, which minimizes weighted sum between mean square error signal distortion and average encoding rate. The complexity is restrained pre-quantizing...

10.1109/tcomm.2018.2790385 article EN IEEE Transactions on Communications 2018-01-08

Freshness of status update packets is essential for enabling a wide range applications in wireless sensor networks (WSNs). Accordingly, we consider WSN where sensors communicate updates to destination by contending the channel access based on carrier sense multiple (CSMA) method. We analyze worst case average age information (AoI) and peak AoI from view one system all other have saturated queue. Numerical results illustrate importance optimizing contention window size packet arrival rate...

10.1109/lwc.2019.2953628 article EN IEEE Wireless Communications Letters 2019-11-14

We consider a status update system consisting of two independent sources and one server in which packets each source are generated according to the Poisson process served an exponentially distributed service time. derive moment generating function (MGF) age information (AoI) for by using stochastic hybrid systems (SHS) under existing source-aware packet management policies we term self-preemptive non-preemptive policies. In both policies, (i.e., waiting queue server) can contain at most...

10.1109/lwc.2020.3048628 article EN cc-by IEEE Wireless Communications Letters 2021-01-01

We consider a multi-source relaying system where independent sources randomly generate status update packets which are sent to the destination with aid of relay through unreliable links. develop transmission scheduling policies minimize weighted sum average age information (AoI) subject capacity and long-run resource constraints. formulate stochastic control optimization problem solve it using constrained Markov decision process (CMDP) approach drift-plus-penalty method. The CMDP is solved...

10.1109/twc.2023.3278460 article EN cc-by IEEE Transactions on Wireless Communications 2023-06-07
Coming Soon ...