• 제목/요약/키워드: dynamic mobile computing

검색결과 127건 처리시간 0.019초

엣지 컴퓨팅에서 트래픽 분산을 위한 흐름 예측 기반 동적 클러스터링 기법 (Flow Prediction-Based Dynamic Clustering Method for Traffic Distribution in Edge Computing)

  • 이창우
    • 한국멀티미디어학회논문지
    • /
    • 제25권8호
    • /
    • pp.1136-1140
    • /
    • 2022
  • This paper is a method for efficient traffic prediction in mobile edge computing, where many studies have recently been conducted. For distributed processing in mobile edge computing, tasks offloading from each mobile edge must be processed within the limited computing power of the edge. As a result, in the mobile nodes, it is necessary to efficiently select the surrounding edge server in consideration of performance dynamically. This paper aims to suggest the efficient clustering method by selecting edges in a cloud environment and predicting mobile traffic. Then, our dynamic clustering method is to reduce offloading overload to the edge server when offloading required by mobile terminals affects the performance of the edge server compared with the existing offloading schemes.

Dynamic Scheduling Method for Cooperative Resource Sharing in Mobile Cloud Computing Environments

  • Kwon, Kyunglag;Park, Hansaem;Jung, Sungwoo;Lee, Jeungmin;Chung, In-Jeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.484-503
    • /
    • 2016
  • Mobile cloud computing has recently become a new paradigm for the utilization of a variety of shared mobile resources via wireless network environments. However, due to the inherent characteristics of mobile devices, a limited battery life, and a network access requirement, it is necessary for mobile servers to provide a dynamic approach for managing mobile resources efficiently in mobile cloud computing environments. Since on-demand job requests occur frequently and the number of mobile devices is drastically increased in mobile cloud computing environments, a different mobile resource management method is required to maximize the computational power. In this paper, we therefore propose a cooperative, mobile resource sharing method that considers both the inherent properties and the number of mobile devices in mobile cloud environments. The proposed method is composed of four main components: mobile resource monitor, job handler, resource handler, and results consolidator. In contrast with conventional mobile cloud computing, each mobile device under the proposed method can be either a service consumer or a service provider in the cloud. Even though each device is resource-poor when a job is processed independently, the computational power is dramatically increased under the proposed method, as the devices cooperate simultaneously for a job. Therefore, the mobile computing power throughput is dynamically increased, while the computation time for a given job is reduced. We conduct case-based experiments to validate the proposed method, whereby the feasibility of the method for the purpose of cooperative computation is shown.

The Design of Dynamic Fog Cloud System using mDBaaS

  • Hwang, Chigon;Shin, Hyoyoung;Lee, Jong-Yong;Jung, Kyedong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제9권4호
    • /
    • pp.59-66
    • /
    • 2017
  • Cloud computing has evolved into a core computing infrastructure for the internet that encompasses content, as well as communications, applications and commerce. By providing powerful computing and communications capabilities in the palm of the hand everywhere with a variety of smart devices, mobile applications such as virtual reality, sensing and navigation have emerged and radically changed the patterns people live. The data that is generated is getting bigger. Cloud computing, on the other hand, has problems with system load and speed due to the collection, processing and control of remote data. To solve this problem, fog computing has been proposed in which data is collected and processed at an edge. In this paper, we propose a system that dynamically selects a fog server that acts as a cloud in the edge. It serves as a mediator in the cloud, and provides information on the services and systems belonging to the cloud to the mobile device so that the mobile device can act as a fog. When the role of the fog system is complete, we provide it to the cloud to virtualize the fog. The heterogeneous problem of data of mobile nodes can be solved by using mDBaaS (Mobile DataBase as a Service) and we propose a system design method for this.

An Efficient Service Function Chains Orchestration Algorithm for Mobile Edge Computing

  • Wang, Xiulei;Xu, Bo;Jin, Fenglin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권12호
    • /
    • pp.4364-4384
    • /
    • 2021
  • The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

이동 컴퓨팅 환경에서 동적인 이동성 등급을 이용한 자원 예약 기법 (A Resource Reservation Scheme using Dynamic Mobility Class on the Mobile Computing Environment)

  • 박시용;정기동
    • 한국정보과학회논문지:정보통신
    • /
    • 제31권1호
    • /
    • pp.112-122
    • /
    • 2004
  • 본 논문에서는 이동 컴퓨팅 환경에서 셀 내부 영역에 기반을 둔 이동성 예측 모델과 모바일 호스트들의 이동성을 토대로 하는 이동성 등급을 동적으로 조정할 수 있는 자원 예약 기법을 제안한다. 본 논문에서 제안하는 이동성 예측 모델은 셀 내부의 각각 다른 영역을 기반으로 가약 마코프 체인을 이용하여 모델링 하였으며, 새로운 방법으로 핸드오프 확률을 추정한다. 그리고 모바일 호스트들이 셀 내부에 머물 가능성이 있는 셀 내부 존재 시간을 제공하며, 그 셀 내부 존재 시간은 동적인 자원 예약 기법의 새로운 인자로 활용된다. 동적인 자원 예약 기법은 모바일 호스트들의 내부 존재 시간의 마감에 따라서 변화하는 이동성 등급을 이용하여 이웃 셀의 자원을 동적으로 예약한다. 이 기법들은 신규 호 블록킹율과 핸드 오프 호 종료율을 개선시켰다.

