Fuzzy Soft-Set Based Approach for Femto-Caching in Wireless Networks
Bibliographic record
Abstract
5G networks provide an interesting research challenge with the widespread use of Internet and the scale of mobile data traffic that grows explosively. The emerging need to bring data closer to users and minimizing the traffic off the macrocell base station (MBS) introduces the use of small, low power small base stations (SBS) with small cache space (termed femto caches, or more popularly, helpers). Helpers have low rate backhaul but high storage capacity that can be used to cache most popular files. When users request files that do not exist in helpers, then the files will be transmitted from MBS to helpers. The availability of the data in local cache can significantly improve performance since it overcomes the constraints in wireless environment. This leads to improving network throughput and reducing end-toend and backhaul delay. Caching the optimal contents into femto caches proactively depending on the knowledge about files popularity distribution is not enoughthe since Internet users have different context and different preferences. In this paper, we propose an algorithm for proactive caching based on fuzzy softset (FSS) approach for decision making. The algorithm decides which files to cache and where to cache them depending on file popularity distribution, file to user preferences, file clustering, and helpers to connected users clustering. The simulation results show significant overall cache hit rate increase with the increasing number of user requests. The algorithm can effectively improve system performance by reducing the delay for downloading the files and proactively cache those files which will improve user satisfaction.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".