Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.01404

Trust-Based Winnow Linear Multiplicative Classification For Secure Multipath Routing In Manet

A. S. Narmadha
View original source ↗Read source document ↗Export metadata ↓

Abstract

Multipath routing in Mobile Ad Hoc Network (MANET) plays a significant concern for secured data transmission by avoiding the attack nodes in the network. In order to overcome such limitations, a Winnow Trust based Multipath Route Discovery (WT-MRD) Mechanism is proposed. It constructs multiple paths from source to destination with higher security and lesser time. Initially, the trust value of each node is calculated based on the node cooperative count, data packet forwarding rate and packet drop rate by Neighbor Node-based Trust Calculation (NN-TC) Model. After calculating the trust value, the nodes are classified as normal or malicious by using Winnow Linear Multiplicative Classification (WLMC) Algorithm. With the help of normal nodes, the WT-MRD Mechanism finds multipath from source to destination by sending a two control message RREQ and RREP. Source node transmits a route request RREQ to the neighboring node for constructing the multiple route paths. After receiving the RREQ message, the neighboring node maintains the route table where the source information and next hop information are present. Then Route Reply (RREP) messages are sent from neighboring node to source node. By this way, multiple route paths from source to destination are constructed with a higher security level. Keywords: Cooperative Count, Data Packet Dropped Rate, Data Packet Forwarded Rate, Multipath Routing, Security, Trust Value, Winnow Linear Multiplicative Classification

Explore related subjects

cs.NI

Keep this discovery

BibTeXRIS

A. S. Narmadha. 2020-06-02. Trust-Based Winnow Linear Multiplicative Classification For Secure Multipath Routing In Manet. https://arxiv.org/abs/2006.01404

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↗