Skip to main content

Fog Computing

 

Fog computing was established by Cisco to expand cloud computing to edge nodes/devices. It has memory constraints and low computing capacity, especially for IoT devices. Let's start with a definition of cloud. When we connect an IoT device to the internet, we must first connect to the cloud. The IoT devices are then controlled by our mobile phone, app, or website. When we wish to connect to our IoT devices, we first link to a cloud server using our mobile phone, app, or website, then the cloud communicates with the IoT devices and sends data to the cloud, and finally the cloud connects to our devices, cellphones, apps, or websites.


We all know that IoT devices are primarily used to collect data from the environment. It can be utilised as sensors, cameras on the road, or parking places, for example. When IoTs are utilised as sensor devices, they produce specified outputs in response to changes in input phenomena such as heat, smoke, air pollution, and so on.


As you can see, the signal must travel a great distance from the mobile phone to the cloud server, then cloud server to IoT, then IoT to server again and then from the cloud server to your device. It uses a significant amount of delay. Assume that if there are a large number of IoT devices to connect, there will be bandwidth congestion. As a result, the connection becomes slower.


On the other hand, we don't necessarily require a cloud server to analyse all types of data or do calculations. We can achieve the same thing with connected intermediate nodes or gateways that are capable of performing some processing or calculations on their own or using previously stored datasets from cloud processing or computing. Fog nodes are a type of intermediate node or gateway. For example, you may be aware that getting a parking space in urban locations is becoming increasingly difficult. In this situation, we can use Internet of Things (IoT) cameras in the parking slots. The camera's functions will include taking photographs of cars in the parking space at predetermined intervals. The raw data is then sent to fog nodes, which analyse it and identify any empty parking spaces before sending it to the cloud to show updates about number of empty slots. We expect artificial intelligence to process the raw data in a nearby fog node in this scenario.


Consider the case where there is no fog node: we must first send all raw data to the cloud for processing or computing. To transmit all raw data to the cloud, a lot of bandwidth is required. Can you imagine the situation if there are billions of IoTs connected to the cloud at same time?


On the other hand, we've already discussed the expectation that all fog nodes will have a specific computing capacity. It can also process data according to a previously saved dataset that is scheduled to be updated in a short period of time. Fog nodes, in this way, reduce network overload, bandwidth congestion, and, most importantly, latency. For instance, we'd like to connect our sensors (IoTs) to the internet. If the sensor receives any input, it sends raw data to a neighbouring data centre (cloud server). If there are no fog nodes, it might be 1000 kilometres away from the sensor devices. If a fog node is present, it processes raw data locally. This improves service quality by lowering bandwidth congestion and latency, allowing IoT devices to operate in real time.



People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...

