• Title/Summary/Keyword: Edge user

Search Result 312, Processing Time 0.018 seconds

Data Access Control Scheme Based on Blockchain and Outsourced Verifiable Attribute-Based Encryption in Edge Computing

  • Chao Ma;Xiaojun Jin;Song Luo;Yifei Wei;Xiaojun Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.7
    • /
    • pp.1935-1950
    • /
    • 2023
  • The arrival of the Internet of Things and 5G technology enables users to rely on edge computing platforms to process massive data. Data sharing based on edge computing refines the efficiency of data collection and analysis, saves the communication cost of data transmission back and forth, but also causes the privacy leakage of a lot of user data. Based on attribute-based encryption and blockchain technology, we design a fine-grained access control scheme for data in edge computing, which has the characteristics of verifiability, support for outsourcing decryption and user attribute revocation. User attributes are authorized by multi-attribute authorization, and the calculation of outsourcing decryption in attribute encryption is completed by edge server, which reduces the computing cost of end users. Meanwhile, We implemented the user's attribute revocation process through the dual encryption process of attribute authority and blockchain. Compared with other schemes, our scheme can manage users' attributes more flexibly. Blockchain technology also ensures the verifiability in the process of outsourcing decryption, which reduces the space occupied by ciphertext compared with other schemes. Meanwhile, the user attribute revocation scheme realizes the dynamic management of user attribute and protects the privacy of user attribute.

Scheduling Method based on SINR at Cell Edge for multi-mode mobile device (멀티모드 단말기를 위한 셀 경계 지역에서의 SINR 기반 사용자 선택 방법)

  • Kum, Donghyun;Choi, Seungwon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.63-68
    • /
    • 2015
  • We consider a cell edge environment. In cell edge, a user interfered by signal which is generated by a base stations not including the user. In cell edge environment, that is, there are inter cell interference (ICI) as well as multi user interference (MUI). Coordinated multi-point transmission (CoMP) is a technique which mitigates ICI between base stations. In CoMP, therefore, base stations can coordinate with each other by sharing user state information (CSI) in order to mitigate ICI. To improve sum rate performance in CoMP, each base station should generate optimal user group and transmit data to users selected in the optimal user group. In this paper, we propose a user selection algorithm in CoMP. The proposed method use signal to interference plus noise ratio (SINR) as criterion of selecting users. Because base station can't measure accurate SINR of users, in this paper, we estimate SINR equation considering ICI as well as MUI. Also, we propose a user selection algorithm based on the estimated SINR. Through MATAL simulation, we verify that the proposed method improves the system sum rate by an average of 1.5 ~ 3 bps/Hz compared to the conventional method.

Client Collaboration for Power and Interference Reduction in Wireless Cellular Communication

  • Nam, Hyungju;Jung, Minchae;Hwang, Kyuho;Choi, Sooyong
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.2
    • /
    • pp.117-124
    • /
    • 2012
  • A client collaboration (CC) system is proposed for a user relay system. The proposed scheme focuses on the management of transmit power and leakage interference. In the proposed CC system, edge users transmit signals to the masters considered as user relays. The masters relay the signals of the edge users to the base station using the resource blocks (RBs) that are assigned to the edge users. The leakage interference and power consumption were analyzed in the CC system. In addition, an optimal master location problem was formulated based on the signal-to-leakage-plus-noise ratio (SLNR). Because the optimal master location problem is quite complex, a sub-optimal master location problem was proposed and a closed-form sub-optimal master location was obtained. The edge users generate smaller leakage interference and power consumption in the proposed CC system compared to the system without the CC. The numerical results showed that the edge users generate smaller leakage interference and power consumption in the proposed CC system compared to the system without the CC, and the average throughput increases.

  • PDF

Transmit Power Allocation for Soft Frequency Reuse in Coordinated Cellular Systems (인접셀간 협력하는 셀룰라 시스템에서 소프트 주차수 재사용을 위한 송신전력할당 기법)

  • Kim, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4A
    • /
    • pp.316-323
    • /
    • 2009
  • Power allocation of soft frequency reuse(SFR) to increase cell edge user throughput by reducing inter-cell interference is proposed for coordinated cellular systems. SFR is the effective technique to increase cell edge user throughput, however, it costs the degradation of total system throughput. The cost increases when SFR operated in distributed resource controlled systems fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmit power adaptively depending on user distribution so that it minimizes the loss of system throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Through system level simulation considering neighboring two cells, evaluation result for adaptive power allocation is shown compared with static power allocation.

Wireless Caching Algorithm Based on User's Context in Smallcell Environments (소형셀 환경에서 사용자 컨텍스트 기반 무선 캐시 알고리즘)

  • Jung, Hyun Ki;Jung, Soyi;Lee, Dong Hak;Lee, Seung Que;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.7
    • /
    • pp.789-798
    • /
    • 2016
  • In this paper, we propose a cache algorithm based on user's context for enterprise/urban smallcell environments. The smallcell caching method is to store mobile users' data traffic at a storage which is equipped in smallcell base station and it has an effect of reducing core networks traffic volume. In our algorithm, contrary to existing smallcell cache algorithms, the cache storage is equipped in a edge server by using a concept of the Mobile Edge Computing. In order to reflect user's characteristics, the edge server classifies users into several groups based on user's context. Also the edge server changes the storage size and the cache replacement frequency of each group to improve the cache efficiency. As the result of performance evaluation, the proposed algorithm can improve the cache hit ratio by about 11% and cache efficiency by about 5.5% compared to the existing cache algorithm.

