Bounds on the Maximum Number of Concurrent Links in MIMO Ad Hoc Networks with QoS Constraints

Pengkai Zhao Babak Daneshrad

Home/Archive/arXiv

arXiv · 1004.4297

Bounds on the Maximum Number of Concurrent Links in MIMO Ad Hoc Networks with QoS Constraints

Pengkai Zhao Babak Daneshrad

View original source ↗Read source document ↗Export metadata ↓

Abstract

Multiple-Input Multiple-Output (MIMO) based Medium Access Control (MAC) protocols have received a good deal of attention as researchers look to enhance overall performance of Ad Hoc networks by leveraging multi antenna enabled nodes. To date such MAC protocols have been evaluated through comparative simulation based studies that report on the number of concurrent links the protocol can support. However, a bound on the maximum number of concurrent links (MNCL) that a MIMO based MAC protocol should strive to achieve has hitherto been unavailable. In this paper we present a theoretical formulation for calculating the bound on the MNCL in a Mobile Ad Hoc Network (MANET) where the nodes have multiple antenna capability, while guaranteeing a minimum Quality of Service (QoS). In an attempt to make our findings as practical and realistic as possible, the study incorporates models for the following PHY layer and channel dependent elements: (a) path loss and fast fading effects, in order to accurately model adjacent link interference; (b) a Minimum Mean Squared Error (MMSE) based detector in the receiver which provides a balance between completely nulling of neighboring interference and hardware complexity. In calculating the bound on the MNCL our work also delivers the optimal power control solution for the network as well as the optimal link selection. The results are readily applicable to MIMO systems using Receive Diversity, Space Time Block Coding (STBC), and Transmit Beamforming and show that with a 4 element antenna system, as much as 3x improvement in the total number of concurrent links can be achieved relative to a SISO based network. The results also show diminishing improvement as the number of antennas is increased beyond 4, and the maximum allowable transmit power is increased beyond 10 dBm (for the simulated parameters).

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Pengkai Zhao Babak Daneshrad. 2010-04-24. Bounds on the Maximum Number of Concurrent Links in MIMO Ad Hoc Networks with QoS Constraints. https://arxiv.org/abs/1004.4297

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

CSI Simulation: Why Additive Noise Fails and How to Fix It

Channel State Information (CSI) has become a widely used wireless channel sensing modality for applications such as indoor localization, activity recognition, and respiration monitoring. Because collecting labeled data under every target condition is impractical, training CSI-based models often relies on simulated data produced by adding noise or perturbations to recorded channel estimates, most commonly additive white Gaussian noise (AWGN). This practice assumes that the receiver chain between the antenna and the channel estimator is linear and gain-invariant. We test this assumption empirically using RF jamming as a controlled perturbation on 6 commodity receivers across 2 indoor environments. The assumption does not hold. Automatic gain control compresses the channel estimate multiplicatively before digitization, producing amplitude distributions that no additive noise variance can reproduce. To close the resulting fidelity gap, we propose M_QTC, a measurement-calibrated model that learns the per-subcarrier distribution transformation through quantile mapping, temporal filtering, and copula-based cross-subcarrier reordering. M_QTC reduces amplitude error 8-fold and closes 89% of the aggregate fidelity gap across four complementary dimensions. The improvement transfers directly to downstream tasks, where 5 classifiers from different families trained on M_QTC-simulated data recover 93% of real-data jamming detection performance, while AWGN-trained classifiers remain near random decision.

cs.NI↗

arXiv2026

BALANCE: Hybrid Autoregressive-Speculative LLM Inference at the Network Edge

Edge inference is a promising paradigm to provide large language model (LLM) inference services in next-generation mobile networks. LLM inference mainly relies on two approaches: Autoregressive decoding (AD) generates output tokens sequentially, resulting in long latency; Speculative decoding (SD) accelerates inference by using a small language model (SLM) to generate multiple draft tokens for LLM verification, but incurs extra memory costs. Due to this latency-memory tradeoff, neither approach alone can efficiently serve users with heterogeneous demands under limited edge computing resources. To address this challenge, we propose a hybrid autoregressive-speculative inference (BALANCE) framework for edge LLM inference. In BALANCE, an edge server hosts both an SLM and an LLM, admits users, assigns each admitted user to the AD or SD mode, and performs the two modes simultaneously. To maximize the number of served users, we formulate a task throughput maximization problem to jointly determine user admission and computing resource allocation between AD and SD under user latency requirements and server memory constraints. Since the problem is NP-hard, we develop a polynomial-time algorithm that transforms the original problem into two sub-problems and obtains a sub-optimal solution with a constant approximation guarantee. Experiments demonstrate that BALANCE consistently outperforms conventional AD and SD and significantly improves task throughput.

cs.NI↗

arXiv2026

Zero-Knowledge Remote Adversarial Attack against Wi-Fi-based Human Activity Recognition for Privacy Protection

The growing capability of Wi-Fi devices to identify human activities using channel state information (CSI) raises privacy concerns. To counter this threat, we propose GRAW, an adversary system, acting as a privacy defender, that degrades the human activity recognition (HAR) system at the user device by perturbing the router's signals that the device uses to estimate CSI. GRAW employs generative adversarial imitation learning (GAIL) to construct perturbation signals, and thereby eliminates the need for any information on the target HAR systems and their inputs (i.e., zero-knowledge operation). We evaluate GRAW against seven representative HAR models, using datasets collected in five environments, including our own dataset. We observe that GRAW is the only remote attack scheme that degrades every tested HAR model to a random-selection level. At the same perturbation level, GRAW achieves an attack success ratio up to 76.7% higher than comparison methods, while maintaining over 99% packet success rate on regular Wi-Fi communication. We demonstrate the feasibility of GRAW through real-time, over-the-air experiments with software-defined radios.

cs.NI↗