## 4 Numerical Analysis and Results
### Network Selection for Different Services
Output : Decision factor weight and rank of selected nework, energy efficient weight \(w^{e}\), bandwidth weight \(w^{b}\), delivery probability weight \(w^{dp}\), delay weight \(w^{d}\). 1 According to the different services of users, build the decide hierarchy structure \(P=x_{(1,j)},x_{(2,j)},...,x_{(M,i)}\);
2 Loop 1: Construct decision Matrix P;
3 Loop 2: Calculate the weight of hierarchy \(x_{(M,j)}\); including energy-efficient weight \(w^{e}\), bandwidth weight \(w^{b}\), data volume weight \(w^{d}v\), and the delay weight \(w^{d}\) of the heirarchy;
4 Decide whether hierarchy \(z_{(i,j)}\) is consistent;
5 If not, go back to **Loop 1**;
6 If \(z_{(i,j)}<N\), go back to **Loop 2**;
7 Calculate the total weights, then attain the energy-efficient weight \(w^{e}\), bandwidth weight \(w^{b}\), delivery probability weight \(w^{dp}\), and delay weight \(w^{d}\);
8 Decide whether the whole hierarchy is consistent; if not, go back to **Loop 1**;
9 Obtain the final priority vector for all attributes;
10 Rank the network-selection score;
11 Exit the procedure. ```

**Algorithm 1**Optimal Network Selection

Figure 12: Weight distributed to all attributes as per different services. Figure 13: Priority vector for all services. The AHP score is the final ranking of all the services as per the preferences given for all the attributes. For service 1, the ranking order is \(\mathit{Vehicle}>\mathit{WLAN}>\mathit{UTMS}\), as the data is delay-tolerant and can be carried by vehicles for energy-efficient data-dissemination, as shown in Figure 14. However, service 2, which is delay-sensitive but for a larger volume than service 1, also gives preference to vehicular networks for data-delivery, rather than WLAN and UMTS, with a ranking order \(\mathit{Vehicle}>\mathit{WLAN}>\mathit{UTMS}\). For service 3, the network ranking preference is in the order of \(\mathit{WLAN}>\mathit{UMTS}>\mathit{Vehicle}\) for the urgent delivery of data so as to sustain QoS. In network dynamics, the most important factor is packet delivery without loss. Our heterogeneous network architecture guarantees the delivery of data by using any of the available networks and considering different attributes. ### Case Study II

We conduct a numerical example to allocate different demands generated from DC on buses to carry data until the destination, while minimizing energy consumption. We consider 16 demands generated randomly from different bus stops to deliver their data carried by bus. As shown in Figure 15, there are many bus stops around and demands have been allocated to the DC for data allocation onto the suitable bus. The controller will make an energy-efficient decision based upon Equation 13. DC is the central depot, where the bus begins and finishes its journey. As per Table 12, different data demands are generated for data being delivered from the parent stop to the destination stop. The controller identifies 4 buses, B1, B2, B3, and B4, to fulfill all demands with an energy-efficient solution. The total capacity of each bus is 150 TB. The distance to each bus stop has been given from the central depot or source bus stop. The demands must not exceed the maximum capacity of the bus. We use CVRP instances from the past and solve using the Cplex optimization solver. The Capacitated Vehicle Routing Problem is an NP-hard problem that can be solved exactly only for small instances. We have tested our objective function and observed an optimal solution while minimizing energy consumption. We assume that buses are available to carry data towards each bus stop. However, we will be calculating energy consumption while sending data through a traditional network to show via comparison that PTDD is an energy-efficient solution for delay-tolerant data applications. Figure 14: Network ranking for all services. As per the defined parameters, we have allocated data onto four buses that fulfill all requirements while minimizing energy consumption and returning to the source bus stop or depot after finishing their trips.