scholarly journals Delay-Sensitive Task Offloading in the 802.11p-Based Vehicular Fog Computing Systems

2020 ◽  
Vol 7 (1) ◽  
pp. 773-785 ◽  
Author(s):  
Qiong Wu ◽  
Hanxu Liu ◽  
Ruhai Wang ◽  
Pingyi Fan ◽  
Qiang Fan ◽  
...  
Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2512 ◽  
Author(s):  
Faten Alenizi ◽  
Omer Rana

Fog computing is a potential solution to overcome the shortcomings of cloud-based processing of IoT tasks. These drawbacks can include high latency, location awareness, and security—attributed to the distance between IoT devices and cloud-hosted servers. Although fog computing has evolved as a solution to address these challenges, it is known for having limited resources that need to be effectively utilized, or its advantages could be lost. Computational offloading and resource management are critical to be able to benefit from fog computing systems. We introduce a dynamic, online, offloading scheme that involves the execution of delay-sensitive tasks. This paper proposes an architecture of a fog node able to adjust its offloading threshold dynamically (i.e., the criteria by which a fog node decides whether tasks should be offloaded rather than executed locally) using two algorithms: dynamic task scheduling (DTS) and dynamic energy control (DEC). These algorithms seek to minimize overall delay, maximize throughput, and minimize energy consumption at the fog layer. Compared to other benchmarks, our approach could reduce latency by up to 95%, improve throughput by 71%, and reduce energy consumption by up to 67% in fog nodes.


Author(s):  
Faten Alenizi ◽  
Omer Rana

Fog computing is a potential solution to overcome the shortcomings of the cloud computing processing of IoT tasks. These drawbacks can be high latency, location awareness and security, and it is attributed to the distance between IoT devices and servers, network congestion and other variables. Although fog computing has evolved as a solution to these challenges, it is known for having limited resources that need to be consciously utilised, or any of its ad-vantages would be lost. Computational offloading and resource management are critical concerns to be considered to get maximum benefit of the available resource at fog computing systems and benefit from its advantages. Computational offloading and resource management are important issues to be considered to get maximum benefit of the available resource at fog computing systems and benefit from its advantages. In this article, in vehicular traffic applications, we introduce a dynamic online offloading scheme that involves the execution of delay-sensitive ac-tivities. This paper proposes an architecture of a fog node that enables a fog node to adjust its offloading threshold dynamically (i.e., the criteria by which a fog node decides whether tasks should be offloaded rather than executed locally) using two algorithms: dynamic task scheduling (DTS) and dynamic energy control (DEC). These algorithms seek to solve an optimisation problem aimed at minimising overall delay, improving throughput, and minimising energy consumption at the fog layer, while maximising the use of resource-constrained fog nodes. Compared with other benchmarks, our approach can reduce the delay by up to 95.38% and reduce energy consumption by up to 67.71% in fog nodes. Additionally, this approach enhances throughput by 71.08%.


2021 ◽  
Vol 17 (3) ◽  
pp. 155014772110017
Author(s):  
Han-Yu Lin

Fog computing is viewed as an extended technique of cloud computing. In Internet of things–based collaborative fog computing systems, a fog node aggregating lots of data from Internet of things devices has to transmit the information to distributed cloud servers that will collaboratively verify it based on some predefined auditing policy. However, compromised fog nodes controlled by an adversary might inject bogus data to cheat or confuse remote servers. It also causes the waste of communication and computation resources. To further control the lifetime of signing capability for fog nodes, an appropriate mechanism is crucial. In this article, the author proposes a time-constrained strong multi-designated verifier signature scheme to meet the above requirement. In particular, a conventional non-delegatable strong multi-designated verifier signature scheme with low computation is first given. Based on its constructions, we show how to transform it into a time-constrained variant. The unforgeability of the proposed schemes is formally proved based on the famous elliptic curve discrete logarithm assumption. The security requirement of strong signer ambiguity for our substantial constructions is also analyzed by utilizing the intractable assumption of decisional Diffie–Hellman. Moreover, some comparisons in terms of the signature size and computational costs for involved entities among related mechanisms are made.


Sign in / Sign up

Export Citation Format

Share Document