Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks

preprint OA: closed
Full text JSON View at publisher
Full text 11,504 characters · extracted from preprint-html · click to expand
Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks Changping Song, Jun Tao, Yu Gao, Yifan Xu, Weice Sun, Haotian Wang This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4105847/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract In this paper, we consider a Device-to-Device (D2D)-assisted Mobile Edge Computing (MEC) system in which the edge server collaboratively performs tasks with users who possess mobile characteristics. The computational resources of the edge server and the users are limited. Our objective is to minimize latency and energy consumption while maximizing system stability by determining the offloading decisions for all tasks. However, solving this problem is particularly challenging due to the coupling between offloading decisions and user mobility characteristics. To address this challenge, a Particle Swarm Optimization (PSO) algorithm based on Latin Hypercube Sampling (LHS) is proposed. PSO can be employed for iterative computation to obtain the optimal solution by treating the offloading decisions for all tasks as particles. Furthermore, employing LHS for the initialization and updating of the particle swarm can significantly enhance the performance and convergence of the PSO. Simulation results indicate that our proposed algorithm outperforms other algorithms significantly in terms of latency, energy consumption, and system stability while also exhibiting excellent robustness. Task offloading D2D Mobile edge computing Particle swarm optimization Full Text Additional Declarations No competing interests reported. Supplementary Files ParticleSwarmOptimizationwithLatinHypercubeSamplingforMobilityAwareTaskOffloadinginD2DAssistedMECNetworks.rar Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4105847","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":288112709,"identity":"148f53af-5f7a-48ea-b70d-394680f878f7","order_by":0,"name":"Changping Song","email":"","orcid":"","institution":"Southeast University","correspondingAuthor":false,"prefix":"","firstName":"Changping","middleName":"","lastName":"Song","suffix":""},{"id":288112710,"identity":"c3af76dc-91c3-42a9-919d-3f1b826847a5","order_by":1,"name":"Jun Tao","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAwElEQVRIiWNgGAWjYBACxgYwZQPh8RCpBaQrjQQtUIsOk6CFeUbu8Qc/Ks7b80skMD5428Ygb07Qihl5iY09Z24nzpyRwGw4t43BcGcDQS05hg28bbcTDG4ksEnztjEkGBwgQkvj37Zz9vY3Eth/E62lmbftAOMGiQQ2ZuK09LwxnC1zJjlxxpmHzZJzzkkYbiCkxbA9x+Djmwo7e/725IMf3pTZyBO0xbABYSGIKUFAPRDIE1YyCkbBKBgFIx4AAJSoP0qV8sseAAAAAElFTkSuQmCC","orcid":"","institution":"Southeast University","correspondingAuthor":true,"prefix":"","firstName":"Jun","middleName":"","lastName":"Tao","suffix":""},{"id":288112711,"identity":"e6d0b0cd-6816-4c21-a989-ca93b2f27ffd","order_by":2,"name":"Yu Gao","email":"","orcid":"","institution":"Southeast University","correspondingAuthor":false,"prefix":"","firstName":"Yu","middleName":"","lastName":"Gao","suffix":""},{"id":288112712,"identity":"710e9075-fe15-4f55-83e0-7834ce6acf9e","order_by":3,"name":"Yifan Xu","email":"","orcid":"","institution":"Southeast University","correspondingAuthor":false,"prefix":"","firstName":"Yifan","middleName":"","lastName":"Xu","suffix":""},{"id":288112713,"identity":"95263951-89a1-4b87-975c-6e2127f25d60","order_by":4,"name":"Weice Sun","email":"","orcid":"","institution":"Southeast University","correspondingAuthor":false,"prefix":"","firstName":"Weice","middleName":"","lastName":"Sun","suffix":""},{"id":288112714,"identity":"c43a6f77-0f08-4f53-a284-c83a09e49749","order_by":5,"name":"Haotian Wang","email":"","orcid":"","institution":"Southeast University","correspondingAuthor":false,"prefix":"","firstName":"Haotian","middleName":"","lastName":"Wang","suffix":""}],"badges":[],"createdAt":"2024-03-15 07:38:40","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4105847/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4105847/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":59619718,"identity":"ff493d00-23dc-4a18-bfb7-88f69c9c4c62","added_by":"auto","created_at":"2024-07-04 01:39:53","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1578635,"visible":true,"origin":"","legend":"","description":"","filename":"ParticleSwarmOptimizationwithLatinHypercubeSamplingforMobilityAwareTaskOffloadinginD2DAss.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4105847/v1_covered_e440fec0-fdc0-4800-8975-440f6add9e0b.pdf"},{"id":54407398,"identity":"ca764649-c81e-4f5c-97dc-ac98f19c3bea","added_by":"auto","created_at":"2024-04-10 04:23:45","extension":"rar","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":3054136,"visible":true,"origin":"","legend":"","description":"","filename":"ParticleSwarmOptimizationwithLatinHypercubeSamplingforMobilityAwareTaskOffloadinginD2DAssistedMECNetworks.rar","url":"https://assets-eu.researchsquare.com/files/rs-4105847/v1/3ff9c235a875ef91ca13f602.rar"}],"financialInterests":"No competing interests reported.","formattedTitle":"Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Task offloading, D2D, Mobile edge computing, Particle swarm optimization","lastPublishedDoi":"10.21203/rs.3.rs-4105847/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4105847/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"In this paper, we consider a Device-to-Device (D2D)-assisted Mobile Edge Computing (MEC) system in which the edge server collaboratively performs tasks with users who possess mobile characteristics. The computational resources of the edge server and the users are limited. Our objective is to minimize latency and energy consumption while maximizing system stability by determining the offloading decisions for all tasks. However, solving this problem is particularly challenging due to the coupling between offloading decisions and user mobility characteristics. To address this challenge, a Particle Swarm Optimization (PSO) algorithm based on Latin Hypercube Sampling (LHS) is proposed. PSO can be employed for iterative computation to obtain the optimal solution by treating the offloading decisions for all tasks as particles. Furthermore, employing LHS for the initialization and updating of the particle swarm can significantly enhance the performance and convergence of the PSO. Simulation results indicate that our proposed algorithm outperforms other algorithms significantly in terms of latency, energy consumption, and system stability while also exhibiting excellent robustness.","manuscriptTitle":"Particle Swarm Optimization with Latin Hypercube Sampling for Mobility-Aware Task Offloading in D2D-Assisted MEC Networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-04-10 04:23:41","doi":"10.21203/rs.3.rs-4105847/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"aaeab1f8-ef9d-45e3-8ff1-549d3863ca7b","owner":[],"postedDate":"April 10th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-07-04T01:31:44+00:00","versionOfRecord":[],"versionCreatedAt":"2024-04-10 04:23:41","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4105847","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4105847","identity":"rs-4105847","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00