A Sub-Optimum Algorithm for Turning On/Off Co-Channel Access Points in Ultra-Dense Networks

A Sub-Optimum Algorithm for Turning On/Off Co-Channel Access Points in Ultra-Dense Networks | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL Engineering Reports This is a preprint and has not been peer reviewed. Data may be preliminary. 18 March 2025 V1 Latest version Share on A Sub-Optimum Algorithm for Turning On/Off Co-Channel Access Points in Ultra-Dense Networks Authors : Shahriar Shirvani Moghaddam 0000-0002-8427-2446 [email protected] , K. Shirvani Moghaddam , and E. Ashoor Authors Info & Affiliations https://doi.org/10.22541/au.174233000.06920481/v1 233 views 61 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract This paper proposes a sub-optimum Kuhn-Munkres-based resource allocation algorithm to maximize the number of connected links and total throughput served by ultra-dense networks consisting of densely distributed co-channel access points and user equipment. In the proposed seven-step algorithm, users are first assigned to access points supporting higher data rates considering the interference of all access points. Then, only the interference of the selected access points is considered and users connected to these access points that meet the minimum throughput threshold level are found. Afterward, considering the interference of the access points assigned in the first run and the remaining access points selected in the next runs, new users are connected to the remaining selected access points. Simulations in MATLAB for a service area of 250 meters by 250 meters including randomly distributed 250 access points and different numbers of 25 to 250 users, show more connected users and total throughput, and much less processing time of the proposed algorithm than those for Genetic, particle swarm optimization, cuckoo search, and grey wolf optimization algorithms. By changing the number of users from 10% to 100% of the number of access points, the proposed algorithm increases the number of connected users by 10% to 48%, 47% to 96%, 57% to 109%, and 22% to 58%, and the total throughput by 20% to 52%, 44% to 86%, 50% to 105%, and 22% to 69% compared to the four mentioned algorithms. Due to the lower complexity order, it experiences at least 99% less processing time. Supplementary Material File (engineering-reports-shirvani.docx) Download 963.25 KB File (engineering-reports-shirvani.pdf) Download 1.31 MB Information & Authors Information Version history V1 Version 1 18 March 2025 Copyright This work is licensed under a Non Exclusive No Reuse License. Collection Engineering Reports Keywords assignment algorithm genetic algorithm kuhn-munkres ultra dense network Authors Affiliations Shahriar Shirvani Moghaddam 0000-0002-8427-2446 [email protected] Shahid Rajaee Teacher Training University View all articles by this author K. Shirvani Moghaddam Iran University of Science and Technology View all articles by this author E. Ashoor Shahid Rajaee Teacher Training University View all articles by this author Metrics & Citations Metrics Article Usage 233 views 61 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Shahriar Shirvani Moghaddam, K. Shirvani Moghaddam, E. Ashoor. A Sub-Optimum Algorithm for Turning On/Off Co-Channel Access Points in Ultra-Dense Networks. Authorea . 18 March 2025. DOI: https://doi.org/10.22541/au.174233000.06920481/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.174233000.06920481/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9fe6207fdb68df94',t:'MTc3OTIyNTQzMQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();