• Journal of Korea Multimedia Society
• /
• v.25 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.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.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.112-122
• /
• 2004

In this paper, we propose a mobility estimation model based on inner regions in a cell and a dynamic resource reservation scheme which can control dynamically classes of mobile hosts on the mobile network. The mobility estimation model is modeled based on the reducible Markov chain. And the mobility estimation model provides a new hand off probability and a new remaining time for the dynamic resource reservation scheme. The remaining time is n estimated time that mobile hosts can stay in a cell. The dynamic resource reservation scheme can reserve dynamically a requested resource according to the classes of mobile hosts. This scheme can efficiently improve the connection blocking probability and connection dropping probability.

• Smart Media Journal
• /
• v.12 no.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.

• ETRI Journal
• /
• v.44 no.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.

• Journal of Communications and Networks
• /
• v.14 no.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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.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.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• 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.