• Title/Summary/Keyword: Edge Cost

Search Result 397, Processing Time 0.03 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.

Smart Anti-jamming Mobile Communication for Cloud and Edge-Aided UAV Network

  • Li, Zhiwei;Lu, Yu;Wang, Zengguang;Qiao, Wenxin;Zhao, Donghao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4682-4705
    • /
    • 2020
  • The Unmanned Aerial Vehicles (UAV) networks consisting of low-cost UAVs are very vulnerable to smart jammers that can choose their jamming policies based on the ongoing communication policies accordingly. In this article, we propose a novel cloud and edge-aided mobile communication scheme for low-cost UAV network against smart jamming. The challenge of this problem is to design a communication scheme that not only meets the requirements of defending against smart jamming attack, but also can be deployed on low-cost UAV platforms. In addition, related studies neglect the problem of decision-making algorithm failure caused by intermittent ground-to-air communication. In this scheme, we use the policy network deployed on the cloud and edge servers to generate an emergency policy tables, and regularly update the generated policy table to the UAVs to solve the decision-making problem when communications are interrupted. In the operation of this communication scheme, UAVs need to offload massive computing tasks to the cloud or the edge servers. In order to prevent these computing tasks from being offloaded to a single computing resource, we deployed a lightweight game algorithm to ensure that the three types of computing resources, namely local, edge and cloud, can maximize their effectiveness. The simulation results show that our communication scheme has only a small decrease in the SINR of UAVs network in the case of momentary communication interruption, and the SINR performance of our algorithm is higher than that of the original Q-learning algorithm.

Trend of Edge Machine Learning as-a-Service (서비스형 엣지 머신러닝 기술 동향)

  • Na, J.C.;Jeon, S.H.
    • Electronics and Telecommunications Trends
    • /
    • v.37 no.5
    • /
    • pp.44-53
    • /
    • 2022
  • The Internet of Things (IoT) is growing exponentially, with the number of IoT devices multiplying annually. Accordingly, the paradigm is changing from cloud computing to edge computing and even tiny edge computing because of the low latency and cost reduction. Machine learning is also shifting its role from the cloud to edge or tiny edge according to the paradigm shift. However, the fragmented and resource-constrained features of IoT devices have limited the development of artificial intelligence applications. Edge MLaaS (Machine Learning as-a-Service) has been studied to easily and quickly adopt machine learning to products and overcome the device limitations. This paper briefly summarizes what Edge MLaaS is and what element of research it requires.

A Note on the Propeller Rotational Speed Increase due to the Propeller Blade Edge Modification (프로펠러 Edge 수정에 의한 프로펠러 회전수 증가에 관한 소고)

  • 최군일;김동진;박명규
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.17 no.2
    • /
    • pp.1-8
    • /
    • 1993
  • The cases and the treatments of the rotational speed losses of marine propellers are examined and practical modification methods are discussed. The cutting of the propeller diameter, the modification of propeller pitch and the propeller blade edge modification are briefly reviewed. An example for the propeller blade edge modification, which is regarded to have advantages in cost and workmanship, is presented for a propeller of a large ship.

  • PDF

Fast Stereo Matching Algorithm using Edge Projection

  • Ha, Jong-Eun;Kang, Dong-Joong;Kim, Jin-Young;Kim, Min-Sung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2389-2392
    • /
    • 2005
  • We present fast stereo matching algorithm using edge projection. Traditional stereo matching algorithm uses 2D template for the search of corresponding point thus it requires huge the computational cost. In this paper, we reduce the 2D search problem into 1D using edge projection along vertical and horizontal direction inside the region of interest. Also, by accumulation of edge projection along vertical and horizontal direction, the edge projection within the region of interest could simply be obtained by just subtracting two values. Experimental results show that matching algorithm using edge projection also gives comparable discriminating power compared to that of using intensity.

  • PDF

An Offloading Scheduling Strategy with Minimized Power Overhead for Internet of Vehicles Based on Mobile Edge Computing

  • He, Bo;Li, Tianzhang
    • Journal of Information Processing Systems
    • /
    • v.17 no.3
    • /
    • pp.489-504
    • /
    • 2021
  • By distributing computing tasks among devices at the edge of networks, edge computing uses virtualization, distributed computing and parallel computing technologies to enable users dynamically obtain computing power, storage space and other services as needed. Applying edge computing architectures to Internet of Vehicles can effectively alleviate the contradiction among the large amount of computing, low delayed vehicle applications, and the limited and uneven resource distribution of vehicles. In this paper, a predictive offloading strategy based on the MEC load state is proposed, which not only considers reducing the delay of calculation results by the RSU multi-hop backhaul, but also reduces the queuing time of tasks at MEC servers. Firstly, the delay factor and the energy consumption factor are introduced according to the characteristics of tasks, and the cost of local execution and offloading to MEC servers for execution are defined. Then, from the perspective of vehicles, the delay preference factor and the energy consumption preference factor are introduced to define the cost of executing a computing task for another computing task. Furthermore, a mathematical optimization model for minimizing the power overhead is constructed with the constraints of time delay and power consumption. Additionally, the simulated annealing algorithm is utilized to solve the optimization model. The simulation results show that this strategy can effectively reduce the system power consumption by shortening the task execution delay. Finally, we can choose whether to offload computing tasks to MEC server for execution according to the size of two costs. This strategy not only meets the requirements of time delay and energy consumption, but also ensures the lowest cost.

Efficient Simplification of a Height Map (지형 데이터의 효율적 단순화)

  • Park, Sang-Chul;Kim, Jung-Hoon;Chung, Yong-Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.2
    • /
    • pp.132-139
    • /
    • 2012
  • Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

Numerical Study on The Effects of Blade Leading Edge Shape to the Performance of Supersonic Rotors (초음속 회전익의 앞전 형상이 공력 성능에 미치는 효과에 대한 수치적 연구)

  • Park, Kicheol
    • 유체기계공업학회:학술대회논문집
    • /
    • 2001.11a
    • /
    • pp.149-155
    • /
    • 2001
  • Recently, it is required to design higher stage pressure ratio compressor while maintaining equal adiabatic efficiency. To increase the stage pressure ratio, blade rotational speed or diffusion factor should be increased. In the case of increasing rotational speed, relative speed of flow at blade leading edge is well supersonic. In supersonic blade, total pressure loss is mainly due to shock wave and blade leading edge thickness should be very thin to minimize the shock wave loss. As a result, the blade is like to be week in terms of mechanical strength and the manufacturing cost is very high because NC machining is necessary. It is also one of big hurdle to overcome to make small compressor. In this paper, the effects of blade leading edge to the performance of supersonic blade In terms of total pressure loss. The efficiency of already known method to make thin blade leading edge from the casted blade with rather thick leading edge thickness is also assessed.

  • PDF

An Efficient Local Search Algorithm for the Asymmetric Traveling Salesman Problem Using 3-Opt (비대칭 외판원문제에서 3-Opt를 이용한 효율적인 국지탐색 알고리즘)

  • 김경구;권상호;강맹규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.59
    • /
    • pp.1-10
    • /
    • 2000
  • The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

  • PDF

Mechanism for Connecting Input Edges Using Steiner Tree (스타이너 트리를 이용한 입력 선분의 연결)

  • Kim, Joon-Mo;Kim, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.213-220
    • /
    • 2010
  • In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.