# A Power Control Algorithm Based on Chicken Game Theory in Multi-Hop Networks
## 4 Simulation Analyses
Capacity--maximum data transmission rate for the link with the lowest processing power in the network. 4. Energy efficiency--the ratio of the sum figure of the messages received compared to the energy consumed in broadcasting each unit. Due to the hidden terminal problem, with the increase of the node's DCGAPC, message collision is aggravated, so the broadcast success rate is reduced, which can be seen in Table 3.  
The MINPCA can decrease the power consumption of all the nodes: however, it cannot decrease the interference caused by hidden terminals. Moreover, because of the simple use of low-power transmissions, the received signal-to-noise power ratio (SNR) is relatively small, so its anti-interference ability is weak. Consequently, the average number of successfully received messages is less than the other two algorithms. When the DCGAPC is heavy, the broadcast success rate of DCGAPC is basically the same as that of MAXPCA. Figure 4 shows the success rates of the three algorithms. When the DCGAPC is heavy, the broadcast success rate of MINPCA is worse than that of the other two methods. The broadcast success rate of DCGAPC is basically the same as that of MAXPCA. The broadcast success rate using MINPCA can reduce the power consumption of nodes, but it cannot reduce the interference caused by hidden terminals. Furthermore, because of the simple use of low-power transmissions, the received SNR is relatively small, so its anti-interference ability is also weak. Figures 5-7 show the interference distributions of the three algorithms. MAXPCA produces the most interference with e\({}^{-7}\)\(\sim\)e\({}^{-8}\) level/magnitude. However, MINPCA generates less interference with e\({}^{-10}\)\(\sim\)e\({}^{-11}\) level/magnitude due to its low sending power. DCGAPC shows the least interference, with only e\({}^{-11}\) level/magnitude. Because this algorithm can regulate the sending power via the condition of the channels, its interference is less than the other two methods. \begin{table}
\begin{tabular}{c c c c} \hline
**Traffic Rate** & **Average Received Packets** & **Average Received Packets** & **Average Received Packets** \\
**(Packets/s)** & **in MAXPCA (Packets/s)** & **in DNGAPC (Packets/s)** & **in MINPCA (Packets/s)** \\ \hline
100 & 18,521.23 & 17,099.79 & 14,582.11 \\
50 & 23,019.76 & 22,693.27 & 20,004.04 \\
34 & 26,888.89 & 26,573.79 & 19,192.84 \\
25 & 21,078.25 & 20,505.26 & 12,365.07 \\
20 & 16,891.68 & 16,462.47 & 10,921.1 \\
17 & 14,114.03 & 13,728.13 & 9737.36 \\
15 & 12,094.9 & 11,760.88 & 8717.33 \\
13 & 10,575.78 & 10,290.26 & 7850.96 \\
11 & 9402.22 & 9174.83 & 7157.29 \\
10 & 8443.6 & 8255.2 & 6513.05 \\ \hline \end{tabular}
\end{table} 
Table 3: Average successful received number of messages. Figure 4: Comparison of the success rate of algorithm broadcasting. Figure 5: MAXPCA algorithm interference distribution (50 nodes). Figure 6: DCGAPC algorithm interference distribution (50 nodes). Because DCGAPC can deal with interference and has a lower delay, the number of message collisions and channel contentions are all less than MAXPCA, as can be seen in Figures 5-7. Figure 8 shows the delay in the three algorithms, and Figure 9 shows their system capacity. In Figure 8, the capacity of the three algorithms increases linearly when the business load increases. Capacity is at its peak when the load reaches 0.04 (s/packet). In Figures 8-10, the confidence intervals are also shown. Although the simulation uses the same confidence interval with each of the three different algorithms, the DCGAPC shows more efficiency. Typically, when dynamic Tx power is applied to DCGAPC, the transmission range of each node tends to be changed (the same as energy consumption). Thus, a DCGAPC should have increased efficiency. After this peak value, the capacities of the three algorithms decline, irrespective of the load increases. This decline is due to the broadcast storm produced by a broadcast when the load reaches the threshold 0.04 (s/packet).