Distributed BS Transmit Power Control for Utility Maximization in Small-Cell Networks
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.
Bibliographic record
Abstract
최근 많은 수의 모바일 유저와 과도한 트래픽 증가를 해결하기 위한 솔루션으로 피코 혹은 펨토 셀과 같은 소형 셀을 설치하는 방법이 주목 받고 있다. 그러나 소형 셀에 속한 엣지 유저들은 주변 기지국으로부터 극심한 셀간 간섭을 받기 때문에 낮은 평균 전송률을 얻게 되고, 이를 해결하기 위해서는 셀 간 간섭을 효과적으로 관리하는 방법이 필요하다. 최근의 많은 연구들은 셀 간 간섭 관리를 위해 기지국의 전송 전력을 제어하는 알고리즘을 제시하였지만, 제시된 방법들은 높은 복잡도를 가지고 중앙 기지국의 도움을 필요로 한다는 단점이 있다. 본 연구에서는 기지국간의 경쟁을 기반으로 하여, 낮은 복잡도를 가지는 분산화된 방법의 기지국 전송 전력 on/off 제어 및 유저 스케줄링 알고리즘을 제안한다. 시뮬레이션 결과를 통해, 제안하는 방법이 셀 간 간섭 관리를 하지 않는 방법에 비해 셀 엣지 유저의 경우 170%의 성능 개선을 보이고, 최적의 알고리즘과 비교 했을 때 88-96%에 달하는 geometric average throughput (GAT) 성능 및 매우 근접한 average edge user throughput (AET) 성능을 보임을 검증한다. Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.003 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it