## 4 Execution of MAMC-MAC Protocol
### Clustering Mechanism  
Our proposed scenario makes use of the clustering topology for safety message distribution. Clustering of nodes is performed depending on its mobility. A cluster is formed by combining nodes with the same average speed. The multi-hop topology and single-hop topology are used for linking various clusters and the nodes within a cluster. The clustering algorithm requires only the distribution of status messages of the node's, since it is a mobility-based algorithm. Therefore, for the first time, whenever these nodes are employed on the roadside, they begin to convey their status information without an elected cluster heads (CHs). Once all of the nodes in the network receive these messages by range, they start forming a cluster, admiring each other's mobility patterns. Maximum average speed clusters is given preference for safety message distribution, which can be accomplished by the TDMA mechanism. The mechanism for this is shown in Algorithm 2.  
```
1 P transfers HELLO beacons to every \(T_{HELLO}\)
2 Every recipient verifies its similarity with P
3 iftruethen
4 Z computes the coordinates of P
5 P add and update its adjacent entry list
```  
**Algorithm 2**Signaling process of the HELLO message.  
All of the nodes within the system broadcasts HELLO messages to maintain positioning information. The HELLO message contains information about mobility range, position, and node ID. The HELLO message transmission period is denoted by \(T_{HELLO}\). In case a HELLO message is received by some node Z, it verifies its likeness with another node P. A node accepts the surrounding nodes travelling in a similar direction by restricting the transfer of the traffic in the opposite direction. A neighboring cluster's positional information is recorded by broadcasting the HELLO messages. These data are given as the input to the clustering algorithm.  
Cluster-dependent routing protocol has four phases: selecting the cluster head, data aggregation, formation of cluster, and transmission of data. Figure 2 shows mobility-dependent clustered hops. This scheme produces comparatively steady clustering framework by invalidating the cluster head election overhead. Short duration cluster is given superior access to the channel. Later, channel access is given to a long duration cluster. Anyhow, by including the variation of speed, the partitioning of the network is performed with a minimum number of clusters in such a way that the node's distribution with the highest possibility is conducted depending on its mobility structure. Our developed scheme uses-the TDMA schema for allocating time periods to clusters for intra-cluster communication. This is performed by determining the hop for transmitting the message, depending on the slots' availability in the cluster. Cluster formation is performed with similar direction nodes. Accordingly, in our work, we considered all of the surrounding hops that travels in the similar direction. Though the variation in speed level is high due to this, surrounding hops cannot be included in the cluster.  
Our developed protocol achieves minimum interference and incremented bandwidth usage when the nodes are consistently dispersed on the roads. However, the slot requirement will vary when vehicular density is nonuniform, thus leading to interference, inefficient bandwidth utilization, and broadcast storming. Due to this reason, we considered the constant vehicular density and the hops travelling with constant speed during the simulation time. The assumed realistic slot of 2.5 min coins justify our work. The formation of such expectations aims to overcome the overhead carried by CH election process.