Source author record

Min Sheng

Min Sheng appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

15works
10topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

15 published item(s)

preprint2026arXiv

Space Network of Experts: Architecture and Expert Placement

Leveraging continuous solar energy harvesting at high efficiency, space data centers are envisioned as a promising platform for executing energy-intensive large language models (LLMs). Recognizing this advantage, space and AI conglomerates (e.g., SpaceX, Google) are actively investing in this vision. One key challenge, however, is the efficient distributed deployment of a large-scale LLM in a satellite network due to the limited onboard computing and communication resources. This gives rise to a placement problem that involves partitioning and mapping model components to satellites such that the fundamentally different model architecture and network topology can be reconciled to ensure low-latency token generation. To address this problem, we present the Space Network of Experts (Space-XNet) framework targeting the distributed execution of a popular mixture-of-experts (MoE) model in space. The proposed placement strategies are two-level: (1) layer placement, which assigns MoE layers to satellite subnets; and (2) intra-layer expert placement, which assigns individual experts to satellites associated with the same layer/subnet. For layer placement, we exploit the ring-like communication pattern of autoregressive inference to partition the satellite constellation along the orbiting direction into subnets arranged on a ring, each hosting one MoE layer. Based on this architecture, we formulate and solve an optimization problem for intra-layer expert placement to map experts with heterogeneous activation probabilities onto satellites. The derived strategy reveals an intuitive principle: a frequently activated expert should be mapped to a satellite on a routing path with low expected latency. Experiments over a thousand-satellite constellation show that Space-XNet achieves at least a threefold latency reduction compared with conventional random and ablation-based placement strategies.

preprint2025arXiv

Regional Resource Management for Service Provisioning in LEO Satellite Networks: A Topology Feature-Based DRL Approach

Satellite networks with wide coverage are considered natural extensions to terrestrial networks for their long-distance end-to-end (E2E) service provisioning. However, the inherent topology dynamics of low earth orbit satellite networks and the uncertain network scales bring an inevitable requirement that resource chains for E2E service provisioning must be efficiently re-planned. Therefore, achieving highly adaptive resource management is of great significance in practical deployment applications. This paper first designs a regional resource management (RRM) mode and further formulates the RRM problem that can provide a unified decision space independent of the network scale. Subsequently, leveraging the RRM mode and deep reinforcement learning framework, we develop a topology feature-based dynamic and adaptive resource management algorithm to combat the varying network scales. The proposed algorithm successfully takes into account the fixed output dimension of the neural network and the changing resource chains for E2E service provisioning. The matched design of the service orientation information and phased reward function effectively improves the service performance of the algorithm under the RRM mode. The numerical results demonstrate that the proposed algorithm with the best convergence performance and fastest convergence rate significantly improves service performance for varying network scales, with gains over compared algorithms of more than 2.7%, 11.9%, and 10.2%, respectively.

preprint2023arXiv

Energy-Efficient Power Control for Multiple-Task Split Inference in UAVs: A Tiny Learning-Based Approach

The limited energy and computing resources of unmanned aerial vehicles (UAVs) hinder the application of aerial artificial intelligence. The utilization of split inference in UAVs garners significant attention due to its effectiveness in mitigating computing and energy requirements. However, achieving energy-efficient split inference in UAVs remains complex considering of various crucial parameters such as energy level and delay constraints, especially involving multiple tasks. In this paper, we present a two-timescale approach for energy minimization in split inference, where discrete and continuous variables are segregated into two timescales to reduce the size of action space and computational complexity. This segregation enables the utilization of tiny reinforcement learning (TRL) for selecting discrete transmission modes for sequential tasks. Moreover, optimization programming (OP) is embedded between TRL's output and reward function to optimize the continuous transmit power. Specifically, we replace the optimization of transmit power with that of transmission time to decrease the computational complexity of OP since we reveal that energy consumption monotonically decreases with increasing transmission time. The replacement significantly reduces the feasible region and enables a fast solution according to the closed-form expression for optimal transmit power. Simulation results show that the proposed algorithm can achieve a higher probability of successful task completion with lower energy consumption.

