## 3 MSVPC Design and Implementation
### Adaptive Video Streaming  
Each particle \(P\) will bring some possible solutions with current and previous experiences. A network has a limited number of particle swarms \(P~{}=~{}(p_{1}\ldots p_{2}~{}\ldots p_{n})\) within its boundaries. Its moving speed \(S\) at a time \(t\) and its ideal resting location \(R_{L}=(r_{t1}\ldots r_{t2}~{}\ldots r_{ln}~{})\) are calculated as per the below mentioned Equation (5)  
\[R_{L}=S_{t}\alpha+S_{V\alpha}(LR_{L}-R_{L})+S_{Vb}(L_{B}-R_{L}) \tag{5}\]  
Here, \(S_{V\alpha}\) and \(S_{Vb}\) have explained the continuous transmission speed variations and nodes moving variations inside the network, \(\alpha\) is the tuning parameter of the speed, \(LR_{L}\) is the last resting location during the mobility and \(L_{B}\) is the local best resting location among the set of selected locations with coverage area \(C_{R}\). At this point, the \(R_{L}\) is computed as per Equation (6), later updates the current \(R_{L}\) as the last \(LR_{L}\) and updates new one to obtain the movement points and also the movement speed \(S_{t+1}\) at the time obtained from the maximum and minimum speeds of the particle. \[R_{L}=R_{L(t)}+S_{t+1} \tag{6}\]  
\[LR_{L}=R_{L} \tag{7}\]  
\[L_{B}=BestR_{L}(r_{t1}..r_{t2}~{}..r_{ln})\to C_{R} \tag{8}\]  
Here \(L_{B}\) is the lowest boundary of the resting location. The travelling delay \(T_{D}\) has been computed from the summation of packet buffering delay \(B_{D}\) and transmission channel propagation delay \(P_{D}\), and due to the transmission and because of the wireless nature, the packet transmission error \(E_{T}\) can occur, the error difference \(E_{D}\) is also calculated. The last transmission packet is \(T_{PL}\) and the current transmission packets is \(T_{P}\) respectively. \[T_{D}~{}=~{}(B_{D}+P_{D}) \tag{9}\]  
\[E_{D}=~{}T_{PL}-T_{P} \tag{10}\]  
\(E_{D}\) should be minimum level than the error difference threshold of \(E_{DT}\), \(E_{D}\leq~{}E_{DT}\). All these computations should be done before the packet expiry time along with the network state. These metrics provide the best quality of service in the network. Multiple benchmark decisions have been considered during the video transmission period to handle the storage and user query as shown in Figure 4.  
Design considerations:  
* Analyse packet expiry computations before and after;
* Reduce the data packets loss;
* To reduce the error rate of the transmission computed;
* Links are congested, causing packet buffer overflow at the networking device;
* Network reachability status changes causing certain packets to become destination unreachable and be dropped. The variations of the packet drop are shown in Table 1. \begin{table}
\begin{tabular}{c c c c} \hline \hline \multirow{2}{*}{**Number of Users**} & **ALVN** & **SVNVO** & **MSVPC** \\ \cline{2-4}  & **Average Data Drop** & **Average Data Drop** & **Average Data Drop** \\ \hline
10 & 1.31\% & 1.29\% & 0.7\% \\
20 & 2.33\% & 2.29\% & 0.9\% \\
30 & 2.35\% & 2.30\% & 0.19\% \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Packet drops. The above Table 2 shows the quality of the transmission according to the packet loss percentage. Occasionally there will be several changes in the aims mentioned above. It can be calculated as follows. It is necessary to find the optimal position. \[\sum\mathrm{T_{i}}\delta\mathrm{f_{i}(\mathrm{C_{i}})}-\sum\sum\mathrm{T_{m}} \delta\mathrm{f_{m}(\mathrm{C_{m}})},\ \forall\mathrm{m}\ =\ 1,2\ldots\mathrm{m} \tag{11}\]  
When a lot of metrics of this type are available, they are all stored in a matrix format in which the optimal solution is calculated. When different videos are transferred, many limitations occur. Similarly, many different functions \(\mathrm{f_{i}}\) occur during transmission, so it is important to find transmissions with minimal variations. This will help us to find the optimal transmissions. Thus, we calculate the transmission rate of optimal video streaming.