## 2 Relevant Work
\begin{table}
\begin{tabular}{c c c c} \hline \hline
**Protocol** & **Method** & **Advantages** & **Gaps** \\ \hline \multirow{2}{*}{IT-CAT [21]} & Traffic is categorized to have four and high bandwidth in & \multirow{2}{*}{Channel access activity is greatly relaxed for critical} & \multirow{2}{*}{Critical data comes interrupt the opposing transmission.} \\  & addition to the priority, Algorithms are proposed to deal with the channel access delay and user conflicts & & \\  & & & \\ \hline \multirow{2}{*}{DPCA [23]} & Capacity of routing path and network is measured to & \multirow{2}{*}{Ideploy priority data is transmitted early instead of the previous priority in set assigned.} \\  & ensure transmission of higher priority data to the task & & \\ \hline \multirow{2}{*}{TAM-MAC [7]} & Adaptive super-frame structure to provide differentiated & \multirow{2}{*}{Emergency traffic gets only channel access due to having shorter contention window} & \multirow{2}{*}{\begin{tabular}{c} Centrication window is partially shared between regular and emergency traffic, which shows the possibility of channel access for high priority traffic. \\ \end{tabular} } \\  & channel access to neural and emergency traffic & & \\ \hline \multirow{2}{*}{Ugg Mac [7]} & \multirow{2}{*}{Ideploy and access support for urgent} & \multirow{2}{*}{Ideploy capacity due to integrating many transmission schemes, multitasking traffic} \\  & & & \\ \hline \multirow{2}{*}{Priority guaranteed MAC [7]} & Integrated structure of 80.15, 4579 distributed with prioritized & \multirow{2}{*}{Ideploy and access support for urgent} & \multirow{2}{*}{\begin{tabular}{c} Upport traffic can recover energy consumption consumption of one event-time radio data on the channel and hence the delay received location. \\ \end{tabular} } \\  & CSMA/CA and network analysis & & \\ \hline \multirow{2}{*}{PIRC [27]} & Data rate adjustment based on the node priority, fairness of & \multirow{2}{*}{\begin{tabular}{c} A1 the request that adapts one time for access to a temporary congestion transmission, \\ Nodes are the network throughput, \\ ensures that data are likely higher priority which \\ ensures that data in transit reaches the sink quickly. \\ \end{tabular} } \\  & & & \\ \hline \multirow{2}{*}{PA-MAC [21]} & Fractionalization of continuous window and transmission slots to different categories of traffic & \multirow{2}{*}{\begin{tabular}{c} Distributed data has a higher chance of \\ early transmission \\ \end{tabular} } & \multirow{2}{*}{\begin{tabular}{c} Frequency value can recover the congestion transmission. \\ Transactionaction takes as shared between two high priority data, \\ howevering the channel access probability for high priority packets. \\ \end{tabular} } \\  & & & \\ \hline \multirow{2}{*}{Priority-Based Data Scheduling Framework [7]} & Different values of contention window are assigned to & \multirow{2}{*}{\begin{tabular}{c} Nodes with high priority data could transmit earlier, \\ Routing algorithm is also developed to support the \\ priority mechanism. \\ \end{tabular} } \\  & & & \\ \hline \multirow{2}{*}{IMAC [29]} & Modified upper frame structure with short interruption & \multirow{2}{*}{\begin{tabular}{c} The coordinator can interrupt the receiving queue \\ take in the header \\ \end{tabular} } \\  & & & \\ \hline \multirow{2}{*}{PATS [20]} & Game theory algorithm is used for assigning priority to the & \multirow{2}{*}{\
\begin{tabular}{c} The critical hash monitoring data outside the \\ transmitted earlier to the neighboring assignment. \\ \end{tabular} } \\  & & & \\ \hline \multirow{2}{*}{RoadNet [7]} & High priority data is transferred using low overhead & \multirow{2}{*}{
\begin{tabular}{c} Released overhead due to need for explicit \\ conditions between the nodes. \\ Allow transmission of high priority data even when \\ the dataset is busy. \\ \end{tabular} } \\  & & & \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Review of Priority MAC Mechanisms for WSNs.