Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2012.00850

Opportunistic Routing Metrics: A Timely One-Stop Tutorial Survey

Mostafa Abdollahi·Farshad Eshghi·Manoochehr Kelarestaghi·Mozafar Bag-Mohammadi
View original source ↗Read source document ↗Export metadata ↓

Abstract

High-speed, low latency, and heterogeneity features of 5G, as the common denominator of many emerging and classic wireless applications, have put wireless technology back in the spotlight. Continuous connectivity requirement in low-power and wide-reach networks underlines the need for more efficient routing over scarce wireless resources, in multi-hp scenarios. In this regard, Opportunistic Routing (OR), which utilizes the broadcast nature of wireless media to provide transmission cooperation amongst a selected number of overhearing nodes, has become more promising than ever. Crucial to the overall network performance, which nodes to participate and where they stand on the transmission-priority hierarchy, are decided by user-defined OR metrics embedded in OR protocols. Therefore, the task of choosing or designing an appropriate OR metric is a critical one. The numerousness, proprietary notations, and the objective variousness of OR metrics can cause the interested researcher to lose insight and become overwhelmed, making the metric selection or design effort-intensive. While there are not any comprehensive OR metrics surveys in the literature, those who partially address the subject are non-exhaustive and lacking in detail. Furthermore, they offer limited insight regarding related taxonomy and future research recommendations. In this paper, starting with a custom tutorial with a new look to OR and OR metrics, we devise a new framework for OR metric design. Introducing a new taxonomy enables us to take a structured, investigative, and comparative approach to OR metrics, supported by extensive simulations. Exhaustive coverage of OR metrics, formulated in a unified notation, is presented with sufficient details. Self-explanatory, easy-to-grasp, and visual-friendly quick references are provided, which can be used independently from the rest of the paper.

Explore related subjects

cs.NI

Keep this discovery

BibTeXRIS

Mostafa Abdollahi, Farshad Eshghi, Manoochehr Kelarestaghi, Mozafar Bag-Mohammadi. 2020-12-01. Opportunistic Routing Metrics: A Timely One-Stop Tutorial Survey. https://arxiv.org/abs/2012.00850

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