## 7 Broadcast Scheduling in VANETs  
VANET Medium Access Control (MAC) manages the necessary vehicle transmission. VANET features such as fast-evolving topology, robust node connectivity, and QoS make it hard to develop MAC protocols. A Discrete Firefly Algorithm (DFA) approach has not been used to solve the diffusion scheduling problem in VANETs, to the best of our knowledge. Contention-based and contention-free are the two classifications of MAC protocols. Each node must interact with other nodes in the network to enter the stream if it wants to transfer information. However, contention-free procedures enable only one server at any moment to connect and thus be free from collision [74]. A standard for vehicle communication is IEEE 802.11p [75]. The IEEE 802.11p MAC protocol operates on both Enhanced Distributed Channel Access (EDCA) and Collision Avoidance Multiple Access Carrier Sense (CSMA/CA), and it employs a priority entry scheme. A broadcasting method cannot be enabled without interruption since it is a contention-based MAC. A disputed system [76] employs an advanced broadcasting technology without collision and late messages. Adaptive broadcast frame (ABF) is also used, which is further split into time zones. A particular vehicle is designated for the collision-free delivery of safety messages at each instant period. The authors created a contention-free MAC protocol for VANETs in [77]. In contrast to DMMAC, VeMAC provides control channel multi-hop broadcasting service (CCH) with a mechanism to stop concealed terminal issues brought on by moving vehicles. There are already a number of images in [77; 78] that do not work well with the rapid geometry of VANET. The proportion of frames is either slightly greater than or not enough for the required amount. The authors of [77; 79] decreased crash frequency by  
\begin{table}
\begin{tabular}{c c c c c} \hline \hline  
identifying various disjoint time zones for left-and-right and RSU cars. In [79], the duration of the image is twice as long or reduced according to the circulation density. It often uses a separate tree method to decrease the likelihood of crashes. Efficient and reliable hybrid cars can acquire time frames through MAC's environment during the contention-based booking phase or switch the three-way WSA/RFS handshake [80]. A vehicle must send an RFS to the service provider for verification with an ACK signal to use the service. When ACK signals are received, nodes can transmit non-safety alerts without the danger of crashes with neighboring cars. Since we have regarded a VANET depending on TDMA, setting aside time slots will allow for improved transmission without a crash. Through an evolutionary process that takes interference constraints into account, the channel planning problem is developed. The evolving strategy achieves two objectives:  
* Reducing time periods. * Enhancing the network stream using variables by increasing the number of broadcasts without human interaction. The broadcasting problem has previously been addressed by a number of algorithms. The majority of diffusion planning issues are solved by scheduling a time period during which each unit is given a communication space and reconstitutes by synchronizing its cores. It has been demonstrated that the issue of channel scheduling is NP-complete [81; 82]. In [29; 81], developmental techniques are shown to be efficient in fixing issues such as routing procedures, topology management, and programming. Evolutionary computers seem to offer optimal alternatives for NP in most instances for entire issues. Ant Colony Optimization is used in an intelligent urban setting to optimize car congestion. The authors suggest a structure that defines an ideal route to keep vehicles flowing on the highway [83]. Moreover, [84] shows the use of Particle Swarm Optimization (PSO) to rectify very-large-scale integration (VLSI) circuits. The technique of building an integrated circuit by fitting millions or billions of MOS transistors onto a single chip is known as very-large-scale integration.