MétaCan
Menu
Back to cohort

Performance analysis of large scale RF-mesh networks for smart cities and IoT

2017· article· en· W2798494602 on OpenAlexafffund
Filippo Malandra, Brunilde Sansò

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsPolytechnique Montréal
FundersFederation for the Humanities and Social Sciences
KeywordsComputer scienceWireless mesh networkScalabilityMesh networkingComputer networkRetransmissionDistributed computingNetwork topologyContext (archaeology)Smart citySmart gridSwitched meshThroughputWireless networkWirelessInternet of ThingsTelecommunicationsEmbedded systemDatabaseEngineering

Abstract

fetched live from OpenAlex

Smart Cities, IoT and Smart Grid development needs solid and steady communication infrastructures to support the diversity and high number of applications. RF-mesh is one of the most popular wireless technology in those context since it allows to connect a large number of nodes in a mesh topology. To study the suitability of a network infrastructure for the applications requirement, network performance analysis is needed. This paper proposes a novel Markov-modulated model for the performance analysis of large scale RF-mesh networks for smart cities applications. The instances are build using Geographical Information System (GIS) data in order to maintain fitness to actually implemented RF-Mesh systems. The model is characterized by a high scalability (e.g., thousands of nodes) and a limited computational time (i.e., in the order of some minutes). The model also takes into account implementation details, such as retransmission probability, buffer size and a precise wireless interference analysis, which are not thoroughly considered in previous RF-Mesh performance literature.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.013
GPT teacher head0.248
Teacher spread0.235 · 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 source (direct Gemma or distilled Codex), 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

Citations7
Published2017
Admission routes2
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207