• HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
Thursday, November 19, 2026
BIOENGINEER.ORG
No Result
View All Result
  • Login
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
No Result
View All Result
Bioengineer.org
No Result
View All Result
Home NEWS Science News Technology

Fuzzy Logic Caching Scheme Boosts Data Availability in Simulated Vehicular Networks

by
November 19, 2026
in Technology
Reading Time: 6 mins read
0
Fuzzy Logic Caching Scheme Boosts Data Availability in Simulated Vehicular Networks

Fuzzy Logic Caching Scheme Boosts Data Availability in Simulated Vehicular Networks

Share on FacebookShare on TwitterShare on LinkedinShare on RedditShare on Telegram

Computer science researchers have developed an intelligent data caching and replacement mechanism driven by fuzzy logic to improve communication efficiency and information availability across vehicular ad hoc networks. In highly dynamic driving environments, adjacent vehicles communicate wirelessly with one another and with fixed roadside infrastructure, but rapid network topology changes, transient connectivity, and variable traffic density routinely cause data access delays and severe server congestion. Rather than relying on centralized control points or roadside units to manage data dissemination, the newly designed framework enables individual vehicles to autonomously evaluate incoming content and preserve essential information locally. Across simulation experiments executed in MATLAB software, the proposed dual-level fuzzy decision strategy successfully increased the overall cache hit rate by 15 percent while reducing average query delay by 23 percent compared with benchmark schemes.

Vehicular ad hoc networks, commonly known as VANETs, represent a specialized subset of mobile ad hoc networks in which moving automobiles act as autonomous communication nodes without requiring central network controllers. While conventional wired networks offer stable transmission pathways, vehicular networks must continuously contend with frequent network fragmentation, bandwidth constraints, and unpredictable link disconnections caused by high vehicle speeds. The high volume of real-time telemetry, accident warnings, traffic management signals, and urban surveillance feeds generated in modern smart transportation systems risks overwhelming roadside infrastructure units if every single information request is routed directly to centralized servers. Localized data caching, defined as the structured process of replicating and locating content in on-board vehicle memories for rapid future retrieval, provides a viable solution to alleviate bottlenecking by allowing nearby automobiles to cooperatively share relevant data packets directly over vehicle-to-vehicle links.

Despite the recognized performance advantages of client-side content storage, managing limited vehicle memory caches in highly volatile mobile environments introduces challenging algorithmic trade-offs. Traditional cache replacement policies, such as Least Recently Used or Most Recently Used strategies, rely primarily on access recency and fail to capture the multi-dimensional context of vehicular communication. Moreover, widespread caching protocols often fall into extremes, ranging from pervasive caching that rapidly floods local storage to restrictive policies that discard unrequested broadcast information entirely. To resolve these operational limitations, the research team structured their caching framework to operate in pure vehicle-to-vehicle environments without relying on roadside units, ensuring that automobiles can cooperatively access and exchange critical roadside alerts and environmental telemetry even across remote highways, rural corridors, or disaster zones where fixed infrastructure has sustained severe damage.

The core computational engine of the proposed scheme relies on a Mamdani-style fuzzy inference system that maps non-fuzzy, crisp operational parameters into linguistic classifications to guide storage decisions under conditions of high network uncertainty. In the data storage phase, when an intermediate vehicle receives an information packet that it did not explicitly generate, the system processes three distinct crisp inputs: the total number of vehicle requests recorded for that specific data item, the topological importance of the recipient vehicle, and the network-wide ratio of data item repetitions relative to the total vehicle population. The recipient vehicle’s topological centrality is derived by combining its degree centrality, defined by the number of direct one-step neighbor contacts, with its intermediate betweenness centrality, calculated through the zero entries in its local adjacency matrix. These three parameters are mapped across triangular and trapezoidal membership functions into low and high linguistic terms, which are subsequently evaluated using an eight-rule fuzzy rule base to determine whether content should be kept locally, forwarded to a neighboring node, or recorded as a routing path.

Once the storage evaluation concludes through rule evaluation using the standard Max-Min composition operator, the resulting fuzzy set is transformed back into an actionable crisp numerical decision value using center of gravity defuzzification. Depending on where the final defuzzified score lands across predefined continuous numerical boundaries, the vehicle executes one of three cooperative caching operations. If the crisp output falls within the lowest range between zero and one, the vehicle stores only the network path identifiers associated with the transmitting node in its dedicated data item path reserve cache, conserving local memory while preserving directional reachability. If the output falls between one and two, the vehicle randomly selects an adjacent one-step neighbor node and transmits the packet to that neighbor for external storage. Finally, if the defuzzified value falls within the upper range between two and three, the vehicle commits to storing the data item directly within its own local hardware cache.

