Algorithm 1: For Vehicles/Nodes request to cloud.

Input: Request type

Output: List of request L1.

1.  for $(i=1;i<=n;i++)$

// vehicle request $i=\{1,2,3,\cdots n\}$

2.   $S=\{j1,j2,j3,\cdots jn\}$

// $S=$ Request Type (vehicle can send multiple requests such as nearest ATM, nearest petrol pump, natural disaster, police helpline, rescue, etc.

// $i=1\cdots ,n$ are vehicles.

3.   L1= Add request of vehicle (i) // vehicle $\left(i\right)=S=\{S1,S2,S3\cdots Sn\}$

4.   Return L1

5.   End of for