MétaCan
Menu
Back to cohort
Record W2164768240 · doi:10.1109/sahcn.2011.5984880

OppSense: Information sharing for mobile phones in sensing field with data repositories

2011· article· en· W2164768240 on OpenAlexaff
Edith C.‐H. Ngai, He Huang, Jiangchuan Liu, Mani Srivastava

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsSimon Fraser University
FundersVINNOVA
KeywordsComputer scienceData exchangeOverhead (engineering)Information exchangeSoftware deploymentMobile phoneMobile deviceWirelessKey (lock)Mobile computingComputer networkField (mathematics)Distributed computingDatabaseComputer securityWorld Wide WebTelecommunicationsOperating system

Abstract

fetched live from OpenAlex

With the popularity and advancements of smart phones, mobile users can interact with the sensing facilities and exchange information with other wireless devices in the environment by short range communications. Opportunistic exchange has recently been suggested in similar contexts; yet we show strong evidence that, in our application, opportunistic exchange would lead to insufficient data availability and extremely high communication overheads due to inadequate or excessive human contacts in the environment. In this paper, we present OppSense, a novel design to provide efficient opportunistic information exchange for mobile phone users in sensing field with data repositories that tackles the fundamental availability and overhead issues. Our design differs from conventional opportunistic information exchange in that it can provide mobile phone users guaranteed opportunities for information exchange regardless the number of users and contacts in different environments. Through both analysis and simulations, we show that the deployment of data repositories plays a key role in the overall system optimization. We demonstrate that the placement of data repositories is equivalent to a connected K-coverage problem, and an elegant heuristic solution considering the mobility of users exists. We evaluate our proposed framework and algorithm with real mobile traces. Extensive simulations demonstrate that data repositories can effectively enhance the data availability up to 41% in low contact environment and significantly reduce the communication overheads to only 28% compared to opportunistic information exchange in high contact environment.

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: Methods · Consensus signal: none
Teacher disagreement score0.995
Threshold uncertainty score0.236

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.002
Open science0.0000.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.060
GPT teacher head0.255
Teacher spread0.194 · 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
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

Citations14
Published2011
Admission routes1
Has abstractyes

Explore more

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