MétaCan
Menu
Back to cohort
Record W2168673745 · doi:10.1109/tsp.2010.2077631

Sidelobe Control in Collaborative Beamforming via Node Selection

2010· article· en· W2168673745 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2010
Typearticle
Languageen
FieldEngineering
TopicAdvanced MIMO Systems Optimization
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsBeamformingSelection (genetic algorithm)Computer scienceNode (physics)Speech recognitionArtificial intelligenceTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network by radiating the power from a cluster of sensor nodes in the directions of the intended base stations or access points (BSs/APs). The CB average beampattern shows a deterministic behavior and the mainlobe of the CB sample beampattern is independent of the particular node locations. However, the CB for a cluster of a finite number of collaborative nodes results in a sample beampattern with sidelobes that severely depend on the particular node locations. High level sidelobes can cause unacceptable interference when they occur at directions of unintended BSs/APs. Therefore, sidelobe control in CB has a potential to decrease the interference at unintended BSs/APs and increase the network transmission rate by enabling simultaneous multilink CB. Traditional sidelobe control techniques are proposed for centralized antenna arrays and are not suitable for WSNs. In this paper, we show that scalable and low-complexity sidelobe control techniques suitable for CB in WSNs can be developed based on a node selection technique which makes use of the randomness of the node locations. A node selection algorithm with low-rate feedback is developed to search over different node combinations. The performance of the proposed algorithm is analyzed in terms of the average number of search trials required for selecting the collaborative nodes, the resulting interference, and the corresponding transmission rate improvements. Our simulation results show that the interference can be significantly reduced and the transmission rate can be significantly increased when node selection is implemented with CB. The simulation results also show close agreement with our theoretical results.

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.

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

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.001
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.005
GPT teacher head0.223
Teacher spread0.218 · 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