• Title/Summary/Keyword: Cloud Base Station

Search Result 21, Processing Time 0.02 seconds

An Early Spectrum Sensing for Efficient Radio Access in Cloud-Conceptual Base Station Systems (클라우드 기지국 시스템에서 효율적 무선 접속을 위한 이른 스펙트럼 감지 기법)

  • Jo, Gahee;Lee, Jae Won;Na, Jee-Hyeon;Cho, Ho-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.1
    • /
    • pp.68-78
    • /
    • 2013
  • In this paper, we propose an early spectrum sensing(ESS) as an advance preparation for radio-access trial, which enables multi-mode terminals to access the most appropriate radio-access system in a cloud-conceptual base station system where multiple radio access technologies(RATs) coexist. Prior to a random access to one of RATs, a multi-mode terminal conducts a spectrum sensing over entire frequency bands of whole RATs, then select the RAT with the lowest sensing power, that is likely to have the most available spectrum. Thus, an access failure caused by that the selected RAT has no available radio spectrum could be avoidable in advance. In computer simulation, we consider as various RATs as possible. First, circuit and packet systems are taken into consideration. In addition, the packet systems are classified according to the feasibility of carrier aggregation(CA). In case of terminal, three modes are considered with circuit-only, packet-only, and multi-mode. Subsequently, packet traffic is classified into real-time and non-real-time traffic with three different tolerable delay levels. The simulation includes a call process starting with a call generation and ending up with a resource allocation reflecting individual user's QoS requirements and evaluates the proposed scheme in terms of the successful access probability, system access time, system balancing factor and packet loss probability.

A Study of Fronthaul Networks in CRANs - Requirements and Recent Advancements

  • Waqar, Muhammad;Kim, Ajung;Cho, Peter K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4618-4639
    • /
    • 2018
  • One of the most innovative paradigms for the next-generation of wireless cellular networks is the cloud-radio access networks (C-RANs). In C-RANs, base station functions are distributed between the remote radio heads (RHHs) and base band unit (BBU) pool, and a communication link is defined between them which is referred as the fronthaul. This leveraging link is expected to reduce the CAPEX (capital expenditure) and OPEX (operating expense) of envisioned cellular architectures as well as improves the spectral and energy efficiencies, provides the high scalability, and efficient mobility management capabilities. The fronthaul link carries the baseband signals between the RRHs and BBU pool using the digital radio over fiber (RoF) based common public radio interface (CPRI). CPRI based optical links imposed stringent synchronization, latency and throughput requirements on the fronthaul. As a result, fronthaul becomes a hinder in commercial deployments of C-RANs and is seen as one of a major bottleneck for backbone networks. The optimization of fronthaul is still a challenging issue and requires further exploration at industrial and academic levels. This paper comprehensively summarized the current challenges and requirements of fronthaul networks, and discusses the recently proposed system architectures, virtualization techniques, key transport technologies and compression schemes to carry the time-sensitive traffic in fronthaul networks.

A Decision Scheme of Dynamic Task Size for Cloud Server composed of Connected Cars (연결형 자동차로 구성된 클라우드 서버를 위한 동적 작업 크기 결정 기법)

  • Min, Hong;Jung, Jinman;Kim, Taesik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.3
    • /
    • pp.83-88
    • /
    • 2020
  • With developing vehicle and communication technologies, cars can communicate with road-side infrastructures and among other cars. As autonomous driving cars have been developed, the cars are equipped with many sensors and powerful processing units. There are many studies related to provide cloud services to users by using available resources of connected cars. In this paper, we proposed a dynamic task size decision scheme that considers communication environment between a vehicle and a base station as well as available resources while allocating a proper task to each vehicle. Simulation results based on the proposed model show that a vehicle can complete its allocated task when we considers available resources and communication environments.

Deep Reinforcement Learning-Based Edge Caching in Heterogeneous Networks

  • Yoonjeong, Choi; Yujin, Lim
    • Journal of Information Processing Systems
    • /
    • v.18 no.6
    • /
    • pp.803-812
    • /
    • 2022
  • With the increasing number of mobile device users worldwide, utilizing mobile edge computing (MEC) devices close to users for content caching can reduce transmission latency than receiving content from a server or cloud. However, because MEC has limited storage capacity, it is necessary to determine the content types and sizes to be cached. In this study, we investigate a caching strategy that increases the hit ratio from small base stations (SBSs) for mobile users in a heterogeneous network consisting of one macro base station (MBS) and multiple SBSs. If there are several SBSs that users can access, the hit ratio can be improved by reducing duplicate content and increasing the diversity of content in SBSs. We propose a Deep Q-Network (DQN)-based caching strategy that considers time-varying content popularity and content redundancy in multiple SBSs. Content is stored in the SBS in a divided form using maximum distance separable (MDS) codes to enhance the diversity of the content. Experiments in various environments show that the proposed caching strategy outperforms the other methods in terms of hit ratio.

