• Title/Summary/Keyword: dynamic mobile computing

Search Result 127, Processing Time 0.027 seconds

Design of Security Service Model in Dynamic Cloud Environment (동적 클라우드 환경에 적합한 보안 서비스 모델 설계)

  • Jeong, Yoon-Su
    • Journal of Convergence Society for SMB
    • /
    • v.2 no.2
    • /
    • pp.35-41
    • /
    • 2012
  • The rapid development of cloud computing and mobile internet service changes to an mobile cloud service environment that can serve and pay computing source that users want anywhere and anytime. But when user misses mobile device, the respond to any threat like user's personal information exposal is insufficient. This paper proposes cloud service access control model to provide secure service for mobile cloud users to other level users. The proposed role-based model performs access authority when performs user certification to adapt various access security policy. Also, the proposed model uses user's attribute information and processes before user certification therefore it lowers communication overhead and service delay. As a result, packet certification delay time is increased 3.7% and throughput of certification server is increased 10.5%.

  • PDF

A Scheme for Dynamic Regional Registration of Mobile Hosts in Mobile Computing Environments (이동 컴퓨팅 환경에서 이동 호스트들에 대한 동적인 지역적 등록 기법)

  • 강용혁;엄영익
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.523-525
    • /
    • 2000
  • 최근의 무선 네트워크의 급속한 발전으로 이동 컴퓨팅 분야도 IMT-2000 기술과 더불어 전세계 어디에서든지 위치에 상관없이 Mobile IP 프로토콜과 같은 이동성을 지원하는 IP 프로토콜을 통해서 인터넷에 접속할 수 있는 환경을 제공하게 될 것이다. Mobile IP 환경에서 MH(Mobile Host)는 이동하는 도중에도 인터넷에 접속을 유지하려면 자신의 care-of address가 변경될 때마다 이동한 셀의 FA(Foreign Agent)를 걸쳐서 HA(Home Agent)에게 등록하는 과정을 계속해서 수행해야 한다. 만약 MH의 FA와 HA간의 거리가 먼 경우에는 등록하는 시간이 길어질 것이며, 그만큼 인터넷에 접속되는 시간이 지연되어 인터넷 서비스가 늦어질 것이다. 본 논문에서는 MH의 FA와 HA와의 거리가 먼 경우에 지역적인 등록을 통해서 등록 지연 시간을 줄일 수 있는 동적인 지역적 등록 기법을 제안한다. 이러한 동적인 지역적 등록 기법은 MH의 등록 지연 시간을 줄이며 MH의 매끄러운 핸드오프(smooth handoff) 기능도 지원하여 핸드오프 기간동안의 패킷 전송 오류를 줄일 수 있는 기법이다.

  • PDF

Applying Distributed Agents to Parallel Genetic Algorithm on Dynamic Network Environments (동적 네트워크 환경하의 분산 에이전트를 활용한 병렬 유전자 알고리즘 기법)

  • Baek Jin-Wook;Bang Jeon-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.119-125
    • /
    • 2006
  • Distributed Systems can be defined as set of computing resources connected by computer network. One of the most significant techniques in optimization problem domains is parallel genetic algorithms, which are based on distributed systems. Since the status of dynamic network environments such as Internet and mobile computing. can be changed continually, it must not be efficient on the dynamic environments to solve an optimization problem using previous parallel genetic algorithms themselves. In this paper, we propose the effective technique, in which the parallel genetic algorithm can be used efficiently on the dynamic network environments.

  • PDF

Personalized Service Recommendation for Mobile Edge Computing Environment (모바일 엣지 컴퓨팅 환경에서의 개인화 서비스 추천)

  • Yim, Jong-choul;Kim, Sang-ha;Keum, Chang-sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.1009-1019
    • /
    • 2017
  • Mobile Edge Computing(MEC) is a emerging technology to cope with mobile traffic explosion and to provide a variety of services having specific requirements by means of running some functions at mobile edge nodes directly. For instance, caching function can be executed in order to offload mobile traffics, and safety services using real time video analytics can be delivered to users. So far, a myriad of methods and architectures for personalized service recommendation have been proposed, but there is no study on the subject which takes unique characteristics of mobile edge computing into account. To provide personalized services, acquiring users' context is of great significance. If the conventional personalized service model, which is server-side oriented, is applied to the mobile edge computing scheme, it may cause context isolation and privacy issues more severely. There are some advantages at mobile edge node with respect to context acquisition. Another notable characteristic at MEC scheme is that interaction between users and applications is very dynamic due to temporal relation. This paper proposes the local service recommendation platform architecture which encompasses these characteristics, and also discusses the personalized service recommendation mechanism to be able to mitigate context isolation problem and privacy issues.

A Lightweight Software-Defined Routing Scheme for 5G URLLC in Bottleneck Networks

  • Math, Sa;Tam, Prohim;Kim, Seokhoon
    • Journal of Internet Computing and Services
    • /
    • v.23 no.2
    • /
    • pp.1-7
    • /
    • 2022
  • Machine learning (ML) algorithms have been intended to seamlessly collaborate for enabling intelligent networking in terms of massive service differentiation, prediction, and provides high-accuracy recommendation systems. Mobile edge computing (MEC) servers are located close to the edge networks to overcome the responsibility for massive requests from user devices and perform local service offloading. Moreover, there are required lightweight methods for handling real-time Internet of Things (IoT) communication perspectives, especially for ultra-reliable low-latency communication (URLLC) and optimal resource utilization. To overcome the abovementioned issues, this paper proposed an intelligent scheme for traffic steering based on the integration of MEC and lightweight ML, namely support vector machine (SVM) for effectively routing for lightweight and resource constraint networks. The scheme provides dynamic resource handling for the real-time IoT user systems based on the awareness of obvious network statues. The system evaluations were conducted by utillizing computer software simulations, and the proposed approach is remarkably outperformed the conventional schemes in terms of significant QoS metrics, including communication latency, reliability, and communication throughput.

