SearcharxivSearch

arXiv · 1211.5157

To Relay or Not To Relay in Cognitive Radio Sensor Networks

Abstract

Recent works proposed the relaying at the MAC layer in cognitive radio networks whereby the primary packets are forwarded by the secondary node maintaining an extra queue devoted to the relaying function. However, relaying of primary packets may introduce delays on the secondary packets (called secondary delay) and require additional power budget in order to forward the primary packets that is especially crucial when the network is deployed using sensors with limited power resources. To this end, an admission control can be employed in order to manage efficiently the relaying in cognitive radio sensor networks. In this paper, we first analyse and formulate the secondary delay and the required power budget of the secondary sensor node in relation with the acceptance factor that indicates whether the primary packets are allowed to be forwarded or not. Having defined the above, we present the tradeoff between the secondary delay and the required power budget when the acceptance factor is adapted. In the sequel, we formulate an optimization problem to minimize the secondary delay over the admission control parameter subject to a limit on the required power budget plus the constraints related to the stabilities of the individual queues due to their interdependencies observed by the analysis. The solution of this problem is provided using iterative decomposition methods i.e. dual and primal decompositions using Lagrange multipliers that simplifies the original complicated problem resulting in a final equivalent dual problem that includes the initial Karush Kuhn Tucker conditions. Using the derived equivalent dual problem, we obtain the optimal acceptance factor while in addition we highlight the possibilities for extra delay minimization that is provided by relaxing the initial constraints through changing the values of the Lagrange multipliers.

Explore related subjects

Keep this discovery

BibTeXRIS

Fotis Foukalas, Tamer Khattab. 2012-11-21. To Relay or Not To Relay in Cognitive Radio Sensor Networks. https://arxiv.org/abs/1211.5157

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