preprint2023arXiv

Robust TOA-based Localization with Inaccurate Anchors for MANET

Accurate node localization is vital for mobile ad hoc networks (MANETs). Current methods like Time of Arrival (TOA) can estimate node positions using imprecise baseplates and achieve the Cramér-Rao lower bound (CRLB) accuracy. In multi-hop MANETs, some nodes lack direct links to base anchors, depending on neighbor nodes as dynamic anchors for chain localization. However, the dynamic nature of MANETs challenges TOA's robustness due to the availability and accuracy of base anchors, coupled with ranging errors. To address the issue of cascading positioning error divergence, we first derive the CRLB for any primary node in MANETs as a metric to tackle localization error in cascading scenarios. Second, we propose an advanced two-step TOA method based on CRLB which is able to approximate target node's CRLB with only local neighbor information. Finally, simulation results confirm the robustness of our algorithm, achieving CRLB-level accuracy for small ranging errors and maintaining precision for larger errors compared to existing TOA methods.

preprint2020arXiv

Access Points in the Air: Modeling and Optimization of Fixed-Wing UAV Network

Fixed-wing unmanned aerial vehicles (UAVs) are of great potential to serve as aerial access points (APs) owing to better aerodynamic performance and longer flight endurance. However, the inherent hovering feature of fixed-wing UAVs may result in discontinuity of connections and frequent handover of ground users (GUs). In this work, we model and evaluate the performance of a fixed-wing UAV network, where UAV APs provide coverage to GUs with millimeter wave backhaul. Firstly, it reveals that network spatial throughput (ST) is independent of the hover radius under real-time closest-UAV association, while linearly decreases with the hover radius if GUs are associated with the UAVs, whose hover center is the closest. Secondly, network ST is shown to be greatly degraded with the over-deployment of UAV APs due to the growing air-to-ground interference under excessive overlap of UAV cells. Finally, aiming to alleviate the interference, a projection area equivalence (PAE) rule is designed to tune the UAV beamwidth. Especially, network ST can be sustainably increased with growing UAV density and independent of UAV flight altitude if UAV beamwidth inversely grows with the square of UAV density under PAE.

preprint2020arXiv

Efficient Betweenness Based Content Caching and Delivery Strategy in Wireless Networks

In this work, we propose a content caching and delivery strategy to maximize throughput capacity in cache-enabled wireless networks. To this end, efficient betweenness (EB), which indicates the ratio of content delivery paths passing through a node, is first defined to capture the impact of content caching and delivery on network traffic load distribution. Aided by EB, throughput capacity is shown to be upper bounded by the minimal ratio of successful delivery probability (SDP) to EB among all nodes. Through effectively matching nodes' EB with their SDP, the proposed strategy improves throughput capacity with low computation complexity. Simulation results show that the gap between the proposed strategy and the optimal one (obtained through exhausted search) is kept smaller than 6%.

preprint2016arXiv

Analysis of Interference Correlation in Non-Poisson Networks

The correlation of interference has been well quantified in Poisson networks where the interferers are independent of each other. However, there exists dependence among the base stations (BSs) in wireless networks. In view of this, we quantify the interference correlation in non-Poisson networks where the interferers are distributed as a Matern cluster process (MCP) and a second-order cluster process (SOCP). Interestingly, it is found that the correlation coefficient of interference for the Matern cluster networks, $ζ_{MCP}$, is equal to that for second-order cluster networks, $ζ_{SOCP}$. Furthermore, they are greater than their counterpart for the Poisson networks. This shows that clustering in interferers enhances the interference correlation. In addition, we show that the correlation coefficients $ζ_{MCP}$ and $ζ_{SOCP}$ increase as the average number of points in each cluster, $c$, grows, but decrease with the increase in the cluster radius, $R$. More importantly, we point that the effects of clustering on interference correlation can be neglected as $\frac{c}{π^{2}R^{2}}\rightarrow0$. Finally, the analytical results are validated by simulations.

preprint2016arXiv

Effect of Densification on Cellular Network Performance with Bounded Pathloss Model