A Context-aware Task Offloading Scheme in Collaborative Vehicular Edge Computing Systems

  • Jin, Zilong;Zhang, Chengbo;Zhao, Guanzhe;Jin, Yuanfeng;Zhang, Lejun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.2
    • /
    • pp.383-403
    • /
    • 2021
  • With the development of mobile edge computing (MEC), some late-model application technologies, such as self-driving, augmented reality (AR) and traffic perception, emerge as the times require. Nevertheless, the high-latency and low-reliability of the traditional cloud computing solutions are difficult to meet the requirement of growing smart cars (SCs) with computing-intensive applications. Hence, this paper studies an efficient offloading decision and resource allocation scheme in collaborative vehicular edge computing networks with multiple SCs and multiple MEC servers to reduce latency. To solve this problem with effect, we propose a context-aware offloading strategy based on differential evolution algorithm (DE) by considering vehicle mobility, roadside units (RSUs) coverage, vehicle priority. On this basis, an autoregressive integrated moving average (ARIMA) model is employed to predict idle computing resources according to the base station traffic in different periods. Simulation results demonstrate that the practical performance of the context-aware vehicular task offloading (CAVTO) optimization scheme could reduce the system delay significantly.

A cache placement algorithm based on comprehensive utility in big data multi-access edge computing

  • Liu, Yanpei;Huang, Wei;Han, Li;Wang, Liping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.3892-3912
    • /
    • 2021
  • The recent rapid growth of mobile network traffic places multi-access edge computing in an important position to reduce network load and improve network capacity and service quality. Contrasting with traditional mobile cloud computing, multi-access edge computing includes a base station cooperative cache layer and user cooperative cache layer. Selecting the most appropriate cache content according to actual needs and determining the most appropriate location to optimize the cache performance have emerged as serious issues in multi-access edge computing that must be solved urgently. For this reason, a cache placement algorithm based on comprehensive utility in big data multi-access edge computing (CPBCU) is proposed in this work. Firstly, the cache value generated by cache placement is calculated using the cache capacity, data popularity, and node replacement rate. Secondly, the cache placement problem is then modeled according to the cache value, data object acquisition, and replacement cost. The cache placement model is then transformed into a combinatorial optimization problem and the cache objects are placed on the appropriate data nodes using tabu search algorithm. Finally, to verify the feasibility and effectiveness of the algorithm, a multi-access edge computing experimental environment is built. Experimental results show that CPBCU provides a significant improvement in cache service rate, data response time, and replacement number compared with other cache placement algorithms.

Manufacturing and Characteristic Evaluation of Free space Optical Communication Devices in 5G Mobile Base Stations for Emergency Disaster Response (긴급재난 대응용 5G 이동 기지국을 위한 대기공간 광통신 장치의 제작과 특성평가)

  • Jin-Hyeon Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.5
    • /
    • pp.131-138
    • /
    • 2023
  • In this paper, a free space optical communication device that can be used in a mobile base station of several km or less was fabricated and its characteristics were investigated. To overcome the loss due to atmospheric transmission, an optical fiber amplifier (EDFA) with an output of 23 dBm or more was used. In order to increase the focusing speed and miniaturization of the laser beam, an optical lens was manufactured, and a transmission lens was designed to have beam divergence within the range of 1.5 to 1.8 [mrad]. A PT module that controls PAN/TILT was fabricated in order to reduce pointing errors and effective automatic alignment between transceiver devices. In this study, Reed-Solomon (RS) code was used to maintain the transmission quality above a certain level. It was manufactured to be able to communicate at a wireless distance of 300m in a weather situation with visibility of 300m. For performance measurement, it was measured using BERT and eye pattern analyzer, and it was confirmed that BER can be maintained at 2.5Gbps.

