MétaCan
Menu
← Back to cohort
Record W2991346935 · doi:10.1145/3345860.3361516

Minkowski Distance Order Effect on the Optimization of Key Devices Positions in Large-Scale RF Mesh Networks

2019· article· en· W2991346935 on OpenAlexafffund
Ahmad Mohamad Mezher, Pedro Enrique Iturria-Rivera, Carlos Lester Dueñas Santos, Julián Cárdenas-Barrera, Julian Meng, Eduardo Castillo-Guerra

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of New Brunswick
FundersAtlantic Canada Opportunities Agency
KeywordsComputer scienceNetwork packetRouting (electronic design automation)Context (archaeology)Minkowski spaceEuclidean distanceComputer networkQuality of serviceMesh networkingRouting protocolKey (lock)WirelessMathematicsTelecommunications

Abstract

fetched live from OpenAlex

Recently, smart grid communications have attracted much attention from the research community. An excellent performance of a RF Mesh network in terms of quality of service parameters depends not only on having an efficient routing protocol to route packets but also on the positions of routers and collectors located in the same network. This makes the positioning of routers and collectors in RF Mesh networks a challenging task. Moreover, an efficient strategy to optimize jointly routers and collectors positions have been proposed recently by us. However, in this work, we have studied the impact of using different Minkowski distance order on the proposed strategy in a RF Mesh context. Extensive simulations in OMNET++ have been carried out with the proposed strategy for different Minkowski distance order. Results indicate that the Euclidean distance is the best Minkowski distance order choice to obtain the best results in terms of average percentage of packet delivery rate and average end-to-end delay.

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.004
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.001
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.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.011
GPT teacher head0.250
Teacher spread0.239 · 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

Citations0
Published2019
Admission routes2
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→