📘 Overview of BER and SNR 🧮 Online Simulator for BER calculation of m-ary QAM and m-ary PSK 🧮 MATLAB Code for BER calculation of M-ary QAM, M-ary PSK, QPSK, BPSK, ... 📚 Further Reading 📂 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 🧮 Online Simulator for Constellation Diagram of m-ary QAM 🧮 Online Simulator for Constellation Diagram of m-ary PSK 🧮 MATLAB Code for BER calculation of ASK, FSK, and PSK 🧮 MATLAB Code for BER calculation of Alamouti Scheme 🧮 Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received (after the demodulation process) compared to the total number of bits sent in a communication process. BER = (number of bits received in error) / (total number of tran...

Constellation Diagrams of ASK, PSK, and FSK

📘 Overview of Energy per Bit (Eb / N0) 🧮 Online Simulator for constellation diagrams of ASK, FSK, and PSK 🧮 Theory behind Constellation Diagrams of ASK, FSK, and PSK 🧮 MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 📚 Further Reading 📂 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 🧮 Simulator for constellation diagrams of m-ary PSK 🧮 Simulator for constellation diagrams of m-ary QAM BASK (Binary ASK) Modulation: Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1.    BFSK (Binary FSK) Modulation: Transmits one of two signals: +√Eb​ ( On the y-axis, the phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...

Power Spectral Density Calculation Using FFT in MATLAB

📘 Overview 🧮 Steps to calculate the PSD of a signal 🧮 MATLAB Codes 📚 Further Reading Power spectral density (PSD) tells us how the power of a signal is distributed across different frequency components, whereas Fourier Magnitude gives you the amplitude (or strength) of each frequency component in the signal. Steps to calculate the PSD of a signal Firstly, calculate the first Fourier transform (FFT) of a signal Then, calculate the Fourier magnitude of the signal The power spectrum is the square of the Fourier magnitude To calculate power spectrum density (PSD), divide the power spectrum by the total number of samples and the frequency resolution. {Frequency resolution = (sampling frequency / total number of samples)} Sampling frequency (fs): The rate at which the continuous-time signal is sampled (in Hz). ...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Calculation of SNR from FFT bins in MATLAB

📘 Overview 🧮 MATLAB Code for Estimation of SNR from FFT bins of a Noisy Signal 🧮 MATLAB Code for Estimation of Signal-to-Noise Ratio from Power Spectral Density Using FFT and Kaiser Window Periodogram from real signal data 📚 Further Reading   Here, you can find the SNR of a received signal from periodogram / FFT bins using the Kaiser operator. The beta (β) parameter characterizes the Kaiser window, which controls the trade-off between the main lobe width and the side lobe level in the frequency domain. For that you should know the sampling rate of the signal.  The Kaiser window is a type of window function commonly used in signal processing, particularly for designing finite impulse response (FIR) filters and performing spectral analysis. It is a general-purpose window that allows for control over the trade-off between the main lobe width (frequency resolution) and side lobe levels (suppression of spectral leakage). The Kaiser window is defined...

MATLAB code for BER vs SNR for M-QAM, M-PSK, QPSk, BPSK, ...

🧮 MATLAB Code for BPSK, M-ary PSK, and M-ary QAM Together 🧮 MATLAB Code for M-ary QAM 🧮 MATLAB Code for M-ary PSK 📚 Further Reading MATLAB Script for BER vs. SNR for M-QAM, M-PSK, QPSK, BPSK % Written by Salim Wireless clc; clear; close all; num_symbols = 1e5; snr_db = -20:2:20; psk_orders = [2, 4, 8, 16, 32]; qam_orders = [4, 16, 64, 256]; ber_psk_results = zeros(length(psk_orders), length(snr_db)); ber_qam_results = zeros(length(qam_orders), length(snr_db)); for i = 1:length(psk_orders) psk_order = psk_orders(i); for j = 1:length(snr_db) data_symbols = randi([0, psk_order-1], 1, num_symbols); modulated_signal = pskmod(data_symbols, psk_order, pi/psk_order); received_signal = awgn(modulated_signal, snr_db(j), 'measured'); demodulated_symbols = pskdemod(received_signal, psk_order, pi/psk_order); ber_psk_results(i, j) = sum(data_symbols ~= demodulated_symbols) / num_symbols; end end for i...

Online Channel Impulse Response Simulator

  Fundamental Theory of Channel Impulse Response The fundamental theory behind the channel impulse response in wireless communication often involves complex exponential components such as: \( h(t) = \sum_{i=1}^{L} a_i \cdot \delta(t - \tau_i) \cdot e^{j\theta_i} \) Where: \( a_i \) is the amplitude of the \( i^{th} \) path \( \tau_i \) is the delay of the \( i^{th} \) path \( \theta_i \) is the phase shift (often due to Doppler effect, reflection, etc.) \( e^{j\theta_i} \) introduces a phase rotation (complex exponential) The convolution \( x(t) * h(t) \) gives the received signal So, instead of representing the channel with only real-valued amplitudes, each path can be more accurately modeled using a complex gain : \( h[n] = a_i \cdot e^{j\theta_i} \) 1. Simple Channel Impulse Response Simulator  (Here you can input only a unit impulse signal) Input Signal (Unit Impu...

Coherence Bandwidth and Coherence Time

🧮 Coherence Bandwidth 🧮 Coherence Time 🧮 MATLAB Code s 📚 Further Reading Coherence Bandwidth Coherence bandwidth is a concept in wireless communication and signal processing that relates to the frequency range over which a wireless channel remains approximately constant in terms of its characteristics. Coherence bandwidth is inversely related to the delay spread time (e.g., RMS delay spread). The coherence bandwidth is related to the delay spread of the channel, which is a measure of the time it takes for signals to traverse the channel due to multipath. The two are related by the following approximation: Coherence Bandwidth ≈ 1/(delay spread time) Or, Coherence Bandwidth ≈ 1/(root-mean-square delay spread time) (Coherence bandwidth in Hertz) For instance, if the root-mean-square delay spread is 500 ns (i.e., {1/(2*10^6)} seconds), the coherence bandwidth is approximately 2 MHz (1 / 500e-9) in ...