Autonomic Multimedia Transcoding Algorithm for Seamless Streaming Media of Mobile Clients (이동 단말에서 끊임없는 스트리밍 미디어를 위한 오토노믹 멀티미디어 트랜스코딩 알고리즘)

  • Han, Woo-Ram;Heo, Nan-Sook;Park, Chong-Myung;Seo, Dong-Mahn;Jung, In-Bum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.5
    • /
    • pp.260-270
    • /
    • 2007
  • Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. However, since mobile clients use wireless network and the wireless network have less stable bandwidth according to distance from AP and environments, it is hard to support stable QoS to mobile clients. In this paper, we propose a dynamic bit rate control method for transcoding in order to supprot stable QoS of streaming media service to mobile clients via wireless network. The proposed method is shown to serve seamless streaming media service with adaptive bit rate control according to state of wireless network in real time and to reduce transmission failure from experiment.

High-Speed Path Planning of a Mobile Robot Using Gradient Method with Topological Information (위상정보를 갖는 구배법에 기반한 이동로봇의 고속 경로계획)

  • Ham Jong-Gyu;Chung Woo-Jin;Song Jae-Bok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.5
    • /
    • pp.444-449
    • /
    • 2006
  • Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

A Video Cache Replacement Scheme based on Local Video Popularity and Video Size for MEC Servers

  • Liu, Pingshan;Liu, Shaoxing;Cai, Zhangjing;Lu, Dianjie;Huang, Guimin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.3043-3067
    • /
    • 2022
  • With the mobile traffic in the network increases exponentially, multi-access edge computing (MEC) develops rapidly. MEC servers are deployed geo-distribution, which serve many mobile terminals locally to improve users' QoE (Quality of Experience). When the cache space of a MEC server is full, how to replace the cached videos is an important problem. The problem is also called the cache replacement problem, which becomes more complex due to the dynamic video popularity and the varied video sizes. Therefore, we proposed a new cache replacement scheme based on local video popularity and video size to solve the cache replacement problem of MEC servers. First, we built a local video popularity model, which is composed of a popularity rise model and a popularity attenuation model. Furthermore, the popularity attenuation model incorporates a frequency-dependent attenuation model and a frequency-independent attenuation model. Second, we formulated a utility based on local video popularity and video size. Moreover, the weights of local video popularity and video size were quantitatively analyzed by using the information entropy. Finally, we conducted extensive simulation experiments based on the proposed scheme and some compared schemes. The simulation results showed that our proposed scheme performs better than the compared schemes in terms of hit rate, average delay, and server load under different network configurations.

Practical Architectural Patterns and Guidelines for Designing Complex Mobile Applications (복잡도가 높은 모바일 어플리케이션 설계를 위한 아키텍처 패턴과 적용지침)

  • Jang, Jeong-Ran;La, Hyun-Jung;Kim, Soo-Dong
    • The KIPS Transactions:PartD
    • /
    • v.19D no.1
    • /
    • pp.63-80
    • /
    • 2012
  • Mobile devices with Android OS and iOS have been emerged as mobile computing devices where various software applications are deployed. Furthermore, they are anticipated to be used not only for traditional personal computing but also for enterprise computing. However, such mobile devices have their intrinsic characteristics such as limited resources and flexible network capabilities, which are not revealed in traditional computers. Hence, there is high demand for methods to develop mobile applications with reflecting their intrinsic characteristics. Since those characteristics belong to non-functional requirements, they should be reflected in architecture design while designing mobile applications. To design architecture, the architecture drivers that are architecture non-functional requirements are decided from mobile application characteristics. Conventional architecture design methods do not consider those characteristics so that the methods cannot be straightforwardly applied to mobile applications. In this paper, to efficiently develop mobile applications reflecting those characteristics, we propose a set of architecture patterns and define a guideline to apply those patterns. First, we define the characteristics of mobile applications distinguished and derive architectural drivers from them. Then, we propose architecture patterns in terms of static and dynamic views and define an architectural guideline to apply the patterns to designing architecture for mobile application. And, we perform case studies to verify the applicability of proposed patterns. Finally, we assess the proposed architecture patterns by proving how the patterns can fulfill identified architecture drivers and by comparing our approach with previous works.

A Design and Implementation of an Adaptive Stream Controller for Mobile Operating System (이동형 운영체제를 위한 적응적 스트림 처리기 설계 및 구현)

  • Park, Seung-Keun;Oh, Mi-Kyong;Lim, Young-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.04a
    • /
    • pp.147-150
    • /
    • 2002
  • 본 논문에서는 이동 단말기 중 하나인 Windows CE 기반 PDA를 위한 적응적 멀티미디어 스트림 처리기를 설계 및 구현하였다. 제한된 시스템 환경을 갖고 있는 PDA 상에서 멀티미디어 데이터를 실시간으로 전송 및 저장할 때 생기는 메모리 문제를 효율적으로 해결하기 위하여 적응적 버퍼 관리 기법을 사용하였다. 단말기에 적합한 형태로 멀티미디어 데티터를 변환하여 전송하기 위하여 필터를 사용하였고, 필터 파이프라인을 구성하였다. 또한 다양한 형태의 미디움과 필터의 입출력을 일관성 있게 처리하기 위해서 DLM(Dynamic Linking Module) 구조를 사용하였다.

  • PDF