{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/ue-throughput-guaranteed-small-cell-on-off","title":"UE throughput guaranteed small cell on /off algorithm with machine learning","arxiv_id":null,"date":"2020-06-03","proceeding":null,"authors":["Tae-yoon park","jong-won Han and een -kee hong"],"abstract":"Abstract:Ultra-dense network (UDN) has been considered a promising solution to improve the signal quality of cell edge UEs and enhance the serving coverage. However, a large number of small cells causes severe inter-cell interference and high energy consumption, and efficient small cell management is an important issue. In this paper, a UE throughput guaranteed small cell on/off algorithm in UDN environment is proposed to solve the problem of UE throughput reduction due to small cell off process. The proposed small cell on/off algorithm with machine learning is executed by the following processes: First, the network attributes that affect UE throughput are analyzed. Second, the correlation between UE throughput and network attributes is evaluated through multiple linear regression analysis. Third, through understanding the correlation between UE throughput and network attributes, we determine the proper criteria for small cell on/off process. Simulation results show that the proposed small cell on/off algorithm can improve the total network energy efficiency as well as efficiently ensure sufficient UE throughput. Compare to the conventional algorithm, the proposed algorithm shows more than 75% improvements of average network energy efficiency. whole network.View less","url_abs":"https://ieeexplore.ieee.org/document/9143574","url_pdf":"https://doi.org/10.1109/JCN.2020.000020","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"ue-throughput-guaranteed-small-cell-on-off","repo_url":"https://github.com/MindSpore-scientific/code-1/tree/main/UE-Unified-Embedding-Battle-Tested-Feature","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"ue-throughput-guaranteed-small-cell-on-off","repo_url":"https://github.com/MindSpore-scientific/code-10/tree/main/UE-Unified-Embedding-Battle-Tested-Feature","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"management","task_name":"Management"}],"methods":[{"method_slug":"linear-regression","method_name":"Linear Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"MindSpore-scientific/code-1","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.12624"],"harvested_for_calls":[{"arxiv_id":"2210.12624","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.12624"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.12624\")"}]},{"repo":"MindSpore-scientific/code-10","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2412.20404"],"harvested_for_calls":[{"arxiv_id":"2412.20404","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2412.20404"},"call":"get_harvested_code_for_paper(arxiv_id=\"2412.20404\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8e41670f62eac80c033f77ccbc80d95c43b550d56b257ec7d6afd7b477fd85fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}