Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "FOG" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Mode selection, caching and physical layer security for fog networks
Autorzy:
Basir, Rabeea
Chughtai, Naveed Ahmad
Ali, Mudassar
Qaisar, Saad
Hashmi, Anas
Powiązania:
https://bibliotekanauki.pl/articles/2173711.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
IoT
Internet of Things
fog network
secrecy
optimization
Internet Rzeczy
mgła obliczeniowa
tajność
optymalizacja
Opis:
Fog networks facilitate ultra-low latency through the use of data availability near the network edge in fog servers. Existing work in fog networks considers the objective of energy efficiency and low latency for internet-of-things (IoT) for resource allocation. These works provide solutions to energy efficiency and low latency resource allocation problem without consideration of secure communication. This article investigates the benefits of fog architecture from the perspective of three promising technologies namely device-to-device (D2D) communication, caching, and physical layer security. We propose security provisioning followed by mode selection for D2D-assisted fog networks. The secrecy rate maximization problem is formulated first, which belongs to mixed-integer nonlinear programming (MINLP) problem. It is NP-hard, that is why an exhaustive search for finding the solution is complex. Keeping in view the complexity, a nonlinear technique namely outer approximation algorithm (OAA) is applied. OAA is a traditional algorithm, whose results are compared with the proposed heuristic algorithm, namely the security heuristic algorithm (SHA). Performance of the network is observed for the different numbers of eavesdroppers, IoT nodes, and fog nodes.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 5; art. no. e142652
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graph-based fog computing network model
Autorzy:
Pysmennyi, Ihor
Petrenko, Anatolii
Kyslyi, Roman
Powiązania:
https://bibliotekanauki.pl/articles/1837778.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
software-defined networks
fog computing
smart sensors
IoT
sieci definiowalne programowo
mgła obliczeniowa
inteligentne czujniki
Opis:
IoT networks generate numerous amounts of data that is then transferred to the cloud for processing. Transferring data cleansing and parts of calculations towards these edge-level networks improves system’s, latency, energy consumption, network bandwidth and computational resources utilization, fault tolerance and thus operational costs. On the other hand, these fog nodes are resource-constrained, have extremely distributed and heterogeneous nature, lack horizontal scalability, and, thus, the vanilla SOA approach is not applicable to them. Utilization of Software Defined Network (SDN) with task distribution capabilities advocated in this paper addresses these issues. Suggested framework may utilize various routing and data distribution algorithms allowing to build flexible system most relevant for particular use-case. Advocated architecture was evaluated in agent-based simulation environment and proved its’ feasibility and performance gains compared to conventional event-stream approach.
Źródło:
Applied Computer Science; 2020, 16, 4; 5-20
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing
Autorzy:
Li, Shiyong
Zhang, Yanan
Sun, Wei
Liu, Jia
Powiązania:
https://bibliotekanauki.pl/articles/15548021.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fog computing
combinatorial auction
time varying multidimensional resource allocation
resource pricing
mgła obliczeniowa
aukcja kombinatoryczna
wycena zasobów
Opis:
It is a hot topic to investigate resource allocation in fog computing. However, currently resource allocation in fog computing mostly supports only fixed resources, that is, the resource requirements of users are satisfied with a fixed amount of resources during the usage time, which may result in low utility of resource providers and even cause a waste of resources. Therefore, we establish an integer programming model for the time-varying multidimensional resource allocation problem in fog computing to maximize the utility of the fog resource pool. We also design a heuristic algorithm to approximate the solution of the model. We apply a dominant-resource-based strategy for resource allocation to improve resource utilization as well as critical value theory for resource pricing to enhance the utility of the fog resource pool. We also prove that the algorithm satisfies truthful and individual rationality. Finally, we give some numerical examples to demonstrate the performance of the algorithm. Compared with existing studies, our approach can improve resource utilization and maximize the utility of the fog resource pool.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 327--339
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decentralized device authentication for cloud systems with blockchain using skip graph algorithm
Autorzy:
Sammy, F.
Vigila, S. Maria Celestin
Powiązania:
https://bibliotekanauki.pl/articles/38700867.pdf
Data publikacji:
2023
Wydawca:
Instytut Podstawowych Problemów Techniki PAN
Tematy:
blockchain
cloud computing
edge computing
fog computing
latency
power consumption
ID algorithm
single point failure
skipgraph
łańcuch bloków
chmura obliczeniowa
przetwarzanie brzegowe
mgła obliczeniowa
czas oczekiwania
pobór energii
algorytm ID
awaria jednego punktu
przeskok
Opis:
Cloud computing provides centralized computing services to the user on demand. Despite this sophisticated service, it suffers from single-point failure, which blocks the entire system. Many security operations consider this single-point failure, which demands alternate security solutions to the aforesaid problem. Blockchain technology provides a corrective measure to a single-point failure with the decentralized operation. The devices communicating in the cloud environment range from small IoT devices to large cloud data storage. The nodes should be effectively authenticated in a blockchain environment. Mutual authentication is time-efficient when the network is small. However, as the network scales, authentication is less time-efficient, and dynamic scalability is not possible with smart contract-based authentication. To address this issue, the blockchain node runs the skip graph algorithm to retrieve the registered node. The skip graph algorithm possesses scalability and decentralized nature, and retrieves a node by finding the longest prefix matching. The worst time complexity is O(log n) for maximum n nodes. This method ensures fast nodal retrieval in the mutual authentication process. The proposed search by name id algorithm through skip graph is efficient compared with the state-of-art existing work and the performance is also good compared with the existing work where the latency is reduced by 30–80%, and the power consumption is reduced by 32–50% compared to other considered approaches.
Źródło:
Computer Assisted Methods in Engineering and Science; 2023, 30, 2; 203-221
2299-3649
Pojawia się w:
Computer Assisted Methods in Engineering and Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies