MétaCan
Menu
Back to cohort
Record W1977865278 · doi:10.1109/tcomm.2014.2315612

Understanding the Benefits of Successive Interference Cancellation in Multi-Rate Multi-Hop Wireless Networks

2014· article· en· W1977865278 on OpenAlexaff
Long Qu, Jiaming He, Chadi Assi

Bibliographic record

VenueIEEE Transactions on Communications · 2014
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceSingle antenna interference cancellationScheduling (production processes)Wireless networkComputer networkNetwork performanceGreedy algorithmNetwork topologyTransmission (telecommunications)Computational complexity theoryWirelessDistributed computingMathematical optimizationChannel (broadcasting)AlgorithmMathematicsTelecommunications

Abstract

fetched live from OpenAlex

The performance of wireless multihop networks depends on the achievable channel capacity for each transmission link as well as the level of spectrum spatial reuse in the network. For the latter one, successive interference cancellation (SIC) has emerged as an advanced PHY technique with the ability of decoding two or more overlapping signals and therefore allowing multiple concurrent transmissions. Effectively managing the transmission concurrency over the shared medium ensures good quality of transmission and therefore results in higher achievable transmission data rates. In this paper, we seek to understand the benefits of SIC and its interference management capabilities in a multi-rate multihop wireless network. To characterize the network performance under these characteristics, we follow a cross-layer design approach and formulate the joint routing and scheduling problem with rate control as a mixed integer linear program with the objective to maximize the minimum flow throughput. Given its large scale and combinatorial complexity, we follow a decomposition approach using column generation to solve the problem. However, the complexity of solving exactly the pricing subproblem limits the application of the model to very small size network instances. We develop one efficient greedy method for solving exactly the pricing subproblem as well as a simulated annealing based heuristic approach with very good performance. Our results indicate that SIC benefits strongly depend on the strength of the received signals. We show that transmission links with fixed higher data rates do not necessarily yield higher SIC gains because higher transmission rates result in sparser network topologies and thus less flexible routing. Larger networks with SIC capabilities and bitrate adaptation however are most effective in controlling the interference and improving the spatial reuse and thus reap the largest benefits with gains exceeding 20% over networks only with SIC capabilities or only with rate control.

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.002
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.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
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.178
GPT teacher head0.320
Teacher spread0.143 · 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

Citations27
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207