SearcharxivSearch

arXiv · 1507.02199

Joint Transmission in Cellular Networks with CoMP - Stability and Scheduling Algorithms

Abstract

Due to the current trend towards smaller cells, an increasing number of users of cellular networks reside at the edge between two cells; these users typically receive poor service as a result of the relatively weak signal and strong interference. Coordinated Multi-Point (CoMP) with Joint Transmission (JT) is a cellular networking technique allowing multiple Base Stations (BSs) to jointly transmit to a single user. This improves the users' reception quality and facilitates better service to cell-edge users. We consider a CoMP-enabled network, comprised of multiple BSs interconnected via a backhaul network. We formulate the OFDMA Joint Scheduling (OJS) problem of determining a subframe schedule and deciding if and how to use JT in order to maximize some utility function. We show that the OJS problem is NP-hard. We develop optimal and approximation algorithms for specific and general topologies, respectively. We consider a time dimension and study a queueing model with packet arrivals in which the service rates for each subframe are obtained by solving the OJS problem. We prove that when the problem is formulated with a specific utility function and solved optimally in each subframe, the resulting scheduling policy is throughput-optimal. Via extensive simulations we show that the bulk of the gains from CoMP with JT can be achieved with low capacity backhaul. Moreover, our algorithms distribute the network resources evenly, increasing the inter-cell users' throughput at only a slight cost to the intra-cell users. This is the first step towards a rigorous, network-level understanding of the impact of cross-layer scheduling algorithms on CoMP networks.

Explore related subjects

Keep this discovery

BibTeXRIS

Guy Grebla, Berk Birand, Peter van de Ven, Gil Zussman. 2015-07-08. Joint Transmission in Cellular Networks with CoMP - Stability and Scheduling Algorithms. https://arxiv.org/abs/1507.02199

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

KEEP EXPLORING

Related papers

Message-Level Scheduling for RLNC-Coded Multi-Source Traffic

This paper studies weighted decoding-delay minimization for multiple RLNC-coded message streams that compete for finite processing capacity at a destination. Packet arrivals are exogenous, while the scheduler only determines the processing order of packets already available at the destination. A trace-conditioned offline scheduling formulation shows that a batch-release subclass is strongly NP-hard even with a single processing unit. Message-Aware Innovation-Deficit Scheduling (MAIDS) is then developed to prioritize each serviceable message according to its weight and remaining decoding deficit. For a single processing unit, MAIDS is shown to be exactly optimal under nonblocking progressive arrivals with equal weights and under common activation with arbitrary positive weights, while the unrestricted weighted online problem admits no universal deterministic $O(1)$ competitive ratio. Simulation results on streaming and batch benchmarks show that MAIDS consistently reduces weighted decoding delay relative to the tested baselines, remains close to the offline optimum on average, and recovers the predicted exact performance boundaries.

cs.NI

The Towers Were Standing: A Cause Decomposition of Cellular Outages During Hurricane Helene

Hurricane Helene produced the largest absolute cell-site outage in the public FCC record, peaking at 4562 sites. The conventional model is physical: towers destroyed. Helene did destroy over 1700 miles of fibre, but almost none of it was cell sites. We present the first cause-decomposed study of the FCC's Disaster Information Reporting System, reconstructing 80 state-days and 580 county-days from 24 daily filings by two reconciled independent extractions. Damage to cell sites is negligible: 1.1% of attributed cell-site-days across six states, at most 3.8% anywhere. The sites were standing. What took them out divides by terrain: pooled, power dominates at 63.2%, but in mountainous North Carolina severed transport (backhaul) reaches 52.2% against 47.3%, and in Tennessee 69.9%. North Carolina's transport share rises from 7.0% to 85.0% across the event (\r{ho} = 0.92). Seventeen days after landfall, on 15 October, 47 sites lost transport across six contiguous North Carolina counties with no rainfall, no power loss, no damage, and recovery by the next report. Independent active-probe measurement corroborates it: responsive /24s fall 1.02% for twelve hours while Tennessee stays flat. We release the dataset. Backup power is the standard resilience investment; here it addresses the smaller half of the problem.

cs.NI

terms.txt: A Consent and Compensation Protocol for Agentic Web Access

The open web ran on an unwritten bargain: sites admitted crawlers, and search engines sent visitors back. Public measurements show that bargain breaking under AI crawlers and agents. Automated clients now make up most requests, training dominates Cloudflare-classified crawling, and the largest AI platforms fetch thousands of pages for each visitor they return. The web's common control, robots.txt, cannot express identity, purpose, terms, or price, can be circumvented, and newer alternatives are largely proprietary CDN features. We specify terms.txt, a robots.txt-style file for per-path, per-purpose machine-access terms, plus an origin-enforced exchange using Web Bot Auth signatures, signed intent, delegation tokens, HTTP 402 negotiation, and signed receipts. We define what the exchange can enforce, audit, and leave to contract. A dependency-free implementation adds 0.20 to 0.65 ms per request on one vCPU.

cs.NI