Resource allocation strategies in cognitive radio D2D communication networks
Bibliographic record
Abstract
Device-to-device (D2D) communication is developed as a new paradigm to enhance net- work performance according to LTE and WiMAX advanced standards. On the other hand, cognitive radio (CR) approach provides efficient spectral usage using intelligent wireless nodes. In this thesis, a number of optimal resource allocation strategies for D2D communi- cation networks are investigated using the CR approach. As a first step, the CR approach in radio access networks is introduced. In the second step, the taxonomy of the RA process in CRNs is provided. For radio resource allocation (RRA), the most crucial task is to associate a user with a particular serving base station, to assign the channel and to allocate the power efficiently. In this thesis, a subcarrier assignment scheme and a power allocation algorithm using geometric water-filling (GWF) is presented for orthogonal frequency division multiplexing (OFDM) based CRNs. This algorithm is proved to maximize the sum rate of secondary users by allocating power more efficiently. Then, the RA problem is studied to jointly employ CR technology and D2D communication in cellular networks in terms of spectral efficiency (SE) and energy efficiency (EE). In the first case, in terms of SE, a two-stage approach is considered to allocate the radio resource efficiently where a new adaptive subcarrier allocation (ASA) scheme is designed first and then a novel power allocation (PA) scheme is developed utilizing proven GWF approach that can compute exact solution with less computation. In the second case, in terms of EE, the power allocation problem of cellular networks that co-exist with D2D communication considering both underlay and overlay CR approaches are investigated. A proven power allocation algorithm based on GWF approach is utilized to solve the EE maximization problem which results in an “exact" and “low complexity" solution.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".