Prior study suggests that VANET has two types of communications: Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communications. V2V is very important and ensures cooperative communications between vehicles and safety measures. It is also defined as Inter-Vehicle Communication (IVC).The communication is based on clustering the nodes to transmit the data from vehicle to vehicle. The overhead and stability are considered as main challenges that need to be addressed during vehicle intersections. In this paper, a novel self-adaptable Angular based k-medoid Clustering Scheme (SAACS) is proposed to form flexible clusters. The clusters are formed by estimating the road length and transmission ranges to minimize the network delay. And the Cluster Head (CH) is elected from a novel performance metric, ‘cosine-based node uncoupling frequency,’ that finds the best nodes irrespective of their current network statistics. The parametric analysis varies according to the number of vehicular nodes with the transmission range. The experimental results have proven that the proposed technique serves better in comparison to existing approaches such as Cluster Head Lifetime (CHL), Cluster Member Lifetime (CML), Cluster Number (CL), Cluster Overhead (CO), Packet Loss Ratio (PLR) and Average Packet Delay (APD). CHL is enhanced 40% as compare to Real-Time Vehicular Communication (RTVC), Efficient Cluster Head Selection (ECHS) whereas CML is 50% better than RTVC and ECHS. Packet loss ratio and overhead is 45% better in our proposed algorithm than RTVC and ECHS. It is observed from the results that the incorporation of cosine-based node uncoupling frequency has minimized the incongruity between vehicular nodes placed in dense and sparse zones of highways.

中文翻译：

---

用于动态 VANETs 的基于角的自适应 K-Medoid 聚类方案 (SAACS)

先前的研究表明，VANET 具有两种类型的通信：车对车 (V2V) 和车对基础设施 (V2I) 通信。V2V 非常重要，可确保车辆之间的协作通信和安全措施。它也被定义为车辆间通信（IVC）。通信基于集群节点以在车辆之间传输数据。开销和稳定性被认为是车辆交叉路口需要解决的主要挑战。在本文中，提出了一种新颖的基于Angular的自适应k-medoid聚类方案（SAACS）来形成灵活的聚类。通过估计道路长度和传输范围来形成集群，以最小化网络延迟。簇头 (CH) 是从一种新颖的性能指标“基于余弦的节点解耦频率”中选出的，' 可以找到最好的节点，而不管它们当前的网络统计信息如何。参数分析根据车辆节点的数量和传输范围而变化。实验结果证明，与簇头寿命（CHL）、簇成员寿命（CML）、簇数（CL）、簇开销（CO）、丢包率（PLR）等现有方法相比，所提出的技术效果更好。和平均数据包延迟 (APD)。与实时车辆通信 (RTVC)、高效簇头选择 (ECHS) 相比，CHL 增强了 40%，而 CML 比 RTVC 和 ECHS 好 50%。在我们提出的算法中，丢包率和开销比 RTVC 和 ECHS 好 45%。