GAIN-QoS: A Novel QoS Prediction Model for Edge Computing

  • Jiwon Choi;Jaewook Lee;Duksan Ryu;Suntae Kim;Jongmoon Baik
    • Journal of Web Engineering
    • /
    • v.21 no.1
    • /
    • pp.27-52
    • /
    • 2021
  • With recent increases in the number of network-connected devices, the number of edge computing services that provide similar functions has increased. Therefore, it is important to recommend an optimal edge computing service, based on quality-of-service (QoS). However, in the real world, there is a cold-start problem in QoS data: highly sparse invocation. Therefore, it is difficult to recommend a suitable service to the user. Deep learning techniques were applied to address this problem, or context information was used to extract deep features between users and services. However, edge computing environment has not been considered in previous studies. Our goal is to predict the QoS values in real edge computing environments with improved accuracy. To this end, we propose a GAIN-QoS technique. It clusters services based on their location information, calculates the distance between services and users in each cluster, and brings the QoS values of users within a certain distance. We apply a Generative Adversarial Imputation Nets (GAIN) model and perform QoS prediction based on this reconstructed user service invocation matrix. When the density is low, GAIN-QoS shows superior performance to other techniques. In addition, the distance between the service and user slightly affects performance. Thus, compared to other methods, the proposed method can significantly improve the accuracy of QoS prediction for edge computing, which suffers from cold-start problem.

Strategy for Task Offloading of Multi-user and Multi-server Based on Cost Optimization in Mobile Edge Computing Environment

  • He, Yanfei;Tang, Zhenhua
    • Journal of Information Processing Systems
    • /
    • v.17 no.3
    • /
    • pp.615-629
    • /
    • 2021
  • With the development of mobile edge computing, how to utilize the computing power of edge computing to effectively and efficiently offload data and to compute offloading is of great research value. This paper studies the computation offloading problem of multi-user and multi-server in mobile edge computing. Firstly, in order to minimize system energy consumption, the problem is modeled by considering the joint optimization of the offloading strategy and the wireless and computing resource allocation in a multi-user and multi-server scenario. Additionally, this paper explores the computation offloading scheme to optimize the overall cost. As the centralized optimization method is an NP problem, the game method is used to achieve effective computation offloading in a distributed manner. The decision problem of distributed computation offloading between the mobile equipment is modeled as a multi-user computation offloading game. There is a Nash equilibrium in this game, and it can be achieved by a limited number of iterations. Then, we propose a distributed computation offloading algorithm, which first calculates offloading weights, and then distributedly iterates by the time slot to update the computation offloading decision. Finally, the algorithm is verified by simulation experiments. Simulation results show that our proposed algorithm can achieve the balance by a limited number of iterations. At the same time, the algorithm outperforms several other advanced computation offloading algorithms in terms of the number of users and overall overheads for beneficial decision-making.

A Study on Mobility-Aware Edge Caching and User Association Algorithm (이동성 기반의 엣지 캐싱 및 사용자 연결 알고리즘 연구)

  • TaeYoon, Lee;SuKyoung, Lee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.2
    • /
    • pp.47-52
    • /
    • 2023
  • Mobile Edge Computing(MEC) is considered as a promising technology to effectively support the explosively increasing traffic demands. It can provide low-latency services and reduce network traffic by caching contents at the edge of networks such as Base Station(BS). Although users may associate with the nearest BSs, it is more beneficial to associate users to the BS where the requested content is cached to reduce content download latency. Therefore, in this paper, we propose a mobility-aware joint caching and user association algorithm to imporve the cache hit ratio. In particular, the proposed algorithm performs caching and user association based on sojourn time and content preferences. Simulation results show that the proposed scheme improves the performance in terms of cache hit ratio and latency as compared with existing schemes.

Knowledge Recommendation Based on Dual Channel Hypergraph Convolution

  • Yue Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.11
    • /
    • pp.2903-2923
    • /
    • 2023
  • Knowledge recommendation is a type of recommendation system that recommends knowledge content to users in order to satisfy their needs. Although using graph neural networks to extract data features is an effective method for solving the recommendation problem, there is information loss when modeling real-world problems because an edge in a graph structure can only be associated with two nodes. Because one super-edge in the hypergraph structure can be connected with several nodes and the effectiveness of knowledge graph for knowledge expression, a dual-channel hypergraph convolutional neural network model (DCHC) based on hypergraph structure and knowledge graph is proposed. The model divides user data and knowledge data into user subhypergraph and knowledge subhypergraph, respectively, and extracts user data features by dual-channel hypergraph convolution and knowledge data features by combining with knowledge graph technology, and finally generates recommendation results based on the obtained user embedding and knowledge embedding. The performance of DCHC model is higher than the comparative model under AUC and F1 evaluation indicators, comparative experiments with the baseline also demonstrate the validity of DCHC model.

Improved Drone Delivery System Through User Authentication and Mission Automation Using EdgeCPS (EdgeCPS를 활용한 사용자 인증 및 임무 자동화를 통한 드론 배송 시스템 개선)

  • MinGuen Cho;MinKi Beak;EuTeum Choi;DongBeom Ko;SungJoo Kang;SeongJin Lee
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.4
    • /
    • pp.141-150
    • /
    • 2023
  • Currently, various companies are actively participating in research and development of drone delivery services. Existing studies do not comprehensively provide integrated functions for future drone delivery services such as mission automation, customer verification, and overcoming performance limitations, which can lead to high manpower demand, reduced user service trust, and potentially overloading low-end devices. Therefore, this study proposes a drone mission automation system (DMAS) using EdgeCPS technology to provide the three aforementioned functions in an integrated manner. Real-world experiments were conducted to evaluate the proposed system, demonstrating that the DMAS components operate according to the specified roles in the delivery scenario. In addition, the system achieved user verification with a similarity of more than 90% in the process of receiving the product, and verified a faster inference speed and a lower resource share than the existing method.