Because vehicle on-board units possess finite physical memory capacity, committing a newly arrived data packet to local storage when cache memory is completely exhausted requires an adaptive, context-sensitive data replacement policy. Under the proposed fuzzy replacement mechanism, the vehicle evaluates four multi-dimensional attributes for every stored data item as well as the newly incoming candidate packet: the local reference frequency indicating how often the hosting vehicle itself accesses the item, the remote reference frequency representing overall popularity among neighboring vehicular nodes, the physical data size in memory, and the local usage recency ratio. This recency ratio specifically calculates the precise mathematical quotient between the time elapsed since the item’s last local access and its overall assigned Time To Live duration. To ensure operational accuracy in rapidly evolving traffic flows, these replacement metrics are dynamically computed in real time at the exact moment a cache replacement decision is triggered, rather than gathered through stale cumulative historical averages.

To arbitrate eviction decisions among competing cached files, the fuzzy replacement subsystem processes these four input parameters through sixteen dedicated fuzzy inference rules combined via the Max-Min method and defuzzified through the center of gravity technique to assign an overarching importance score. Under this prioritized ranking logic, items that exhibit high remote popularity across neighboring nodes, extensive local usage recency ratios, and larger storage sizes are assigned lower importance values and prioritized for removal, since larger files free up more storage capacity while highly popular items already exist in adjacent vehicle memories without degrading regional content accessibility. Rather than abruptly purging the lowest-ranked cached item, the hosting vehicle first attempts to offload it to a randomly selected neighboring vehicle. If this offloading transmission succeeds, the original node deletes the item from memory; if offloading cannot be achieved, the node records the forwarding path in its path memory before evicting the data payload to accommodate the higher-priority packet.

Computational complexity analysis conducted by the authors confirms that the dual-level caching architecture maintains high algorithmic efficiency and horizontal scalability across dense vehicular deployments. Because the fuzzy storage stage operates over a fixed rule base containing exactly eight rules and a constant number of input membership functions, its fuzzification, rule evaluation, and defuzzification overhead remains strictly bounded at constant O(1) time complexity per incoming data packet. During cache replacement, identifying the item with the lowest computed importance score across a full cache of capacity C requires scanning stored entries, resulting in a linear worst-case time complexity of O(C), while non-full caches resolve in constant O(1) best-case time. Because each vehicle executes its caching and replacement routines completely independently using locally observed one-step neighborhood metrics rather than global topology tables, the overall computational overhead does not expand with increasing vehicular density across the wider transportation network.

To evaluate the empirical performance of the fuzzy logic caching strategy, the researchers conducted detailed numerical simulations using MATLAB software version R2012a on a 64-bit operating system equipped with an Intel Core i3 2.40 GHz processor and 4.00 gigabytes of installed memory. The performance of the fuzzy framework was systematically benchmarked against two widely referenced cooperative caching strategies: Peer-to-peer Cooperative Caching, which uses Markov chain models to share traffic content between peers and relies on roadside units for centralized fallback, and Distributed Probabilistic Caching, which makes independent storage choices based on probabilistic user demand and node mobility. Simulation runs evaluated cache hit rates and query access delays across variable cache capacities ranging from 1 to 8 megabytes with a fixed 50-minute data lifetime, as well as across varying data lifetimes ranging from 10 to 80 minutes with a fixed 4-megabyte cache capacity, repeating each scenario five times across random movement models to derive stable averaged metrics.

The resulting performance curves demonstrated that the fuzzy logic caching method consistently outperformed both comparative baselines under simulated conditions. Across all cache sizes, increasing physical storage space raised the cache hit rate for all three protocols, but the proposed method maintained a definitive advantage because its multi-parameter fuzzy rules intelligently preserved high-value packets while archiving alternative reachability paths instead of discarding data outright. Distributed Probabilistic Caching exhibited the lowest hit rates due to its lack of a comprehensive replacement scheme, whereas Peer-to-peer Cooperative Caching achieved competitive query delays primarily because unresolved requests could fall back directly on roadside infrastructure. Even without roadside units, the proposed fuzzy mechanism matched or surpassed the latency performance of infrastructure-backed caching by distributing valuable data items to highly central vehicles, ensuring swift peer-to-peer retrieval.