Dynamic Computation Offloading Based on Q-Learning for UAV-Based Mobile Edge Computing

  • Shreya Khisa;Sangman Moh
    • 스마트미디어저널
    • /
    • 제12권3호
    • /
    • pp.68-76
    • /
    • 2023
  • Emerging mobile edge computing (MEC) can be used in battery-constrained Internet of things (IoT). The execution latency of IoT applications can be improved by offloading computation-intensive tasks to an MEC server. Recently, the popularity of unmanned aerial vehicles (UAVs) has increased rapidly, and UAV-based MEC systems are receiving considerable attention. In this paper, we propose a dynamic computation offloading paradigm for UAV-based MEC systems, in which a UAV flies over an urban environment and provides edge services to IoT devices on the ground. Since most IoT devices are energy-constrained, we formulate our problem as a Markov decision process considering the energy level of the battery of each IoT device. We also use model-free Q-learning for time-critical tasks to maximize the system utility. According to our performance study, the proposed scheme can achieve desirable convergence properties and make intelligent offloading decisions.

Dynamic ID randomization for user privacy in mobile network

  • Arijet Sarker;SangHyun Byun;Manohar Raavi;Jinoh Kim;Jonghyun Kim;Sang-Yoon Chang
    • ETRI Journal
    • /
    • 제44권6호
    • /
    • pp.903-914
    • /
    • 2022
  • Mobile and telecommunication networking uses temporary and random identifiers (IDs) to protect user privacy. For greater intelligence and security o the communications between the core network and the mobile user, we design and build a dynamic randomization scheme for the temporary IDs for mobile networking, including 5G and 6G. Our work for ID randomization (ID-RZ) advances the existing state-of-the-art ID re-allocation approach in 5G in the following ways. First, ID-RZ for ID updates is based on computing, as opposed to incurring networking for the re-allocation-based updates, and is designed for lightweight and low-latency mobile systems. Second, ID-RZ changes IDs proactively (as opposed to updating based on explicit networking event triggers) and provides stronger security (by increasing the randomness and frequency of ID updates). We build on the standard cryptographic primitives for security (e.g., hash) and implement our dynamic randomization scheme in the 5G networking protocol to validate its design purposes, which include time efficiency (two to four orders of magnitude quicker than the re-allocation approach) and appropriateness for mobile applications.

A Novel Cross-Layer Dynamic Integrated Priority-Computing Scheme for 3G+ Systems

  • Wang, Weidong;Wang, Zongwen;Zhao, Xinlei;Zhang, Yinghai;Zhou, Yao
    • Journal of Communications and Networks
    • /
    • 제14권1호
    • /
    • pp.15-20
    • /
    • 2012
  • As Internet protocol and wireless communications have developed, the number of different types of mobile services has increased gradually. Existing priority-computing schemes cannot satisfy the dynamic requirements of supporting multiple services in future wireless communication systems, because the currently used factors, mainly user priority, are relatively simple and lack relevancy. To solve this problem and provide the desired complexity, dynamic behavior, and fairness features of 3G and beyond 3G mobile communication systems, this paper proposes a novel cross-layer dynamic integrated priority-computing scheme that computes the priority based on a variety of factors, including quality of service requirements, subscriber call types, waiting time, movement mode, and traffic load from the corresponding layers. It is observed from simulation results that the proposed dynamic integrated priority scheme provides enhanced performance.

Dynamic Access Control for Personalized Environment in Ubiquitous Computing

  • Kim, Yuna;Shin, IlShik;Hong, Sung Je;Kim, Jong
    • 대한임베디드공학회논문지
    • /
    • 제2권4호
    • /
    • pp.233-241
    • /
    • 2007
  • In an ubiquitous environment, for controlling user access according to environment of users, a number of access control models enforcing dynamic environment of users have been proposed. However, they do not support personalized environments of each user and have a run-time overhead of searching active roles. In this paper, we propose a new model, PE-RBAC, that extends the RBAC architecture by addition of a personalized environment component as a constraint to accommodate dynamic and mobile users. In this model, a dynamic role activation is presented by using a new role-to-environment structure instead of the conventional role hierarchy, which makes it efficient to find the active roles according to a user's personalized environment.

  • PDF

이동 서비스를 위한 터널링 기법의 구현과 성능분석 (Implementation and Analysis of Tunneling Method for Mobile Service)

  • 천정훈;정진우강현국
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • pp.47-50
    • /
    • 1998
  • In recent years, it is required that computing support mobile user with computer. The advantage of mobile computing is that users may access all their applications from any location, whether they are in another building or a different state. So, Internet combines with mobile computing technology to make new communication environment for supporting mobility. The research for solving the problem of mobility is actively in progress. This paper describes the implementation of tunneling method for flexible bypass between specific region. Tunneling method provide mobile service to mobile hosts. IP datagram's address tranform method is IP-within-IP encapsulation by which an IP datagram may be encapsulated within an IP datagram. The developed IP-within-IP protocol can provide not only enhanced performance because it is implemented in kernel mode, but also convenience of usage to the application developers because it gives user interface as a dynamic link library. Verification of IP packet tunneling was text file transfer program.

  • PDF