In this paper, we investigate how network densification influences the performance of downlink cellular network in terms of coverage probability (CP) and area spectral efficiency (ASE). Instead of the simplified unbounded pathloss model (UPM), we apply a more realistic bounded pathloss model (BPM) to model the decay of signal power caused by pathloss. It is shown that network densification indeed degrades CP when the base station (BS) density $λ$ is sufficiently large. This is inconsistent with the result derived using UPM that CP is independent of $λ$. Moreover, we shed light on the impact of ultra-dense deployment of BSs on the ASE scaling law. Specifically, it is proved that the cellular network ASE scales with rate $λe^{-κλ}$, i.e., first increases with $λ$ and then diminishes to be zero as $λ$ goes to infinity.

preprint2016arXiv

Modeling and Analysis of SCMA Enhanced D2D and Cellular Hybrid Network

Sparse code multiple access (SCMA) has been recently proposed for the future wireless networks, which allows non-orthogonal spectrum resource sharing and enables system overloading. In this paper, we apply SCMA into device-to-device (D2D) communication and cellular hybrid network, targeting at using the overload feature of SCMA to support massive device connectivity and expand network capacity. Particularly, we develop a stochastic geometry based framework to model and analyze SCMA, considering underlaid and overlaid mode. Based on the results, we analytically compare SCMA with orthogonal frequency-division multiple access (OFDMA) using area spectral efficiency (ASE) and quantify closed-form ASE gain of SCMA over OFDMA. Notably, it is shown that system ASE can be significantly improved using SCMA and the ASE gain scales linearly with the SCMA codeword dimension. Besides, we endow D2D users with an activated probability to balance cross-tier interference in the underlaid mode and derive the optimal activated probability. Meanwhile, we study resource allocation in the overlaid mode and obtain the optimal codebook allocation rule. It is interestingly found that the optimal SCMA codebook allocation rule is independent of cellular network parameters when cellular users are densely deployed. The results are helpful in the implementation of SCMA in the hybrid system.

preprint2015arXiv

Cognitive Learning of Statistical Primary Patterns via Bayesian Network

In cognitive radio (CR) technology, the trend of sensing is no longer to only detect the presence of active primary users. A large number of applications demand for more comprehensive knowledge on primary user behaviors in spatial, temporal, and frequency domains. To satisfy such requirements, we study the statistical relationship among primary users by introducing a Bayesian network (BN) based framework. How to learn such a BN structure is a long standing issue, not fully understood even in the statistical learning community. Besides, another key problem in this learning scenario is that the CR has to identify how many variables are in the BN, which is usually considered as prior knowledge in statistical learning applications. To solve such two issues simultaneously, this paper proposes a BN structure learning scheme consisting of an efficient structure learning algorithm and a blind variable identification scheme. The proposed approach incurs significantly lower computational complexity compared with previous ones, and is capable of determining the structure without assuming much prior knowledge about variables. With this result, cognitive users could efficiently understand the statistical pattern of primary networks, such that more efficient cognitive protocols could be designed across different network layers.

preprint2015arXiv

D2D Enhanced Heterogeneous Cellular Networks with Dynamic TDD

Over the last decade, the growing amount of UL and DL mobile data traffic has been characterized by substantial asymmetry and time variations. Dynamic time-division duplex (TDD) has the capability to accommodate to the traffic asymmetry by adapting the UL/DL configuration to the current traffic demands. In this work, we study a two-tier heterogeneous cellular network (HCN) where the macro tier and small cell tier operate according to a dynamic TDD scheme on orthogonal frequency bands. To offload the network infrastructure, mobile users in proximity can engage in D2D communications, whose activity is determined by a carrier sensing multiple access (CSMA) scheme to protect the ongoing infrastructure-based and D2D transmissions. We present an analytical framework to evaluate the network performance in terms of load-aware coverage probability and network throughput. The proposed framework allows to quantify the effect on the coverage probability of the most important TDD system parameters, such as the UL/DL configuration, the base station density, and the bias factor. In addition, we evaluate how the bandwidth partition and the D2D network access scheme affect the total network throughput. Through the study of the tradeoff between coverage probability and D2D user activity, we provide guidelines for the optimal design of D2D network access.

