MétaCan
Menu
Back to cohort
Record W2146863854 · doi:10.1109/glocom.2010.5683588

Favorable Peer Supported Throughput Optimization in Wireless Mesh Network

2010· article· en· W2146863854 on OpenAlexaff
Mohammad Zulhasnine, Changcheng Huang, Anand Srinivasan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsEion (Canada)Carleton University
Fundersnot available
KeywordsComputer sciencePeer-to-peerComputer networkThroughputWireless mesh networkDistributed computingBandwidth (computing)WirelessWireless networkMaximum throughput schedulingSelection (genetic algorithm)Interference (communication)Channel (broadcasting)TelecommunicationsQuality of service

Abstract

fetched live from OpenAlex

Peer selection strategy is one of the major challenges towards efficient peer-to-peer (P2P) system in wireless mesh networks (WMNs). When peers choose their own utility-maximizing strategies for coalition and peer formation, the solution is always sub-optimal. Peer formation, based on only application layer information, also results in inefficient use of network bandwidth. When multiple recipient-peers try to access the same file from same source-peer simultaneously, contention may occur on the shared wireless channel. On the discovery of multiple source-peers, corresponding recipient-peer may choose optimal source-peer in favor of increased network throughput. Here, we propose a novel optimization method to calculate the upper bound of the aggregate throughput for P2P over WMNs utilizing the underlying physical network information and optimal peer selection strategy. The results show that our favorable-peer selection strategy, results in higher aggregate throughput by selecting optimum source-peers with better load distribution and minimum interference.

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.001
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.767
Threshold uncertainty score0.621

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
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.010
GPT teacher head0.234
Teacher spread0.224 · 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

Citations3
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207