FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4251282086> ?p ?o ?g. }

• W4251282086 abstract "With the growing popularity of smart applications that contain computing-intensive tasks, the provision of radio and computing resources with high quality is becoming more and more challenging. Moreover, supporting network scalability is crucial to accommodate the massive numbers of connected devices. In this thesis, we present effective energy saving strategies that consider the utilization of network elements such as base stations and virtual machines, and implement on/off mechanisms taking into account the quality of service (QoS) required by mobile users. Moreover, we investigate the performance of a NOMA-based resource allocation scheme in the context of Internet of Things aiming to improve network scalability and reduce the energy consumption of mobile users. The system model is mainly built upon the M/M/k queueing system that has been widely used in most relevant works. First, the energy saving mechanism is formulated as a 0-1 knapsack problem where the weight and value of each small base station is determined by the utilization and proportion of computing tasks at that base station, respectively. The problem is then solved using the dynamic programming approach which showed significant energy saving performance while maintaining the cloud response time at desired levels. Afterwards, the energy saving mechanism is applied on edge computing to reduce the amount of under-utilized virtual machines in edge devices. Herein, the square-root staffing rule and the Halfin-Whitt function are used to determine the minimum number of virtual machines required to maintain the queueing probability below a threshold value. On the user level, reducing energy consumption can be achieved by maximizing data rate provision to reduce the task completion time, and hence, the transmission energy. Herein, a NOMA-based scheme is introduced, particularly, the sparse code multiple access (SCMA) technique that allows subcarriers to be shared by multiple users. Not only does SCMA help provide higher data rates but also increase the number of accommodated users. In this context, a power optimization and codebook allocation problems are formulated and solved using the water-filling and heuristic approaches, respectively. Results show that SCMA can significantly improve data rate provision and accommodate more mobile users with improved user satisfaction." @default.
• W4251282086 created "2022-05-12" @default.
• W4251282086 creator A5059441845 @default.
• W4251282086 date "2021-05-23" @default.
• W4251282086 modified "2023-09-29" @default.
• W4251282086 title "Energy Saving Schemes for Scalable Mobile Computing Networks" @default.
• W4251282086 doi "https://doi.org/10.32920/ryerson.14651529.v1" @default.
• W4251282086 hasPublicationYear "2021" @default.
• W4251282086 type Work @default.
• W4251282086 citedByCount "0" @default.
• W4251282086 crossrefType "posted-content" @default.
• W4251282086 hasAuthorship W4251282086A5059441845 @default.
• W4251282086 hasBestOaLocation W42512820861 @default.
• W4251282086 hasConcept C111919701 @default.
• W4251282086 hasConcept C113138325 @default.
• W4251282086 hasConcept C11413529 @default.
• W4251282086 hasConcept C120314980 @default.
• W4251282086 hasConcept C151730666 @default.
• W4251282086 hasConcept C162307627 @default.
• W4251282086 hasConcept C18903297 @default.
• W4251282086 hasConcept C22684755 @default.
• W4251282086 hasConcept C25344961 @default.
• W4251282086 hasConcept C2776061582 @default.
• W4251282086 hasConcept C2779343474 @default.
• W4251282086 hasConcept C2780165032 @default.
• W4251282086 hasConcept C31258907 @default.
• W4251282086 hasConcept C41008148 @default.
• W4251282086 hasConcept C48044578 @default.
• W4251282086 hasConcept C5119721 @default.
• W4251282086 hasConcept C76155785 @default.
• W4251282086 hasConcept C79974875 @default.
• W4251282086 hasConcept C86803240 @default.
• W4251282086 hasConcept C93996380 @default.
• W4251282086 hasConceptScore W4251282086C111919701 @default.
• W4251282086 hasConceptScore W4251282086C113138325 @default.
• W4251282086 hasConceptScore W4251282086C11413529 @default.
• W4251282086 hasConceptScore W4251282086C120314980 @default.
• W4251282086 hasConceptScore W4251282086C151730666 @default.
• W4251282086 hasConceptScore W4251282086C162307627 @default.
• W4251282086 hasConceptScore W4251282086C18903297 @default.
• W4251282086 hasConceptScore W4251282086C22684755 @default.
• W4251282086 hasConceptScore W4251282086C25344961 @default.
• W4251282086 hasConceptScore W4251282086C2776061582 @default.
• W4251282086 hasConceptScore W4251282086C2779343474 @default.
• W4251282086 hasConceptScore W4251282086C2780165032 @default.
• W4251282086 hasConceptScore W4251282086C31258907 @default.
• W4251282086 hasConceptScore W4251282086C41008148 @default.
• W4251282086 hasConceptScore W4251282086C48044578 @default.
• W4251282086 hasConceptScore W4251282086C5119721 @default.
• W4251282086 hasConceptScore W4251282086C76155785 @default.
• W4251282086 hasConceptScore W4251282086C79974875 @default.
• W4251282086 hasConceptScore W4251282086C86803240 @default.
• W4251282086 hasConceptScore W4251282086C93996380 @default.
• W4251282086 hasLocation W42512820861 @default.
• W4251282086 hasLocation W42512820862 @default.
• W4251282086 hasOpenAccess W4251282086 @default.
• W4251282086 hasPrimaryLocation W42512820861 @default.
• W4251282086 hasRelatedWork W1504006543 @default.
• W4251282086 hasRelatedWork W1596010778 @default.
• W4251282086 hasRelatedWork W2046698369 @default.
• W4251282086 hasRelatedWork W2049319146 @default.
• W4251282086 hasRelatedWork W2060899207 @default.
• W4251282086 hasRelatedWork W2309601263 @default.
• W4251282086 hasRelatedWork W2552054794 @default.
• W4251282086 hasRelatedWork W2736068468 @default.
• W4251282086 hasRelatedWork W2765557566 @default.
• W4251282086 hasRelatedWork W2963616097 @default.
• W4251282086 isParatext "false" @default.
• W4251282086 isRetracted "false" @default.
• W4251282086 workType "article" @default.