preprint2015arXiv

End-to-end delay modeling in buffer-limited MANETs: a general theoretical framework

This paper focuses on a class of important two-hop relay mobile ad hoc networks (MANETs) with limited-buffer constraint and any mobility model that leads to the uniform distribution of the locations of nodes in steady state, and develops a general theoretical framework for the end-to-end (E2E) delay modeling there. We first combine the theories of Fixed-Point, Quasi-Birth-and-Death process and embedded Markov chain to model the limiting distribution of the occupancy states of a relay buffer, and then apply the absorbing Markov chain theory to characterize the packet delivery process, such that a complete theoretical framework is developed for the E2E delay analysis. With the help of this framework, we derive a general and exact expression for the E2E delay based on the modeling of both packet queuing delay and delivery delay. To demonstrate the application of our framework, case studies are further provided under two network scenarios with different MAC protocols to show how the E2E delay can be analytically determined for a given network scenario. Finally, we present extensive simulation and numerical results to illustrate the efficiency of our delay analysis as well as the impacts of network parameters on delay performance.

preprint2015arXiv

On throughput capacity for a class of buffer-limited MANETs

Available throughput performance studies for mobile ad hoc networks (MANETs) suffer from two major limitations: they mainly focus on the scaling law study of throughput, while the exact throughput of such networks remains largely unknown; they usually consider the infinite buffer scenarios, which are not applicable to the practical networks with limited buffer. As a step to address these limitations, this paper develops a general framework for the exact throughput capacity study of a class of buffer-limited MANETs with the two-hop relay. We first provide analysis to reveal how the throughput capacity of such a MANET is determined by its relay-buffer blocking probability (RBP). Based on the Embedded Markov Chain Theory and Queuing Theory, a novel theoretical framework is then developed to enable the RBP and closed-form expression for exact throughput capacity to be derived. We further conduct case studies under two typical transmission scheduling schemes to illustrate the applicability of our framework and to explore the corresponding capacity optimization as well as capacity scaling law. Finally, extensive simulation and numerical results are provided to validate the efficiency of our framework and to show the impacts brought by the buffer constraint.

preprint2015arXiv

Throughput capacity of two-hop relay MANETs under finite buffers

Since the seminal work of Grossglauser and Tse [1], the two-hop relay algorithm and its variants have been attractive for mobile ad hoc networks (MANETs) due to their simplicity and efficiency. However, most literature assumed an infinite buffer size for each node, which is obviously not applicable to a realistic MANET. In this paper, we focus on the exact throughput capacity study of two-hop relay MANETs under the practical finite relay buffer scenario. The arrival process and departure process of the relay queue are fully characterized, and an ergodic Markov chain-based framework is also provided. With this framework, we obtain the limiting distribution of the relay queue and derive the throughput capacity under any relay buffer size. Extensive simulation results are provided to validate our theoretical framework and explore the relationship among the throughput capacity, the relay buffer size and the number of nodes.

preprint2014arXiv

Correlations of Interference and Link Successes in Heterogeneous Cellular Networks

In heterogeneous cellular networks (HCNs), the interference received at a user is correlated over time slots since it comes from the same set of randomly located BSs. This results in the correlations of link successes, thus affecting network performance. Under the assumptions of a K-tier Poisson network, strongest-candidate based BS association, and independent Rayleigh fading, we first quantify the correlation coefficients of interference. We observe that the interference correlation is independent of the number of tiers, BS density, SIR threshold, and transmit power. Then, we study the correlations of link successes in terms of the joint success probability over multiple time slots. We show that the joint success probability is decided by the success probability in a single time slot and a diversity polynomial, which represents the temporal interference correlation. Moreover, the parameters of HCNs have an important influence on the joint success probability by affecting the success probability in a single time slot. Particularly, we obtain the condition under which the joint success probability increases with the BS density and transmit power. We further show that the conditional success probability given prior successes only depends on the path loss exponent and the number of time slots.