MétaCan
Menu
Back to cohort
Record W2144076504 · doi:10.1109/icecs.2009.5410752

Trust management in opportunistic pervasive healthcare systems

2009· article· en· W2144076504 on OpenAlexaff
Mieso K. Denko, Isaac Woungang, Mohammad S. Obaidat

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsToronto Metropolitan UniversityUniversity of Guelph
Fundersnot available
KeywordsExploitComputer scienceUbiquitous computingTrust management (information system)Computer securityHealth careTrustworthinessWireless sensor networkData sharingWirelessComputer networkHuman–computer interactionTelecommunications

Abstract

fetched live from OpenAlex

Trust management has become a cornerstone for information security and privacy, to enable secure data sharing in pervasive healthcare systems. This paper proposes the use of the opportunistic networks (oppnets) paradigm as a solution for communication and data dissemination in such environment. Oppnet allows communication among nodes by opportunistically connecting devices without relying on any pre-existing routing paths. Based on this feature, we argue that our recently proposed trust management scheme for pervasive computing can be used in wireless network-based pervasive healthcare environments to efficiently detect malicious devices in addition to providing trust between devices, and to adequately exploit the recommendations from trustworthy devices. Using a distributed in-home pervasive healthcare application scenario, simulation experiments are conducted to assess the achievement of the stated goals.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.985
Threshold uncertainty score0.598

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.000
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.031
GPT teacher head0.263
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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations5
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207