WMWei Mao

Wei Mao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Wei Mao has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Feudal HRL for Joint Spatio-Temporal Energy Optimization in O-RAN Systems

    by Yekaterina Sadovaya, Olga Vikhrova, Lili Wei, Omid Semiari, Wei Mao, Shu-Ping Yeh, Hosein Nikopour, Sergey Andreev

  • Providing High Reliability on Blockage-Prone Higher Frequency Bands With Packet-Level Coding

    by Wei Mao, Hosein Nikopour, Shilpa Talwar

    Higher frequency bands (HFB) such as mmWave and sub-THz are important constituents of next generation wireless communication technology such as 6 G, as they offer large bandwidth and capacity to support high data rates. However, due to the narrow beam width and high penetration loss, such HFB links are easily susceptible to blockage effects caused by moving objects such as humans and cars. Blockage durations are relatively long ($\sim 500$ milliseconds) while some 6G use cases require a high reliability within a much shorter delay, which makes it challenging to support them on HFB. In this paper we use linear packet-level coding, which is a spectrally-efficient low-latency proactive reliability enhancement technique above the physical (PHY) layer, to efficiently utilize the aggregated bandwidth of multiple HFB links to provide the required quality of service (QoS) of high-reliability and delay-critical traffic. To effectively combat the deleterious effects of blockage on the HFB links, we analytically characterize the reliability performance and its limit of packet-level coding in the blockage-prone multi-link environment, and based on which we design optimization algorithms to minimize the number of HFB links and the radio resource needed to achieve the required QoS. Numerical results show that our coding solution requires far less HFB links than the existing packet duplication technique defined in 5G standards, and with low complexity our optimization algorithm can significantly reduce the amount of radio resource needed. Our solution provides a feasible way of harvesting the vast bandwidth of blockage-prone HFB to provide high-reliability low-latency data services, which cannot be practically enabled by traditional techniques such as packet duplication or retransmission.


  • Multilevel Coding for Achieving Low Latency and Low Outage in mmWave Networks

    by Mine Gokce Dogan, Jaimin Shah, Martina Cardone, Christina Fragouli, Wei Mao, Hosein Nikopour, Rath Vannithamby

    Achieving ultra-reliable low-latency communications (URLLC) is critical for the operation of data-intensive applications and for ensuring seamless connectivity. Millimeter-wave (mmWave) technology is expected to support URLLC by expanding the available spectrum and providing multi-gigabit services. However, a well-recognized challenge is that mmWave communication links are susceptible to blockage, which may lead to communication disruptions. Conventional approaches, such as interleaving and feedback mechanisms provide resilience against such blockages at the cost of incurring additional delay, which may be too large to support URLLC effectively. This calls for novel techniques to develop resilient transmission mechanisms that can support URLLC. This paper develops gracefully resilient transmission mechanisms by deploying multilevel codes over space and over time. These codes allow the control of the received information and they accommodate different quality of service requirements of different information streams. Our evaluations, carried out also within the ns-3 network simulator, show that deploying these codes leads to attractive trade-offs between rate, delay, and outage probability.


  • Open Access

    Analysis of Duplexing Patterns in Multi-Hop mmWave Integrated Access and Backhaul Systems

    by Nikita Tafintsev, Dmitri Moltchanov, Wei Mao, Hosein Nikopour, Shu-Ping Yeh, Shilpa Talwar, Mikko Valkama, Sergey Andreev

    Integrated Access and Backhaul (IAB) technology promises to facilitate cost-effective deployments of 5G New Radio (NR) systems operating in both sub-6 GHz and millimeter-wave (mmWave) bands. As full-duplex wireless systems are in their infancy, initial deployments of IAB networks may need to rely on half-duplex operation to coordinate transmissions between access and backhaul links. However, the use of half-duplex operation not only makes the scheduling of links in the IAB networks interdependent, but also the number of their feasible combinations grows exponentially with the network size, thereby posing challenges to the optimal design of such systems. In this paper, by accounting for mmWave radio characteristics, we propose a joint resource allocation and link scheduling framework to enhance the user equipment (UE) throughput in multi-hop in-band IAB systems. We keep the problem in the form of linear programming type for the feasibility of the practical applications. We show that the increased number of uplink and downlink transmission time interval (TTI) configurations does not result in improved UE throughput as compared to two configurations. Further, we demonstrate that in-band IAB systems tend to be backhaul-limited, and the utilization of multi-beam functionality at the IAB-donor alleviates this limitation by doubling the average UE throughput. Finally, we show that the use of proportional-fair allocations allows the average UE throughput to be improved by around 10% as compared to the max-min allocations.


  • Open Access

    Delay-Aware Link Scheduling in IAB Networks With Dynamic User Demands

    by Yekaterina Sadovaya, Olga Vikhrova, Wei Mao, Shu-Ping Yeh, Omid Semiari, Hosein Nikopour, Shilpa Talwar, Sergey Andreev

    Integrated Access and Backhaul (IAB) is a costefficient network densification technology for improving the coverage and capacity of the millimeter-wave (mmWave) cellular networks. In IAB systems, user traffic is forwarded to/from the wired base station by one or more relay stations, known as IAB nodes. Due to the multi-hop relaying, these systems may be subject to large packet delays and poor performance when the load is unevenly distributed among nodes. Addressing this limitation via delay-aware access and backhaul link scheduling in IAB networks is challenging due to potentially large network scale, complex topology, half-duplex, and interference constraints. In this paper, the topical link scheduling problem is formulated as a Markov decision problem (MDP) for a single-donor IAB system with a general topology that allows for users with different delay requirements and traffic dynamics. The proposed link scheduling strategy jointly optimizes (i) user traffic routing and (ii) multiplexing of access and backhaul links under half-duplex constraints and non-negligible interference that may arise in dense IAB systems even with high beam directionality. To address the complexity of our formulated MDP, we consider several approximation methods, namely, Q-learning, Monte Carlo Tree Search (MCTS), and genetic algorithms (GAs). Then, we propose a customized version of the GA, which provides the preferred optimality-complexity trade-off and offers a 15% packet delay reduction as compared to the state-of-the-art backpressure algorithm.


  • Open Access

    Ray-Based Modeling of Directional Millimeter-Wave V2V Transmissions in Highway Scenarios

    by Yekaterina Sadovaya, Dmitrii Solomitckii, Wei Mao, Oner Orhan, Hosein Nikopour, Shilpa Talwar, Sergey Andreev, Yevgeni Koucheryavy

    Due to the need for larger bandwidth, future mobile networks may primarily operate over millimeter-wave (mmWave) bands. In this regard, one of the central research topics today is mmWave channel modeling. However, highly mobile vehicle-to-vehicle (V2V) mmWave channels pose an open question because conducting measurements may be challenging in this environment. The existing publications on mmWave V2V channel modeling consider line-of-sight (LoS) or single-blocker scenarios. Accordingly, the impact of interference from adjacent vehicles is not taken into account. Conventional analytical models suggest that path loss (PL) strikes equally in all directions whereas measurements are inherently directional, especially in the case of mmWave propagation. Recently, it was proposed to synthesize the omnidirectional PL from directional measurements. However, with this method, the resulting PL is underestimated. Moreover, theoretical models assume that vehicular transceivers follow a certain predetermined distribution, which may not be accurate in real-world scenarios. Several works take into account the directionality of an antenna pattern when the antenna orientation is known. However, the effects of reflection, diffraction, and transmission through obstacles are not considered. One way to avoid these limitations is to use ray-based simulations. However, the ray-launching (RL) approach does not specify any criteria for the directionality of the antenna patterns. Assuming omnidirectional PL appears impractical for mmWave transmission where directional communication is crucial to combat high PL. In this paper, we propose an approach for synthesizing directional PL based on extensive RL modeling. For the obtained directional and omnidirectional PL, we parametrize the close-in (CI) and float-intercept (FI) channel models. As a result of our modeling, from 0.1 to 2.7 for the LoS and from 0.1 to 2.6 for the non-LoS (NLoS) higher PL exponent is observed as compared to the omnidirectional case.


  • Open Access

    Models and Information-Theoretic Bounds for Nanopore Sequencing

    by Wei Mao, Suhas N. Diggavi, Sreeram Kannan

    Nanopore sequencing is an emerging new technology for sequencing DNA, which can read long fragments of DNA (~50,000 bases) in contrast to most current short-read sequencing technologies which can only read hundreds of bases. While nanopore sequencers can acquire long reads, the high error rates (20%–30%) pose a technical challenge. In a nanopore sequencer, a DNA is migrated through a nanopore and current variations are measured. The DNA sequence is inferred from this observed current pattern using an algorithm called a base-caller. In this paper, we propose a mathematical model for the “channel” from the input DNA sequence to the observed current, and calculate bounds on the information extraction capacity of the nanopore sequencer. This model incorporates impairments like (non-linear) inter-symbol interference, deletions, as well as random response. These information bounds have two-fold application: (1) The decoding rate with a uniform input distribution can be used to calculate the average size of the plausible list of DNA sequences given an observed current trace. This bound can be used to benchmark existing base-calling algorithms, as well as serving a performance objective to design better nanopores. (2) When the nanopore sequencer is used as a reader in a DNA storage system, the storage capacity is quantified by our bounds.


  • Isolation and characterization of Acidithiobacillus caldus TST3 and the effect of pre-cultivation on its dissolution of phosphorous from rock phosphates

    by Lingling Li, Zhenyu Zuo, Zaosheng Lv, Zhonghua Yang, Xiaorong Qi, Wenting Zhou, Haiyan Guan, Yaoning Liu, Wei Mao


  • Capacity Analysis of Discrete Energy Harvesting Channels

    by Wei Mao, Babak Hassibi

    We study the channel capacity of a general discrete energy harvesting channel with a finite battery. Contrary to traditional communication systems, the transmitter of such a channel is powered by a device that harvests energy from a random exogenous energy source and has a finite-sized battery. As a consequence, at each transmission opportunity, the system can only transmit a symbol whose energy is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is simultaneously random, instantaneous, and influenced by the full history of the inputs and the energy harvesting process. Furthermore, naturally, in such a channel, the energy information is observed causally at the transmitter. Both of these characteristics pose great challenges for the analysis of the channel capacity. In this paper, we use techniques developed for channels with side information and finite-state channels, to obtain lower and upper bounds on the capacity of energy harvesting channels. In particular, in a general case with Markov energy harvesting processes, we use stationarity and ergodicity theory to compute and optimize the achievable rates for the channels, and derive a series of computable capacity upper and lower bounds.