SearcharxivSearch

arXiv · 1310.1552

Cache Discovery Policies of MANET

Abstract

In situations where establishing a network infrastructure is impossible, Ad-hoc networks are considered particularly important. Most of the previous research in Ad-hoc networks concentrated on the development and enhancement of dynamic routing protocols, which could efficiently discover routes between two communicating nodes. Although routing strategies is an important topic in MANETs, other topics such as data access are also crucial since the final goal of using Ad-hoc networks is to provide data access to mobile nodes. One of the most attractive techniques used to improve the data access performance in MANET environment is cooperative caching; which means multiple caching nodes share and cooperatively manage the cached contents. It is lead the research to important questions, what data should be cached, where, when, and how? A cooperative caching addressed into two basic issues: cache discovery and cache management, in other words, how to find requested data efficiently and how to manage an individual cache to improve the overall capacity of a cooperated cache. In this paper we have made a review of the existing cache discovery algorithms to address four stages after application request and before server response, using an historical file to record the previous data requests, and proposed cluster architecture with data cluster head election to store efficient information for future use and reducing the cost of flooding. In addition, this paper suggests some alternative techniques for cache discovery. Finally, the paper concludes with a discussion on future research directions.

Explore related subjects

Keep this discovery

BibTeXRIS

Amer O. Abu Salem, Tareq Alhmiedat, Ghassan Samara. 2013-10-06. Cache Discovery Policies of MANET. https://arxiv.org/abs/1310.1552

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