## 3 System Model Overview
Interest Drop Fraction (IDF %) As shown in Figure 9, the IDF of the proposed scheme decreases with an increasing number of vehicles because it uses \(CIT\) entries to handle the disruptive communication links. In the case of COMP, the IDF is high because with disruptive communication links, the link establishment process starts again. IBFS starts broadcasting on disruptive communication links so its IDF is high with an increasing number of vehicles. So, using \(CIT\) entries and V2I communication in the proposed scheme ensures less IDF compared to IBFS, COMP, and MCRP2. Figure 8: Average Communication Delay of Multihead Selection Scheme. Figure 7: Packet Delivery Ratio of Multihead Selection Scheme. 4. Cache Success Ratio (CSR) CSR is the number of successful packets satisfied in the cluster. As shown in Figure 10, the CSR of the proposed scheme is higher than COMP because it grouped the vehicles with the same interest. The maximum interests are satisfied by the \(HV\). If the content is not available, then \(HV\) forwards the interest to RSU. In the context of disruptive communication links, the RSU has a list of other nominated \(HV\). Therefore, instead of re-selection of \(HV\), the new \(HV\) is nominated by RSU to satisfy the interest packets. In the case of COMP, to satisfy the interest packet on disruptive communication links, the cluster \(HV\) selection starts again. It decreases the CSR in COMP. IBFS and MCRP2 also show increments in CSR but lower than the proposed scheme. ## 5 Conclusions and Future Work

Similar-interest vehicles are clustered together to satisfy requests through head vehicles. However, vehicles are highly mobile nodes and change topology frequently. If the

Figure 10: Cache Success ratio of Multihead Selection Scheme. Figure 9: Interest packet Drop Fraction of Multihead Selection Scheme. vehicles create disruptive communication links, then it creates a broadcasting storm. Moreover, if the head vehicle moves out of the cluster, then the head vehicle selection process starts again. Therefore, the proposed scheme, namely mitigating the broadcasting storm using multihead nomination clustering in a vehicular-content-centric network, provides efficient communication within the minimum delay. It clusters the vehicles that have the same interest in the network. It extends the hello packet header to fetch the information from the vehicles. This information is used to select the \(HV\) of the cluster to satisfy the maximum interest of the network. Moreover, if the interesting content is not available in the network, instead of forwarding individual interest packets by vehicles to the RSU, the proposed scheme only allows \(HV\) to forward the interest packet to RSU and receive the response. There could be a number of vehicles nominated as the \(HV\). In this case, the proposed scheme maintains the nominations in the \(CIT\) on the RSU. In the case of disruptive communication links due to \(HV\) mobility, the RSU uses those CIT entries to select the new \(HV\). It eliminates the broadcasting storm and excessive packet flooding in the network. Moreover, it minimizes the communication delay and the network load. If the content is not available in the network, then RSU satisfies the interest of the network. It increases the packet delivery ratio. The results show that the proposed scheme achieves high PDR within minimum delay and less IDF compared to other routing protocols. The proposed scheme increases the communication efficiency of clustered vehicular networks. The proposed scheme provides an efficient methodology for selection of head vehicles and broadcasting storm mitigation in a highly dynamic network. However, vehicles have limited caching capacity, and the proposed scheme did not provide any content caching mechanism. In the future, we will work on the content update and caching scheme based on a multi-criteria content selection technique. We also aim to implement the proposed scheme in the real world. Conceptualization, A.S. and M.D. ; Investigation, D.K. ; Methodology, A.S. and D.K.