MétaCan
Menu
Back to cohort
Record W2100068443 · doi:10.1109/wd.2008.4812860

A distributed trust and reputation model for capacity enhancement in wireless networks

2008· preprint· en· W2100068443 on OpenAlexaff
Gilbert Sawma, Jacques Demerjian, Issam Aibz, Guy Pujolle

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceReputationTrust management (information system)Computer networkBlocking (statistics)Voice over IPWireless networkWirelessComputer securityTelecommunicationsThe Internet

Abstract

fetched live from OpenAlex

In order to enhance resource allocation in wireless local area networks, it is important to properly distribute the load from the overloaded Access Points (APs) over their neighbors. Nevertheless, malicious APs may strategically alter their behavior for concealing malicious behavior and prompting their reputation. Therefore, it is important to evaluate APs' trustworthiness. In this paper, we propose a trusted model based on an Autonomic Load Management Algorithm (ALMA) that ensure the accommodation of more user traffic and an overall network capacity improvement, by evaluating and detecting the malicious APs. Initially each APs is assigned a trust level. Using these trust levels as a guide, the source AP can then select a neighbor AP that meets the security requirements. Simulations, using VoIP traffic, show that, the performance gain in term of call blocking rate is improved by using the trust-based approach.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.886
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.043
GPT teacher head0.275
Teacher spread0.232 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations3
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207