Enhanced Cross-Layering Mobile IPv6 Fast Handover over IEEE 802.16e Networks in Mobile Cloud Computing Environment (모바일 클라우드 컴퓨팅 환경에서 IEEE 802.16e 네트워크에서의 향상된 교차계층 Mobile IPv6 빠른 핸드오버 기법)

  • Lee, Kyu-Jin;Seo, Dae-Hee;Nah, Jae-Hoon;Mun, Young-Song
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.12
    • /
    • pp.45-51
    • /
    • 2010
  • The main issue in mobile cloud computing is how to support a seamless service to a mobile mode. Mobile IPv6 (MIPv6) is a mobility supporting protocol which is standardized by the Internet Engineering Task Force (IETF). Mobile IPv6 fast handovers (FMIPv6) is the extension of MIPv6 which is proposed to overcome shortcomings of MIPv6. Recently, fast handovers for Mobile IPv6 over IEEE 802.16e which is one of broadband wireless access systems has been proposed by the IETF. It was designed for supporting cross-layer fast handover. In this paper, we propose an enhanced cross-layering mobile IPv6 fast handover over IEEE 802.16e networks. In our scheme, a new access router generates a new address for the mobile node by using a layer 2 trigger. We utilize a layer 2 message which is sent from a new base station to the new access router in order to inform the new access router of information of the mobile node. A previous access router sends a binding update message to the mobile node's home agent when it acquires the new address of the mobile node. We evaluate the performance of the proposed scheme compared with the existing schemes in terms of the signaling cost and the handover latency. From the results, we observe that the proposed scheme can support fast handover effectively over IEEE 802.16e networks than existing schemes.

Performance Analysis of Docker Container Migration Using Secure Copy in Mobile Edge Computing (모바일 엣지 컴퓨팅 환경에서 안전 복사를 활용한 도커 컨테이너 마이그레이션 성능 분석)

  • Byeon, Wonjun;Lim, Han-wool;Yun, Joobeom
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.5
    • /
    • pp.901-909
    • /
    • 2021
  • Since mobile devices have limited computational resources, it tends to use the cloud to compute or store data. As real-time becomes more important due to 5G, many studies have been conducted on edge clouds that computes at locations closer to users than central clouds. The farther the user's physical distance from the edge cloud connected to base station is, the slower the network transmits. So applications should be migrated and re-run to nearby edge cloud for smooth service use. We run applications in docker containers, which is independent of the host operating system and has a relatively light images size compared to the virtual machine. Existing migration studies have been experimented by using network simulators. It uses fixed values, so it is different from the results in the real-world environment. In addition, the method of migrating images through shared storage was used, which poses a risk of packet content exposure. In this paper, Containers are migrated with Secure CoPy(SCP) method, a data encryption transmission, by establishing an edge computing environment in a real-world environment. It compares migration time with Network File System, one of the shared storage methods, and analyzes network packets to verify safety.

Development of a Retrieval Algorithm for Adjustment of Satellite-viewed Cloudiness (위성관측운량 보정을 위한 알고리즘의 개발)

  • Son, Jiyoung;Lee, Yoon-Kyoung;Choi, Yong-Sang;Ok, Jung;Kim, Hye-Sil
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.3
    • /
    • pp.415-431
    • /
    • 2019
  • The satellite-viewed cloudiness, a ratio of cloudy pixels to total pixels ($C_{sat,\;prev}$), inevitably differs from the "ground-viewed" cloudiness ($C_{grd}$) due to different viewpoints. Here we develop an algorithm to retrieve the satellite-viewed, but adjusted cloudiness to $C_{grd} (C_{sat,\;adj})$. The key process of the algorithm is to convert the cloudiness projected on the plane surface into the cloudiness on the celestial hemisphere from the observer. For this conversion, the supplementary satellite retrievals such as cloud detection and cloud top pressure are used as they provide locations of cloudy pixels and cloud base height information, respectively. The algorithm is tested for Himawari-8 level 1B data. The $C_{sat,\;adj}$ and $C_{sat,\;prev}$ are retrieved and validated with $C_{grd}$ of SYNOP station over Korea (22 stations) and China (724 stations) during only daytime for the first seven days of every month from July 2016 to June 2017. As results, the mean error of $C_{sat,\;adj}$ (0.61) is less that than that of $C_{sat,\;prev}$ (1.01). The percent of detection for 'Cloudy' scenario of $C_{sat,\;adj}$ (73%) is higher than that of $C_{sat,\;prev}$ (60%) The percent of correction, the accuracy, of $C_{sat,\;adj}$ is 61%, while that of $C_{sat,\;prev}$ is 55% for all seasons. For the December-January-February period when cloudy pixels are readily overestimated, the proportion of correction of $C_{sat,\;adj$ is 60%, while that of $C_{sat,\;prev}$ is 56%. Therefore, we conclude that the present algorithm can effectively get the satellite cloudiness near to the ground-viewed cloudiness.