In evaluating the broader applicability of the findings, the researchers highlighted several explicit structural assumptions that defined their experimental baseline. The simulation framework deliberately modeled a pure vehicle-to-vehicle environment devoid of roadside infrastructure units to rigorously test cooperative peer-to-peer data exchange under infrastructure-less conditions. Additionally, data items were treated as static information payloads that did not undergo dynamic modifications during simulation runs, setting aside the complex synchronization requirements of distributed cache consistency protocols. The mobility of vehicular nodes was represented using a random mobility model to establish a challenging test environment characterized by high link volatility, rather than using constrained, road-bound vehicular traffic simulations. Future research efforts will focus on integrating fuzzy logic with neural network architectures, incorporating dynamic data update sustainability models, and validating cache replacement behaviors across realistic multi-lane vehicular mobility traces.

Subject of Research: Fuzzy logic cooperative caching and replacement in vehicular ad hoc networks

Article Title: Improving Data Availability in Vehicular Ad Hoc Networks Using Fuzzy Logic Caching

Article References: Derakhshanfard, N., Soltani, R., Pour Haji Kazem, A. A., Dadashkhani, N., Farahi, R., & Mirazei, A. (2026). Improving Data Availability in Vehicular Ad Hoc Networks Using Fuzzy Logic Caching. International Journal of Networked and Distributed Computing, 14(1), Article 15. https://doi.org/10.1007/s44227-026-00094-3

Image Credits: AI Generated

DOI: 10.1007/s44227-026-00094-3

Keywords: vehicular ad hoc networks, cooperative caching, fuzzy logic, cache replacement, cache hit rate, query delay, vehicle-to-vehicle communication, Mamdani fuzzy inference, network availability, defuzzification, degree centrality, betweenness centrality, time to live, data dissemination, computational complexity, MATLAB simulation, mobile ad hoc networks

News Source: Denise Maddox. (November 19, 2026). Fuzzy Logic Caching Scheme Boosts Data Availability in Simulated Vehicular Networks. Scienmag.

Tags: betweenness centralitycache hit ratecache replacementcomputational complexitycooperative cachingdata disseminationdefuzzificationdegree centralityfuzzy logicMamdani fuzzy inferenceMATLAB simulationmobile ad hoc networksnetwork availabilityquery delaytime to livevehicle-to-vehicle communicationvehicular ad hoc networks
Share12Tweet7Share2ShareShareShare1

Related Posts

Semi-Analytical Model Resolves Non-Axisymmetric Indentation Stresses in Brittle Materials

Semi-Analytical Model Resolves Non-Axisymmetric Indentation Stresses in Brittle Materials

November 19, 2026
Federated Learning and Blockchain Framework Detects Lung Cancer in Hospital Scans

Federated Learning and Blockchain Framework Detects Lung Cancer in Hospital Scans

November 19, 2026

Ionic Liquid Enhances Conductivity and Voltage Window in Sodium Gel Electrolytes

November 19, 2026

Dual-Stream Architecture Unifies Consistency and Discrepancy for Audio-Visual Emotion Recognition

November 19, 2026

POPULAR NEWS

  • No Metabolic Crises Occurred With Peripartum Dextrose in Small Observational Study

    No Metabolic Crises Occurred With Peripartum Dextrose in Small Observational Study

    29 shares
    Share 12 Tweet 7
  • Mental Health Emergency Visits in Saudi Arabia Surge During Late Autumn and Winter

    29 shares
    Share 12 Tweet 7
  • Rare APBA1 Genetic Variants Identified in Children with Severe Monogenic Obesity

    29 shares
    Share 12 Tweet 7
  • RNA Thermometer Controls Recombinant Protein Expression in Engineered Escherichia Coli Cultures

    29 shares
    Share 12 Tweet 7

About

We bring you the latest biotechnology news from best research centers and universities around the world. Check our website.

Follow us

Recent News

No Metabolic Crises Occurred With Peripartum Dextrose in Small Observational Study

Mental Health Emergency Visits in Saudi Arabia Surge During Late Autumn and Winter

Rare APBA1 Genetic Variants Identified in Children with Severe Monogenic Obesity

Subscribe to Blog via Email

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 89 other subscribers
  • Contact Us

Bioengineer.org © Copyright 2023 All Rights Reserved.

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • Homepages
    • Home Page 1
    • Home Page 2
  • News
  • National
  • Business
  • Health
  • Lifestyle
  • Science

Bioengineer.org © Copyright 2023 All Rights Reserved.